One clean qubit

In quantum information, the one clean qubit model of computation is performed an n qubit system with one pure state and n-1 maximally mixed states.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In quantum information, the one clean qubit model of computation is performed an n qubit system with one pure state and n-1 maximally mixed states. This model was motivated by highly mixed states that are prevalent in nuclear magnetic resonance quantum computers.

It's described by the density matrix \rho = \left|0\right\rangle \langle 0| \otimes \frac{I}{2^{n-1}} , where I is the identity matrix. In computational complexity theory, DQC1; also known as the deterministic quantum computation with one clean qubit is the class of decision problems solvable by a one clean qubit machine in polynomial time, upon measuring the first qubit, with an error probability of at most 1/poly(n) for all instances.

Error bounds and composability

The most standard definition of DQC1 requires that measuring the output qubit correctly accepts or rejects the input, with error at most 1/q(n) for specified some polynomial q, given a gap in acceptance probabilities of [0,1/2-1/q(n)] for NO instances and [1/2+1/q(n),1] for YES instances. Most probabilistic classes, such as BPP, BQP, and RP are agnostic to the precise probability gap, because any polynomial acceptance gap can be amplified to a fixed gap such as (1/3,2/3).

A notable outlier is PP, which permits exponentially small gaps. DQC1 does not admit an obvious notion of parallel composability or amplification: there is no clear construction to transform a circuit with, say, a (2/5,3/5) acceptance gap into a more accurate (1/5,4/5) acceptance gap.

It is known that DQC1 offers composability in the sense that the "one" clean qubit can be upgraded to "two" clean qubits, or even log(n) many clean qubits, without modifying the class Computation with Unitaries and One Pure Qubit. D. J. Shepherd. It is also not strengthened by measuring all of these clean qubits (as opposed to just the first clean qubit).

Relation to other classes

Because as many as O(\log(n)) qubits are permitted, DQC1 contains all logspace computations. It is closed under \oplus L reductions as well. It is not known to contain BPP or even P. It is contained in BQP, and it is conjectured that this is containment is strict.

It is known that simulating the sampling problem even for 3 output qubits is classically hard, in the sense that it would imply a PH collapse. The term DQC1 has been used to instead refer to decision problems solved by a polynomial time classical circuit that adaptively makes queries to polynomially many DQC1 circuits.

In this sense of use, the class naturally contains all of BPP, and the power of the class is focused on the "inherently quantum" power.

Trace estimation

Trace estimation is complete for DQC1. Let U be a unitary 2^n \times 2^n matrix. Given a state |\psi\rangle , the Hadamard test can estimate \left\langle\psi\right| U \left|\psi\right\rangle where \frac{1}{2} + \frac{1}{2}\mathcal{Re}(\left\langle\psi\right| U \left|\psi\right\rangle) is the probability that the measured clean qubit is 0.

I/2^n mixed state inputs can be simulated by letting |\psi\rangle be chosen uniformly at random from 2^{n} computational basis states. When measured, the probability that the final result is 0 is \frac{1}{2^n} \sum_{x \subset \{0, 1\}^n} \frac{1+\mathcal{Re}\left\langle x\right| U \left| x\right\rangle}{2} = \frac{1}{2} + \frac{1}{2} \frac{\mathcal{Re}(Tr(U))}{2^n} .

To estimate the imaginary part of the Tr(U) , the clean qubit is initialized to \frac{1}{\sqrt{2}}\left(\left|0\right\rangle - i\left|1\right\rangle \right) instead of \frac{1}{\sqrt{2}}\left(\left|0\right\rangle +\left|1\right\rangle \right) .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1315037531 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001315037531 · captured 2025-10-04 · not yet sealed in the ledger · verify the chain · version history

Cite this page as: encyclopegia.org, “One clean qubit”, snapshot enwiki-001315037531. https://encyclopegia.org/a/one-clean-qubit

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.