One clean qubit¶

A restricted quantum-computation model whose input is one pure qubit tensored with an otherwise maximally mixed register, followed by a polynomial-size unitary circuit and a bounded-gap decision readout of a designated qubit.

Version: v1 · 2026-09-28 · History
Domain-specific #: 11094
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Quantum Computing, Quantum Complexity Theory → Computer Science & Software Engineering

Core Idea¶

In the one clean qubit model, an n-qubit computation begins in the density operator |0><0| ⊗ I/2^(n−1): one qubit is pure and the remaining register is maximally mixed. A polynomial-size unitary circuit acts on the system, after which a designated qubit is measured. The associated decision class is commonly called DQC1.

Purity is the scarce resource. The mixed register can participate in global unitary evolution even though it contains no chosen classical bit string. Algorithms typically encode a normalized trace or another aggregate property into the clean qubit's expectation. Correct decision behavior requires a specified inverse-polynomial separation of acceptance probabilities, not merely a nonzero theoretical signal.

DQC1 was motivated partly by highly mixed NMR states and lies within BQP, while its exact relationship to classical classes remains constrained by open questions. Standard error reduction is subtle: independent repetition would appear to require independent clean qubits, so amplification and composability cannot be assumed by analogy with BPP or BQP. Results allowing a few or logarithmically many clean qubits must be cited under their precise model.

Structural Signature¶

Sig role-phrases:

clean control qubit. Provides the single pure input state and designated readout channel. Constitutive resource restriction. If altered: Many pure ancillas define another model.
maximally mixed register. Supplies the remaining qubits as I/2^(n-1), without initialized computational basis information. Constitutive input state. If altered: Unknown pure states are not the same density operator.
efficient unitary circuit. Transforms correlations and observable expectation within polynomial resources. Constitutive computation. If altered: Postselection or unrestricted nonunitary reset changes power.
designated measurement. Reads the clean/output qubit or authorized variant to estimate acceptance. Identity-bearing output rule. If altered: Full-state tomography is not part of the basic model.
acceptance gap. Separates YES and NO probabilities by an inverse-polynomial promise/error bound. Necessary decision criterion. If altered: A vanishing unpromised bias does not define a usable decision procedure.

What It Is Not¶

Not one physical qubit total. The model may contain many mixed qubits.
Not BQP with dirty workspace. Only one pure initialization resource is granted.
Not arbitrary mixed-state computing. The exact maximally mixed input is part of the definition.
Not automatically amplifiable. Extra repetitions can consume prohibited purity.

Scope of Application¶

The model is used in quantum complexity, trace estimation, quantum-circuit sampling, NMR-motivated resource studies, and tests of nonclassical advantage with little purity.

Complexity theory. Defines DQC1 decision and sampling tasks.
Trace estimation. Encodes normalized unitary traces in clean-qubit observables.
Resource theory. Studies computational value of small purity.
Classical hardness. Examines consequences of efficient simulation.
NMR context. Motivates computation from highly mixed ensembles.

Clarity¶

State total qubits, exact initial density matrix, circuit uniformity and size, allowed ancillas/resets, output qubits, number of shots, promise gap, and whether the claim concerns decision, expectation estimation, or sampling.

Manages Complexity¶

The model isolates purity from circuit size: one controlled degree of initialization can interrogate an exponentially large mixed space. That abstraction clarifies resources but hides experimental polarization, readout noise, repeated ensembles, and precision cost.

Abstract Reasoning¶

Write the full input density matrix and count every initialized ancilla.
Specify the uniform polynomial circuit and disallow unmodeled purification steps.
Derive the designated-qubit observable or acceptance probability.
Show an inverse-polynomial YES/NO gap and account for sampling precision.
Compare classical or quantum classes only under matching variants and reduction notions.

Knowledge Transfer¶

The idea that a small ordered subsystem probes a disordered environment transfers to metrology and ensemble computation, but DQC1 transfers literally only with its density matrix, circuit restrictions, and complexity-theoretic output rule.

Examples¶

Canonical¶

A circuit starts in |0><0|⊗I/2^(n−1), applies a Hadamard and controlled-U involving the clean qubit, and estimates its X/Y expectation to recover the normalized real/imaginary trace of U.

Mapped back: clean control qubit → pure control/readout; maximally mixed register → I/2^(n−1); efficient unitary circuit → Hadamard and controlled-U; designated measurement → X/Y on control; acceptance gap → inverse-polynomial precision requirement.

Applied / In Practice¶

A complexity analysis of a three-output-qubit sampling variant explicitly states its few-clean-qubit allowance and shows that a proposed efficient classical simulation would entail the cited polynomial-hierarchy consequence, rather than transferring the claim to all mixed quantum circuits.

Mapped back: clean control qubit → bounded clean resource; maximally mixed register → remaining dirty qubits; efficient unitary circuit → sampling circuit family; designated measurement → three authorized outputs; acceptance gap → stated approximation regime.

Structural Tensions¶

T1: minimal purity vs. readout precision. Restricting initialization exposes quantum structure while small signals demand many samples. Diagnostic: Is total sampling cost polynomial?

T2: class definition vs. amplification. Inverse-polynomial bias enables decision while extra clean repetitions are not free. Diagnostic: Which amplification construction respects the resource?

T3: abstract mixed state vs. physical preparation. A maximally mixed register is mathematically simple while experimental ensembles have calibration and noise. Diagnostic: Does the implementation realize the modeled density operator?

Structural–Framed Character¶

One-clean-qubit computation is structural. Density operators, unitaries, measurements, and promise gaps are formal; experimental motivation supplies a frame but not the identity. Its portable skeleton is Resource Constraint, related rather than a strict parent because DQC1 fixes a specialized computational model. Evaluative weight is low; practice enters implementation; origin is quantum information; vocabulary travels only with exact resource accounting. Its character: computation under a severe purity constraint with nontrivial global access.

Structural Core vs. Domain Accent¶

Skeletal core. A small initialized resource controls operations over a large uninitialized state and yields a bounded observable.

Domain-bound accent. Qubits, density matrices, polynomial circuits, measurements, trace estimates, and complexity promises define DQC1.

Why not prime. Resource restriction travels, but this is one quantum complexity model.

This entry is a kind of Quantum-Computation Model.

Resource Constraint. Input purity is explicitly scarce.
Measurement. A designated observable converts evolved state into a decision signal.
No strict DAG edge is added.

Relationships to Other Abstractions¶

Current abstraction One clean qubit Domain-specific

Parents (1) — more general patterns this builds on

One clean qubit is a kind of Quantum-Computation Model Domain-specific

One clean qubit satisfies the defining boundary of Quantum-Computation Model: A quantum-computation model is a formal specification of quantum information carriers, admissible initial states, operations, spatial or circuit organization, resource bounds, noise assumptions, and measurement rules used to define computations and compare computational power.

Hierarchy path (1) — routes to 1 parentless root

One clean qubit → Quantum-Computation Model → Representation → Abstraction

Neighborhood in Abstraction Space¶

One clean qubit sits in a moderately populated region (48^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Single-qubit computing. Tell: Are there many mixed qubits or only one qubit total?
BQP. Tell: How many clean ancillas are permitted?
NMR quantum computing. Tell: Is the complexity model or one physical platform intended?
Dirty ancilla. Tell: Is the state maximally mixed and uncorrelated as required?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/One_clean_qubit (revision 1315037531).
Preserved source candidate: https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.112.130502
Preserved source candidate: https://journals.aps.org/pra/abstract/10.1103/PhysRevA.103.032422

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.