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 from , up to a global phase, as supplied by Gibbs purification error and resource bound. Then where . 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.
Finite Gibbs density and its canonical purification: the ideal vector is normalized and its system partial trace is .
Sparse-oracle finite Gibbs purification procedure: the normalized output is returned only on its stated successful branch, with the declared access and shift conditions.
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.
Trace Distance: for finite density operators, .
Trace Norm Spectral Formula: for a finite matrix , .
Partial trace over a finite tensor factor and The partial trace is characterized by the trace pairing and is basis-independent: is characterized by its trace pairing.
The partial trace preserves non-negativity and total trace: partial trace maps positive matrices to positive matrices and preserves their trace.
Finite matrix spectral and state calculus: finite Hermitian matrices have an orthonormal eigenbasis and nonnegative matrices have positive square roots.
Proof
Multiply by a phase so is real and . If , their rank-one projections agree. Otherwise write , with and . On the span of , the difference of their rank-one projections has matrix , whose eigenvalues are ; it vanishes on the orthogonal complement. By [F4] and [F5], the pure-state trace distance is . Since and , this distance is at most the vector distance.
For finite matrices , by interchanging finite indices. Let be any finite Hermitian trace-zero matrix and write its positive and negative parts . Their traces agree and equal . For every effect , this cyclicity and square roots from [F8] give , hence . Put . By setting in [F6], . Its positive spectral projection is an effect and satisfies by [F5]. Again by [F6], ; diagonalizing shows is an effect. Applying the preceding bound to this effect yields .
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 . Set , which is Hermitian with trace zero. Step 1.2 contracts its trace norm under . 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
Finite Gibbs density and its canonical purification
Sparse-oracle finite Gibbs purification procedure
Gibbs purification error and resource bound
Finite matrix spectral and state calculus
Trace Distance
Trace Norm Spectral Formula
Partial trace over a finite tensor factor
The partial trace is characterized by the trace pairing and is basis-independent
The partial trace preserves non-negativity and total trace
Dependency tree · 2 levels
Sources
- John Watrous, The Theory of Quantum Information, Chapter 2, §§2.1–2.3, author-hosted manuscript
- Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf, Quantum SDP-Solvers, arXiv:1705.01843v4
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, arXiv:1806.01838