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.

Compression dimension bounds entanglement fidelity

Statement

Let ρ⊗n have decreasing eigenvalues λ1(n)≥λ2(n)≥⋯≥0, padded by zeros, and let an (n,M) compression code have intermediate dimension M as in Finite IID quantum source and compression code. Then

Fe(n)≤∑j=1Mλj(n).

Facts & Assumptions

Given: A finite-dimensional density operator ρ, a purification of ρ⊗n, and encoder and decoder channels factoring through a code space of dimension M.

[F1]

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.

[F2]

Kraus and Choi characterizations of complete positivity: every finite-dimensional completely positive map has a finite Kraus representation.

[F3]

Trace preservation is Kraus normalization: a trace-preserving Kraus family satisfies ∑jKj∗Kj=I.

[F4]

Schmidt decomposition: a finite bipartite vector has an expansion ∑jsj∣rj⟩∣aj⟩ with sj>0, both factor families orthonormal, and squared norm ∑jsj2.

[F7]

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

1.1F1F2F3algebraconstruct

Choose Kraus families (Ea) and (Db) for the encoder and decoder from [F2]. The composite channel has Kraus operators Kba=DbEa, each of rank at most M because it factors through the M-dimensional code space. By [F3], ∑a,bKba∗Kba=∑aEa∗(∑bDb∗Db)Ea=∑aEa∗Ea=I.

1.2F1F4F5F7algebraconstruct

By [F4], write ∣ϕ⟩=∑j=1rsj∣rj⟩∣aj⟩, ordering the sj decreasingly. Expanding ∣ϕ⟩⟨ϕ∣ and contracting either orthonormal factor family by [F7] gives ρR:=Tr⁡A⊗n(∣ϕ⟩⟨ϕ∣)=∑j=1rsj2∣rj⟩⟨rj∣,ρ⊗n=∑j=1rsj2∣aj⟩⟨aj∣. Indeed each cross term with indices j,k contracts with coefficient ⟨ak∣aj⟩=δjk, or ⟨rk∣rj⟩=δjk, respectively. Thus both reduced operators have exactly the positive eigenvalues sj2, with any remaining eigenvalues zero. Complete (rj)j=1r by an orthonormal basis of ker⁡ρR, available from [F5] applied to the zero operator there. On this full reference basis, ρR has eigenvalues λj(n), with the Statement's zero padding; in particular ∑jλj(n)=∑j=1rsj2=1.

2.1F4F6F7step 1.1step 1.2algebra

For each K=Kba let ∣ηK⟩=(IR⊗K)∣ϕ⟩, and let PK be the projection onto its reference-side Schmidt support (zero if ηK=0). Since ∣ηK⟩∈HR⊗ran⁡K, apply [F4] on these two factors: there are at most dim⁡ran⁡K≤M orthonormal second-factor vectors. Thus rank⁡PK≤M and (PK⊗I)∣ηK⟩=∣ηK⟩. Cauchy–Schwarz and the trace-pairing identity in [F7] give ∣⟨ϕ∣ηK⟩∣2≤⟨ϕ∣(PK⊗I)∣ϕ⟩ ∥ηK∥2=tr⁡(ρRPK)∥ηK∥2.

3.1F5step 1.2step 2.1algebracases

Put qj=⟨rj,PKrj⟩. Then 0≤qj≤1, and the full reference basis from step 1.2 gives ∑jqj=tr⁡(PK)=rank⁡PK≤M. If M≥dim⁡HR, then tr⁡(ρRPK)≤1=∑j≤Mλj(n), since the source has at most dim⁡HR positive eigenvalues. Otherwise, ordering the eigenvalues gives tr⁡(ρRPK)=∑jλj(n)qj≤∑j≤Mλj(n)qj+λM(n)(M−∑j≤Mqj)≤∑j≤Mλj(n). Thus the overlap in step 2.1 is bounded by (∑j≤Mλj(n))∥ηK∥2.

4.1F1F3step 1.1step 3.1algebra∎

Expanding the recovered state in the composite Kraus family from step 1.1 gives Fe(n)=∑a,b∣⟨ϕ∣ηKba⟩∣2. By step 3.1 this is at most (∑j≤Mλj(n))∑a,b∥ηKba∥2. Step 1.1 gives ∑a,b∥ηKba∥2=⟨ϕ∣IR⊗(∑a,bKba∗Kba)∣ϕ⟩=∥ϕ∥2=1, proving the bound.

Depends on

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