How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Clean and dirty ancillas
Definition
Let be a finite ordered quantum register and let be an ordered register of ancilla qubits, with Hilbert spaces and . Write , including when . Let be a unitary on and let be a unitary on .
The register is a clean ancilla register for and when
for every vector . Thus the data operation is independent of the input vector and all clean wires return exactly to zero.
The register is a dirty ancilla register for and when the operator identity holds on . Equivalently, every product input is mapped to , with the same for every data and ancilla vector. This requires exact restoration of an arbitrary, initially unknown ancilla state and forbids residual data–ancilla correlation.
These are exact contracts for the complete subroutine. A temporary intermediate alteration of an ancilla is permitted if the full unitary satisfies the stated identity.
Remarks
The reference-register and arbitrary-matrix consequences are proved in Clean and dirty ancilla identities extend to references and mixed states.
Depends on
Used by
- Controlled input-consistency reflection from a bit query Algorithm
- Controlled T using a clean ancilla Algorithm
- Exact success amplification by attenuating the good branch Algorithm
- Gray-Path Synthesis of a Two-Level Gate Algorithm
- Isometry Unitary Completion Algorithm
- Power-of-two dihedral hidden-subgroup sieve Algorithm
- Reversible binary dot-product query Algorithm
- Reversible embedding of a Boolean circuit Algorithm
- Reversible modular multiplication by a unit Algorithm
- Reversible zero-completion of an N-address bit query Algorithm
- Segmented Taylor LCU simulator Algorithm
- Circuit Optimization Task Definition
- Circuit-family and computation cost model Definition
- Coherent variable-time algorithm model Definition
- Finite quantum promise-computation model Definition
- Hamiltonian simulation error and resources Definition
- LCU decomposition and access model Definition
- Term-list Hamiltonian access Definition
- Uniform verifier interface with a quantum witness Definition
- A reversible AND oracle with clean work Example
- Oracle conversion and uncomputation examples Example
- Circuit Resource Composition Lemma
- Clean and dirty ancilla identities extend to references and mixed states Lemma
- Clean reversible controlled multiplication by a cyclic constant Lemma
- Linear Multicontrolled X with One Borrowed Wire Lemma
- Toffoli computes into a clean target and uncomputes it Lemma
- Clean ancilla controlled T circuit is exact Proposition
- Bounded-error repetition amplification is correct and uniform Theorem
- Clean Ancilla Multicontrolled Tradeoff Theorem
- Compute-copy-uncompute restores clean workspace Theorem
- Compute-copy-uncompute yields a clean coherent function query Theorem
- Correctness of the reversible modular multiplier Theorem
- Exact-success amplitude amplification query cost Theorem
- Gate, workspace, and serial-depth costs of reversible embedding Theorem
- Kuperberg dihedral hidden-subgroup scope and resource claim Theorem
- Multicontrolled Unitaries with and without a Clean Work Bit Theorem
- Reversible binary dot product: correctness and exact cost Theorem
- The controlled input-consistency circuit realizes the exact reflection Theorem
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- John Preskill, Quantum Computation, Chapter 5: Classical and Quantum Circuits (updated July 2015) (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)