Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 θ∈R, let Pα=diag⁡(1,eiα) and Rz(α)=diag⁡(e−iα/2,eiα/2). Define CPθ=diag⁡(1,1,1,eiθ) in the control-first basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩. Define CNOT by ∣a,b⟩↦∣a,b⊕a⟩, where a,b∈{0,1} and ⊕ is addition modulo two. The continuous phase-gate model permits each Pα exactly for real α. On an additional control qubit define C(M)=diag⁡(I4,M) in control-first order. The two-qubit circuit that applies CNOT, then P−θ/2 to the target, then CNOT, then Pθ/2 to each wire implements CPθ. Replacing the three P gates by their Rz representatives gives e−iθ/4CPθ; here Pα=eiα/2Rz(α).

For the three-qubit factorization, use the lexicographically ordered basis ∣a,b,c⟩ with a,b,c∈{0,1}. A gate Pα(j) multiplies this basis vector by eiαxj, where (x1,x2,x3)=(a,b,c); CNOT⁡i→j toggles bit xj by xi and fixes the other bits. These explicit basis actions fix the wire order used below.

For 0<ε<1/2, the fixed-arity compiler gives a projective operator approximation within ε when applied to the complete CPθ block. If this block is controlled by an additional qubit, one valid approach is to apply the compiler to the complete three-qubit controlled-CPθ matrix. A phase-minimized approximation to CPθ cannot in general be controlled without restoring its relative phase: if ∥CPθ−μW∥≤ε and ∣μ∣=1, then ∥C(CPθ)−(diag⁡(1,μ)⊗I4)C(W)∥≤ε. Thus phase restoration is another valid approach when C(W) 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 Rz circuit from the first paragraph gives C(e−iθ/4CPθ)=(diag⁡(1,e−iθ/4)⊗I4)C(CPθ); applying Pθ/4 to the added control restores the exact controlled target in the continuous phase-gate model.

Facts & Assumptions

Given: θ∈R, the ordered basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩, and the continuous phase-gate model, and 0<ε<1/2 for the approximation claims.

[F1]

Controlled Phase Rotation defines the exact phase gate Pθ=diag⁡(1,eiθ) and its control-first block CPθ=diag⁡(1,1,1,eiθ).

[F2]

Global Phase Under Control: for a unit scalar λ, C(λU)=(Pλ⊗I)C(U); the scalar becomes a relative phase on the active control block.

[F3]

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

1.1givenF1algebra

On a basis vector ∣ab⟩, the first CNOT maps it to ∣a,b⊕a⟩. The target phase contributes e−iθ(b⊕a)/2; the second CNOT restores ∣ab⟩; and the two final phase gates contribute eiθ(a+b)/2. The product is eiθab, which is 1 on ∣00⟩,∣01⟩,∣10⟩ and eiθ on ∣11⟩. This is exactly CPθ from [F1].

2.1givenF1step 1.1algebra

Direct diagonal multiplication gives Pα=eiα/2Rz(α), hence Rz(α)=e−iα/2Pα. Replacing P−θ/2 on the target contributes eiθ/4, while replacing each of the two Pθ/2 gates contributes e−iθ/4. Their product is e−iθ/4, so the resulting Rz circuit is e−iθ/4CPθ.

2.2F2F3step 1.1algebra

The circuit in step 1.1 is an exact factorization of the two-qubit CPθ into three one-qubit phase gates and two CNOTs. Applying [F3] therefore gives a word W and unit scalar μ with ∥CPθ−μW∥≤ε. By [F2], C(μW)=(diag⁡(1,μ)⊗I4)C(W). The difference C(CPθ)−C(μW)=diag⁡(0,CPθ−μW) has norm exactly ∥CPθ−μW∥: on a vector (x,y) it acts as (0,(CPθ−μW)y), giving the upper bound, and vectors (0,y) give equality. Consequently the displayed phase-corrected controlled approximation has error at most ε. If μ≠1, the correction diag⁡(1,μ) 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 C(W) to be available.

3.1F2step 2.1algebra

With λR=e−iθ/4 from step 2.1, [F2] gives C(λRCPθ)=(diag⁡(1,λR)⊗I4)C(CPθ). Applying Pθ/4=diag⁡(1,λR‾) to the outer control restores the exact controlled target in the continuous phase-gate model.

4.1F3givenalgebraconstruct∎

The complete controlled target is the diagonal three-qubit matrix Dθ=diag⁡(1,1,1,1,1,1,1,eiθ). For bits a,b,c∈{0,1}, put pab=a⊕b, pac=a⊕c, pbc=b⊕c, and pabc=a⊕b⊕c. Checking the four possible Hamming weights 0,1,2,3 makes the right side respectively 0,0,0,4, so 4abc=a+b+c−pab−pac−pbc+pabc. Apply Pθ/4 to each single bit. To apply P−θ/4 to pab, use a CNOT with control b and target a, apply P−θ/4 to wire a, and undo that CNOT; the target wire then again contains a. Use the corresponding pairs for pac and pbc. To apply Pθ/4 to pabc, use two CNOTs into wire a, apply Pθ/4 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 eiθabc, so this is an exact factorization of Dθ with seven one-qubit phase gates and ten CNOTs. Applying [F3] to this complete three-qubit factorization gives a projective operator approximation to Dθ 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