Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

KKR restriction to correct two-qubit propagation

Statement

Assume the padded verifier has T2≥1 designated controlled-Z gates and fixes an integer L≥5, with T=(T2+1)L−1 and those gates at times t=lL; if the source circuit has none, the hard-instance compiler can add a cancelling pair, after which this restriction applies. On Sprop1, let each designated controlled-Z gate at time t=lL be preceded at times t−2,t−1 by Z on its first and second work wires, respectively, and followed at times t+1,t+2 by Z on those wires. Since L≥5, all clock indices t−3,…,t+3 lie in 1,…,T. Each wire receives two Z gates; they commute with controlled-Z and square to identity, so the insertions preserve the verifier unitary. Write Pa=∣a⟩⟨a∣, P10=∣10⟩⟨10∣, and X=∣0⟩⟨1∣+∣1⟩⟨0∣. Define Hqubit,t=12(−2P0ft−2P0st+P1ft+P1st)⊗XCt, 8Htime,t=I⊗[P10t,t+1+6P10t+1,t+2+P10t+2,t+3+2∣11⟩⟨00∣t+1,t+2+2∣00⟩⟨11∣t+1,t+2+Xt+1+Xt+2+P10t−3,t−2+6P10t−2,t−1+P10t−1,t+2∣11⟩⟨00∣t−2,t−1+2∣00⟩⟨11∣t−2,t−1+Xt−2+Xt−1]. Put Hprop2=∑l=1T2(Hqubit,lL+Htime,lL). Each displayed summand is at most 2-local. On the four physical work sectors 00,01,10,11, the legal-clock matrix on the adjacent coordinates ∣ct−1⟩,∣ct⟩ is respectively 4D−,D−,D−,2D+, where D−=12(∣ct−1⟩−∣ct⟩)(⟨ct−1∣−⟨ct∣),D+=12(∣ct−1⟩+∣ct⟩)(⟨ct−1∣+⟨ct∣). In block-history coordinates the CZ phase conjugates the 11-sector D+ to D−. After the common 1/L normalization, every sector therefore dominates one copy of D−/L. Summing these lower bounds over blocks and basis labels gives H′=12L∑l,i(∣ηl−1,i⟩−∣ηl,i⟩)(⟨ηl−1,i∣−⟨ηl,i∣). Its kernel is the full correct-propagation space Sprop and its gap is at least g2=2/[L(T2+1)2]. If the remaining terms have norm at most K2, choosing J2g2>2K2+K22/ϵ2 makes the restriction error less than ϵ2.

Facts & Assumptions

Given: The padded controlled-Z verifier, the listed KKR terms, and K2 bounding the remaining terms on Sprop1.

[F1]

KKR restriction to correct one-qubit propagation: Sprop1 has the block-history basis ∣ηl,i⟩ and correct one-qubit propagation.

[F2]

Projection lemma for a large penalty: a penalty with gap J incurs error at most K22/(J−2K2).

[F3]

Propagation kernel and path-Laplacian gap: a half-weight path on T2+1 vertices has gap 1−cos⁡(π/(T2+1))≥2/(T2+1)2.

Proof

1.1F1givenalgebra

Let Π1 project onto Sprop1 and order the physical work sectors as 00,01,10,11. The two inserted Z gates after the controlled-Z gate give forward snapshot sign vectors sb=(1,1,1),(1,1,−1),(1,−1,−1),(1,−1,1) on clocks t,t+1,t+2, up to a common phase; the two preceding Z gates give the same four vectors on t−3,t−2,t−1. On legal clock words, the forward part of Htime,t has matrix M=18(112161211) on its three snapshots, and the backward part is its reflected copy. Direct multiplication gives sb∗Msb=ab with ab=(2,1/2,1/2,1), so the two parts contribute ab to the two endpoint diagonal entries in physical clock coordinates. There are no cross-endpoint entries from Htime,t. The work coefficient of Hqubit,t is db=(−2,−1/2,−1/2,1), and its clock bit-flip contributes that coefficient directly to the off-diagonal entries in physical coordinates. The resulting matrices are ab on each diagonal and db off diagonal: they are 4D−,D−,D−,2D+, respectively. In the block-history basis, the state at the later endpoint includes the controlled-Z phase; in sector 11 this changes its sign, conjugating 2D+ to 2D−. The common block normalization is 1/L, so after this basis change every sector dominates one copy of D−/L.

1.2F1F3algebra

At boundary t=lL, the computational basis vectors in Sprop1 are the normalized block histories ∣ηl−1,i⟩,∣ηl,i⟩. The clock endpoint projectors compress as Π1(I⊗∣ct−1⟩⟨ct−1∣)Π1=L−1∑i∣ηl−1,i⟩⟨ηl−1,i∣ and Π1(I⊗∣ct⟩⟨ct∣)Π1=L−1∑i∣ηl,i⟩⟨ηl,i∣. Since Ut=CZ, its cross term compresses to Π1(CZ⊗∣ct⟩⟨ct−1∣)Π1=L−1∑i∣ηl,i⟩⟨ηl−1,i∣, with the adjoint giving the reverse block. Substitution into the half-weight propagation edge gives L−1∑iD−(ηl−1,i,ηl,i), where D−(u,v)=12(∣u⟩−∣v⟩)(⟨u∣−⟨v∣). Summing over boundaries gives the displayed H′. Its kernel consists exactly of equal adjacent block-history coefficients, i.e. the full history space with every controlled phase correctly propagated. It is a half-weight path Laplacian on T2+1 blocks scaled by 1/L, so [F3] gives gap at least 2/[L(T2+1)2].

2.1F2step 1.2algebra∎

Since Hprop2∣Sprop1≥H′, it suffices for a lower bound to retain J2H′ on Sprop1. Apply [F2] within that subspace using kernel Sprop and penalty gap J2g2. The inequality J2g2>2K2+K22/ϵ2 makes the projection error less than ϵ2. All quantities are polynomially bounded and g2 is inverse polynomial, so an integer J2 of polynomial size exists.

Depends on

Used by

Dependency tree · two levels

7 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