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 ancilla controlled T circuit is exact
Statement
The procedure of Controlled T using a clean ancilla acts on every computational basis input as . Consequently it implements on the two data bits and returns the clean ancilla to , also when the data is entangled with any finite-dimensional reference register.
Facts & Assumptions
Given: , , the ordered computational basis, and the displayed chronological gate word.
Controlled T using a clean ancilla: the Toffoli block is .
Clifford+T gate library and exact matrices: acts by , , and CNOT adds the control bit modulo to its target.
Denotational semantics of a finite layered circuit: the matrix of a chronological circuit is the product of its gate-embedding matrices, with later gates multiplying on the left.
A local gate has a unique global wire embedding: a gate occurrence acts on its named ordered wires and as identity on all complementary wires.
Controlled Unitary Access: in the control-first basis.
Clean and dirty ancillas: a clean ancilla is initialized in the specified zero state and must be returned exactly for every allowed data input.
Toffoli and Fredkin gates: ; applying this action twice restores .
Proof
Fix the controls and let be the target bit immediately after the first . The seven phase gates in [F1] contribute exponent . For , the pairs are respectively . Conjugating these diagonal phases by the final therefore gives, for the four control values, on the target. The last CNOT–––CNOT block contributes data phase , which is in the same order. The combined action is exactly with phase in all eight cases, proving the displayed word is Toffoli in the sense of [F7]. By [F3,F4], these basis actions give the denotational matrix of the displayed chronological circuit.
Starting with , the first Toffoli sends to . The middle multiplies this vector by ; applying the Toffoli action [F7] again gives target . Thus the full circuit sends each basis vector to . The matrix product is the chronological circuit action by [F3,F4].
Every vector on data and a finite-dimensional reference with a clean ancilla has the finite expansion . Applying step 2.1 termwise gives , which is on the data and identity on the reference, tensored with the restored zero state, by [F5,F6]. This is the asserted correlated-input action.
Finite certificate
The exact arithmetic check at
research/quantum-computing-algorithms-60-2026-10-15-batch-13-finite-certificates.json
independently applies the 15-gate word to all eight three-bit basis vectors;
the table records the two unchanged inputs with as
and , and identity action on the other six, all with phase .
Unresolved supplier checks
The eight-case word calculation and reference extension are local. The actual QC07, QC09 and QC10 gate, circuit, ancilla and Toffoli bodies were inspected; their exact matrices, ordered-wire convention and clean-return interface agree. This is interface review, not approval of another batch's draft work.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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
- Kliuchnikov, Maslov, and Mosca, Practical approximation of single-qubit unitaries by single-qubit quantum circuits (standard reference, not scraped)