Alphabeta Math
TheoremStatement: 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.

Finite Gibbs circuit marginal and trace-distance error

Statement

Assume the finite access and successful shift conditions of Sparse-oracle finite Gibbs purification procedure. Let ∣Ψβ⟩ be the normalized canonical purification of Finite Gibbs density and its canonical purification, and suppose the successful normalized output ∣Ψ~β⟩ has vector distance at most εout from ∣Ψβ⟩, up to a global phase, as supplied by Gibbs purification error and resource bound. Then D ⁣(Tr⁡R∣Ψ~β⟩⟨Ψ~β∣,ρβ)≤εout, where D(ρ,σ)=12∥ρ−σ∥1. The assertion is conditional on the algorithmic success events and says nothing about physical thermalization or finite measurement frequencies.

Facts & Assumptions

Given: The finite registers and density operators above, the successful vector-error guarantee, the finite partial trace, and the root trace-distance convention.

[F1]

Finite Gibbs density and its canonical purification: the ideal vector is normalized and its system partial trace is ρβ.

[F2]

Sparse-oracle finite Gibbs purification procedure: the normalized output is returned only on its stated successful branch, with the declared access and shift conditions.

[F3]

Gibbs purification error and resource bound: under its finite algorithmic error hypothesis, the normalized branch vector is within the declared vector error up to phase.

[F4]

Trace Distance: for finite density operators, D(ρ,σ)=12∥ρ−σ∥1.

[F5]

Trace Norm Spectral Formula: for a finite matrix X, ∥X∥1=Tr⁡X∗X.

[F7]

The partial trace preserves non-negativity and total trace: partial trace maps positive matrices to positive matrices and preserves their trace.

[F8]

Finite matrix spectral and state calculus: finite Hermitian matrices have an orthonormal eigenbasis and nonnegative matrices have positive square roots.

Proof

1.1givenF4F5F8algebra

Multiply ∣Ψ~β⟩ by a phase so s=⟨Ψβ,Ψ~β⟩ is real and 0≤s≤1. If s=1, their rank-one projections agree. Otherwise write Ψ~β=sΨβ+1−s2 w, with w⊥Ψβ and ∥w∥=1. On the span of Ψβ,w, the difference of their rank-one projections has matrix (1−s2−s1−s2−s1−s2−(1−s2)), whose eigenvalues are ±1−s2; it vanishes on the orthogonal complement. By [F4] and [F5], the pure-state trace distance is 1−s2. Since ∥Ψβ−Ψ~β∥2=2(1−s) and 1−s2≤2(1−s), this distance is at most the vector distance.

1.2givenF5F6F8algebra

For finite matrices C,D, Tr⁡(CD)=∑i,jCijDji=Tr⁡(DC) by interchanging finite indices. Let X be any finite Hermitian trace-zero matrix and write its positive and negative parts X=X+−X−. Their traces agree and equal ∥X∥1/2. For every effect 0≤E≤I, this cyclicity and square roots from [F8] give 0≤Tr⁡(EX±)=Tr⁡(X±1/2EX±1/2)≤Tr⁡X±, hence ∣Tr⁡(EX)∣≤∥X∥1/2. Put Y=Tr⁡RX. By setting A=I in [F6], Tr⁡Y=Tr⁡X=0. Its positive spectral projection EY is an effect and satisfies Tr⁡(EYY)=∥Y∥1/2 by [F5]. Again by [F6], Tr⁡(EYY)=Tr⁡((EY⊗IR)X); diagonalizing EY shows EY⊗IR is an effect. Applying the preceding bound to this effect yields ∥Y∥1≤∥X∥1.

2.1givenstep 1.1step 1.2F1F2F3F4F7∎

Apply step 1.1 to the normalized output on the successful branch [F2] and ideal vector from [F3]. Their pure-state trace distance is at most εout. Set X=∣Ψ~β⟩⟨Ψ~β∣−∣Ψβ⟩⟨Ψβ∣, which is Hermitian with trace zero. Step 1.2 contracts its trace norm under Tr⁡R. By [F1], the ideal system marginal is ρβ; [F7] ensures both marginals are density operators, so [F4] applies and gives the claimed bound. The conclusion remains conditional on the successful branch and shift event.

Depends on

Dependency tree · 2 levels

Sources