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 designated controlled- gates and fixes an integer , with and those gates at times ; if the source circuit has none, the hard-instance compiler can add a cancelling pair, after which this restriction applies. On , let each designated controlled- gate at time be preceded at times by on its first and second work wires, respectively, and followed at times by on those wires. Since , all clock indices lie in . Each wire receives two gates; they commute with controlled- and square to identity, so the insertions preserve the verifier unitary. Write , , and . Define Put . Each displayed summand is at most 2-local. On the four physical work sectors , the legal-clock matrix on the adjacent coordinates is respectively , where In block-history coordinates the phase conjugates the -sector to . After the common normalization, every sector therefore dominates one copy of . Summing these lower bounds over blocks and basis labels gives Its kernel is the full correct-propagation space and its gap is at least . If the remaining terms have norm at most , choosing makes the restriction error less than .
Facts & Assumptions
Given: The padded controlled- verifier, the listed KKR terms, and bounding the remaining terms on .
KKR restriction to correct one-qubit propagation: has the block-history basis and correct one-qubit propagation.
Projection lemma for a large penalty: a penalty with gap incurs error at most .
Propagation kernel and path-Laplacian gap: a half-weight path on vertices has gap .
Proof
Let project onto and order the physical work sectors as . The two inserted gates after the controlled- gate give forward snapshot sign vectors on clocks , up to a common phase; the two preceding gates give the same four vectors on . On legal clock words, the forward part of has matrix on its three snapshots, and the backward part is its reflected copy. Direct multiplication gives with , so the two parts contribute to the two endpoint diagonal entries in physical clock coordinates. There are no cross-endpoint entries from . The work coefficient of is , and its clock bit-flip contributes that coefficient directly to the off-diagonal entries in physical coordinates. The resulting matrices are on each diagonal and off diagonal: they are , respectively. In the block-history basis, the state at the later endpoint includes the controlled- phase; in sector this changes its sign, conjugating to . The common block normalization is , so after this basis change every sector dominates one copy of .
At boundary , the computational basis vectors in are the normalized block histories . The clock endpoint projectors compress as and . Since , its cross term compresses to , with the adjoint giving the reverse block. Substitution into the half-weight propagation edge gives , where . Summing over boundaries gives the displayed . 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 blocks scaled by , so [F3] gives gap at least .
Since , it suffices for a lower bound to retain on . Apply [F2] within that subspace using kernel and penalty gap . The inequality makes the projection error less than . All quantities are polynomially bounded and is inverse polynomial, so an integer 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
- Julia Kempe, Alexei Kitaev, and Oded Regev, The Complexity of the Local Hamiltonian Problem (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)