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.
Controlled-Phase Approximation and Global-Phase Boundary
Statement
For , let and . Define in the control-first basis . Define CNOT by , where and is addition modulo two. The continuous phase-gate model permits each exactly for real . On an additional control qubit define in control-first order. The two-qubit circuit that applies CNOT, then to the target, then CNOT, then to each wire implements . Replacing the three gates by their representatives gives ; here .
For the three-qubit factorization, use the lexicographically ordered basis with . A gate multiplies this basis vector by , where ; toggles bit by and fixes the other bits. These explicit basis actions fix the wire order used below.
For , the fixed-arity compiler gives a projective operator approximation within when applied to the complete block. If this block is controlled by an additional qubit, one valid approach is to apply the compiler to the complete three-qubit controlled- matrix. A phase-minimized approximation to cannot in general be controlled without restoring its relative phase: if and , then Thus phase restoration is another valid approach when and the control phase are available. This identity alone assigns no finite-gate cost or controlled black-box access to those operations. In particular, controlling the circuit from the first paragraph gives ; applying to the added control restores the exact controlled target in the continuous phase-gate model.
Facts & Assumptions
Given: , the ordered basis , and the continuous phase-gate model, and for the approximation claims.
Controlled Phase Rotation defines the exact phase gate and its control-first block .
Global Phase Under Control: for a unit scalar , ; the scalar becomes a relative phase on the active control block.
Fixed-Arity Unitary Error Budget gives projective operator error at most for a complete fixed-arity block when an exact factorization into one-qubit gates and CNOTs is supplied.
Proof
On a basis vector , the first CNOT maps it to . The target phase contributes ; the second CNOT restores ; and the two final phase gates contribute . The product is , which is on and on . This is exactly from [F1].
Direct diagonal multiplication gives , hence . Replacing on the target contributes , while replacing each of the two gates contributes . Their product is , so the resulting circuit is .
The circuit in step 1.1 is an exact factorization of the two-qubit into three one-qubit phase gates and two CNOTs. Applying [F3] therefore gives a word and unit scalar with . By [F2], . The difference has norm exactly : on a vector it acts as , giving the upper bound, and vectors give equality. Consequently the displayed phase-corrected controlled approximation has error at most . If , the correction is not a scalar on the control. Omitting it is not justified by the two-qubit projective bound; using it requires both the control phase and to be available.
With from step 2.1, [F2] gives . Applying to the outer control restores the exact controlled target in the continuous phase-gate model.
The complete controlled target is the diagonal three-qubit matrix . For bits , put , , , and . Checking the four possible Hamming weights makes the right side respectively , so . Apply to each single bit. To apply to , use a CNOT with control and target , apply to wire , and undo that CNOT; the target wire then again contains . Use the corresponding pairs for and . To apply to , use two CNOTs into wire , apply there, and undo both CNOTs. On each basis state these circuits restore the original bits and contribute exactly the indicated signed parity phase. The resulting phase is , so this is an exact factorization of with seven one-qubit phase gates and ten CNOTs. Applying [F3] to this complete three-qubit factorization gives a projective operator approximation to itself; its scalar is global on the three-qubit block. This supplies the complete-block compilation option in the statement.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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
- Adriano Barenco et al., Elementary gates for quantum computation, arXiv:quant-ph/9503016v1 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)