Computing with highly mixed states

Simple item page
dc.creatorAmbainis, Andris
dc.creatorSchulman, Leonard J.
dc.creatorVazirani, Umesh
dc.date2000-03-29
dc.date.accessioned2026-07-07T05:59:47Z
dc.date.available2026-07-07T05:59:47Z
dc.descriptionWe consider quantum computing in the k-qubit model where the starting state of a quantum computer consists of k qubits in a pure state and n-k qubits in a maximally mixed state. We ask the following question: is there a general method for simulating an arbitrary m-qubit pure state quantum computation by a quantum computation in the k-qubit model? We show that, under certain constraints, this is impossible, unless m=O(k+ log n).
dc.description8 pages, 3 figures, to appear in proceedings of STOC'00
dc.identifierhttps://arxiv.org/abs/quant-ph/0003136
dc.identifierhttp://arxiv.org/abs/quant-ph/0003136
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88810
dc.subjectQuantum Physics
dc.titleComputing with highly mixed states
dc.typetext

Files

Collections

arXiv