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.

Full-space history-path gap

Statement

For the path in Five-local history-state adiabatic path, put N=L+K, K0=n+3N, and Δ0=1216(N+1)3,J=2K0+4K02Δ0+1. For every s∈[0,1], the full Hamiltonian has a unique ground state and its gap is greater than 3Δ0/4. Consequently the minimum gap is Ω(N−3).

Facts & Assumptions

Given: The five-local path, its input/propagation/clock terms, and the chosen J from Five-local history-state adiabatic path.

[F1]

The zero-input legal clock block has gap at least 1/(48N2) (Restricted history-path gap).

[F2]

Its normalized ground vector v is nonnegative and nonincreasing, and its ground state is unique (Nonnegative monotone ground vector of the history path).

[F3]

The ideal final history state is the unique kernel vector of Hinput+Hprop+JHclock (History state and padded output).

[F4]

The large clock-penalty lemma bounds the first two full eigenvalues by those of the legal compression with additive error K2/(J−2K) (Large clock-penalty perturbation).

Proof

1.1givenF3constructalgebra

Let S be the subspace of legal unary clocks. The prefix conjugation from History state and padded output preserves each clock basis state and makes Hprop equal to LN/2 on the clock. Since the input penalty acts only at c0 and the prefix at c0 is the identity, the compression of H1(s):=H(s)−JHclock to S decomposes, in the computational basis x∈{0,1}n, as Hx(s)=H0(s)+∣x∣ ∣c0⟩⟨c0∣, where H0(s) is the zero-input clock block and ∣x∣ is Hamming weight.

2.1F1F2F5step 1.1algebra

The x=0 block has simple ground energy E0 and gap Δ≥1/(48N2) by [F1]–[F2]. Write p=∣v0∣2. Since 0≤vi≤v0 and ∑i∣vi∣2=1, p≥1/(N+1)>0. Also Δ≤2: the compression of H0(s) to S=span⁡{e0,e1} is positive and has trace at most 2 (for N=1 its trace is a+2t=1, and for N≥2 it is a+3t=1+s/2≤3/2). If u0 is a normalized ground vector, the two-dimensional space S contains a nonzero vector z⊥u0. Its Rayleigh quotient is at least E1 by expansion in an orthonormal eigenbasis, while the quotient is at most the largest eigenvalue of the compression to S, hence at most its trace 2. Thus E1≤2 and, since E0≥0, Δ=E1−E0≤2.

3.1F1F2F5step 2.1algebra

For any x≠0, put r=∣x∣≥1 and R=∣c0⟩⟨c0∣. The spectral gap of the zero-input block gives H0−E0I≥Δ(I−∣v⟩⟨v∣), and rR≥R. Thus Hx−E0I≥B:=Δ(I−∣v⟩⟨v∣)+R. If p<1, set w=(c0−p v)/1−p. On the two-dimensional span of v and c0, the matrix of B in the orthonormal basis v,w has trace 1+Δ and determinant pΔ. Its smaller eigenvalue is at least its determinant divided by its trace, hence at least pΔ/(1+Δ). On the orthogonal complement, B=ΔI, so this bound applies to the whole space. If p=1, then c0=v and B has eigenvalues 1 on v and Δ on v⊥, so B≥min⁡{1,Δ}I≥Δ/(1+Δ)I. Thus in either case B≥pΔ/(1+Δ)I. By Δ≤2, every nonzero-input block has ground energy at least E0+Δp/3≥E0+1/[144N2(N+1)].

4.1step 2.1step 3.1algebra

The legal compression therefore has unique ground in the x=0 block and gap at least min⁡{148N2,1144N2(N+1)}=1144N2(N+1)≥Δ0. The last inequality is equivalent to 3(N+1)2≥2N2, which holds for every N≥1.

5.1givenF4F5step 4.1algebra

On the full register, H2=Hclock is positive, vanishes exactly on S, and is at least I on S⊥: every illegal binary clock string contains at least one adjacent 01 pair. To bound Hprop, fix an assignment of all clock bits outside the local support of a term hℓ. On the two local pattern states aℓ,bℓ, the block is 12(I−Uℓ∗−UℓI); it has eigenvalues 0 and 1 because Uℓ is unitary, and hℓ is zero on the other local patterns. Thus 0≤hℓ≤I, ∥hℓ∥≤1, and 0≤Hprop≤NI. Also ∥Hinput∥≤n and ∥Hclock0∥≤N, by their sums of n and N projections. Hence H1(s)=Hinput+(1−s)Hclock0+sHprop is self-adjoint and ∥H1(s)∥≤n+(1−s)N+sN=n+N≤K0. The legal dimension is 2n(N+1)≥2, so [F4] applies to its first two eigenvalues with K=K0.

6.1F4step 4.1step 5.1algebra∎

For this J, J>2K0 and ϵJ=K02J−2K0<Δ04. The perturbation bounds in [F4] give λ1(H(s))≤μ1 and λ2(H(s))≥μ2−ϵJ, where μ2−μ1≥Δ0 by step 4.1. Thus the full gap is at least Δ0−ϵJ>3Δ0/4 for every s. Its positivity makes the ground state unique, and Δ0=Θ(N−3) gives the stated asymptotic gap.

Depends on

Used by

Dependency tree · two levels

27 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