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

History state and padded output

Statement

Let the five-local path in Five-local history-state adiabatic path have N=L+K gates, including its K identity gates, and let V0=I and Vℓ=Uℓ⋯U1. On the legal unary-clock space, the propagation Hamiltonian has kernel {1N+1∑ℓ=0NVℓξ⊗∣cℓ⟩:ξ∈(C2)⊗n}. After adding Hinput, this kernel is one-dimensional and its unit vector is ∣η⟩=1N+1∑ℓ=0NVℓ∣0n⟩⊗∣cℓ⟩. The full Hfinal also has this unique ground state. Its data-register marginal is at trace distance at most L/(N+1)≤ε/2 from the specified circuit output state.

Facts & Assumptions

Given: The gate list, local propagation terms, legal unary clock, input penalty, and padding parameters from Five-local history-state adiabatic path.

[F1]

The partial trace over the clock sums diagonal clock blocks in an orthonormal product basis (Partial trace over a finite tensor factor).

[F2]

A unit vector ψ represents the density operator ∣ψ⟩⟨ψ∣ (Density operator, Dirac Notation Conversion).

[F3]

Any two density operators have trace distance at most 1 (Trace Distance Range And Equality).

Proof

1.1givenalgebra

Fix an assignment to all clock bits outside the local support of hℓ. The subspace with that fixed spectator assignment and local clock state in {aℓ,bℓ} is invariant; in the order (aℓ,bℓ) the block is 12(I−Uℓ∗−UℓI). The term is zero on every local pattern outside this pair. These mutually orthogonal blocks, together with the subspaces for those other local patterns, decompose the full register, so it suffices to inspect each displayed block and the zero action on the rest. For any data vectors x,y, its quadratic form is 12∥y−Uℓx∥2≥0, and its kernel consists exactly of paired amplitudes (x,Uℓx). Hence hℓ is positive semidefinite on the full clock register.

2.1givenstep 1.1constructalgebra

On legal unary clocks, aℓ occurs only at cℓ−1 and bℓ only at cℓ. Define the unitary W=∑j=0NVj⊗∣cj⟩⟨cj∣ on that space. Since Vℓ=UℓVℓ−1, conjugating the block from step 1.1 by W makes every adjacent block 12(I−I−II). Summing over edges gives W∗HpropW=Idata⊗LN/2.

3.1step 2.1algebra

The quadratic form of LN is ⟨z,LNz⟩=∑j=0N−1∣zj−zj+1∣2, so its kernel is the constant clock vectors. Step 2.1 therefore gives exactly the displayed propagation kernel, with arbitrary data vector ξ.

4.1givenstep 3.1algebra

On a legal clock, Hinput vanishes except at c0, where it is the data Hamming-weight operator N1=∑i∣1⟩⟨1∣i. Since V0=I, conjugation by W leaves this block unchanged. For a kernel vector with data vector ξ, its input energy is ⟨ξ,N1ξ⟩/(N+1), which is zero exactly when ξ lies in the one-dimensional span of ∣0n⟩. Thus Hprop+Hinput has the unique normalized kernel vector ∣η⟩.

5.1givenstep 1.1step 4.1algebra

The clock penalty Hclock is positive semidefinite and has kernel exactly the legal unary strings: a binary string has no adjacent pattern 01 exactly when all its 1 bits precede all its 0 bits. Each term of Hfinal is positive semidefinite by step 1.1 and the definitions of Hinput,Hclock. A zero-energy vector must therefore lie in the clock-penalty kernel and in the kernel identified in step 4.1. This proves uniqueness for the full final Hamiltonian.

5.2F1F2step 4.1algebra

Tracing the clock out of ∣η⟩⟨η∣ and using [F1] removes all cross terms between distinct cℓ, giving ρdata=1N+1∑ℓ=0N∣Vℓ0n⟩⟨Vℓ0n∣. For each ℓ≥L, the appended gates are identities, so Vℓ∣0n⟩=∣ψout⟩:=UL⋯U1∣0n⟩. There are K+1 such indices, and the other L terms form a density operator σ after normalization. Hence ρdata=LN+1σ+K+1N+1∣ψout⟩⟨ψout∣.

6.1F2F3step 5.2algebra∎

By homogeneity of the trace norm in the definition of trace distance, the distance from ∣ψout⟩⟨ψout∣ is LN+1D(σ,∣ψout⟩⟨ψout∣)≤L/(N+1) by [F3]. Since K=⌈2L/ε⌉ and N=L+K, we have L/(N+1)≤L/K≤ε/2.

Depends on

Used by

Dependency tree · two levels

33 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