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.
Compression dimension bounds entanglement fidelity
Statement
Let have decreasing eigenvalues , padded by zeros, and let an compression code have intermediate dimension as in Finite IID quantum source and compression code. Then
Facts & Assumptions
Given: A finite-dimensional density operator , a purification of , and encoder and decoder channels factoring through a code space of dimension .
Finite IID quantum source and compression code: the squared entanglement fidelity is the overlap of the purified source with the recovered joint state, and the encoder and decoder are quantum channels.
Kraus and Choi characterizations of complete positivity: every finite-dimensional completely positive map has a finite Kraus representation.
Trace preservation is Kraus normalization: a trace-preserving Kraus family satisfies .
Schmidt decomposition: a finite bipartite vector has an expansion with , both factor families orthonormal, and squared norm .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional Hermitian operator has an orthonormal eigenbasis.
Partial trace over a finite tensor factor: partial trace contracts the repeated factor index in an orthonormal product basis. The trace-pairing identity and basis independence are given by The partial trace is characterized by the trace pairing and is basis-independent.
Proof
Choose Kraus families and for the encoder and decoder from [F2]. The composite channel has Kraus operators , each of rank at most because it factors through the -dimensional code space. By [F3],
By [F4], write , ordering the decreasingly. Expanding and contracting either orthonormal factor family by [F7] gives Indeed each cross term with indices contracts with coefficient , or , respectively. Thus both reduced operators have exactly the positive eigenvalues , with any remaining eigenvalues zero. Complete by an orthonormal basis of , available from [F5] applied to the zero operator there. On this full reference basis, has eigenvalues , with the Statement's zero padding; in particular .
For each let , and let be the projection onto its reference-side Schmidt support (zero if ). Since , apply [F4] on these two factors: there are at most orthonormal second-factor vectors. Thus and . Cauchy–Schwarz and the trace-pairing identity in [F7] give
Put . Then , and the full reference basis from step 1.2 gives . If , then , since the source has at most positive eigenvalues. Otherwise, ordering the eigenvalues gives Thus the overlap in step 2.1 is bounded by .
Expanding the recovered state in the composite Kraus family from step 1.1 gives . By step 3.1 this is at most . Step 1.1 gives , proving the bound.
Depends on
- Finite IID quantum source and compression code
- Kraus and Choi characterizations of complete positivity
- Trace preservation is Kraus normalization
- Schmidt decomposition
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- Partial trace over a finite tensor factor
- The partial trace is characterized by the trace pairing and is basis-independent
Used by
Dependency tree · two levels
48 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
- John Watrous, The Theory of Quantum Information, Theorem 5.44 proof (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, Chapter 18 §18.2.1 (standard reference, not scraped)