Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 ∣a,b,0⟩ as ∣a,b,0⟩↦ωab∣a,b,0⟩. Consequently it implements C(T) on the two data bits and returns the clean ancilla to ∣0⟩, also when the data is entangled with any finite-dimensional reference register.

Facts & Assumptions

Given: a,b,t,q∈{0,1}, ω=eiπ/4, the ordered computational basis, and the displayed chronological gate word.

[F1]

Controlled T using a clean ancilla: the Toffoli block is Ht,Cb,t,Tt†,Ca,t,Tt,Cb,t,Tt†,Ca,t,Tb,Tt,Ht,Ca,b,Ta,Tb†,Ca,b.

[F2]

Clifford+T gate library and exact matrices: H acts by H∣q⟩=(∣0⟩+(−1)q∣1⟩)/2, T∣q⟩=ωq∣q⟩, and CNOT adds the control bit modulo 2 to its target.

[F3]

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.

[F4]

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.

[F5]

Controlled Unitary Access: C(T)=diag⁡(I2,T) in the control-first basis.

[F6]

Clean and dirty ancillas: a clean ancilla is initialized in the specified zero state and must be returned exactly for every allowed data input.

[F7]

Toffoli and Fredkin gates: T∣a,b,t⟩=∣a,b,t⊕ab⟩; applying this action twice restores t.

Proof

1.1F1F2F3F4F7givenalgebra

Fix the controls a,b and let q be the target bit immediately after the first Ht. The seven phase gates in [F1] contribute exponent Ea,b(q)=−(q⊕b)+(q⊕a⊕b)−(q⊕a)+b+q(mod8). For (a,b)=00,01,10,11, the pairs (E(0),E(1)) are respectively (0,0),(1,1),(0,0),(7,3). Conjugating these diagonal phases by the final Ht therefore gives, for the four control values, I,ωI,I,ω7X on the target. The last CNOT–Ta–Tb†–CNOT block contributes data phase ωa−(a⊕b), which is 1,ω−1,1,ω in the same order. The combined action is exactly ∣a,b,t⟩↦∣a,b,t⊕ab⟩ with phase 1 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.

2.1F1F3F4F7step 1.1algebra

Starting with t=0, the first Toffoli sends ∣a,b,0⟩ to ∣a,b,ab⟩. The middle Tt multiplies this vector by ωab; applying the Toffoli action [F7] again gives target ab⊕ab=0. Thus the full circuit sends each basis vector to ωab∣a,b,0⟩. The matrix product is the chronological circuit action by [F3,F4].

3.1F5F6step 2.1algebra∎

Every vector on data and a finite-dimensional reference with a clean ancilla has the finite expansion ∑a,b,rcabr∣a,b,r⟩∣0⟩. Applying step 2.1 termwise gives ∑a,b,rcabrωab∣a,b,r⟩∣0⟩, which is C(T) 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 ab=1 as 110↦111 and 111↦110, and identity action on the other six, all with phase 1.

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