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.

Fidelity Purification Characterization

Statement

Let H be a nonzero finite-dimensional complex inner-product space and let ρ,σ∈D(H). For every auxiliary space R with dim⁡R≥dim⁡H, a purification of ρ on H⊗R means a unit vector x with Tr⁡R(∣x⟩⟨x∣)=ρ. Then F(ρ,σ)=max⁡{∣⟨x,y⟩∣:x,y∈H⊗R, ∥x∥=∥y∥=1, Tr⁡R∣x⟩⟨x∣=ρ, Tr⁡R∣y⟩⟨y∣=σ}. In particular, the maximum is attained with R≅H.

Facts & Assumptions

Given: A nonzero finite-dimensional H, states ρ,σ∈D(H), and an auxiliary space R of dimension at least dim⁡H.

[L1]

The root fidelity is F(ρ,σ)=∥ρσ∥1 (Fidelity). The current QC06 source body is present; its fidelity convention is root fidelity.

[L2]

In ordered orthonormal product coordinates, a vector with coefficient matrix X has first marginal XX∗; under the root linear-first pairing the inner product of coefficient matrices X,Y is tr⁡(XY∗), whose modulus is ∣tr⁡(X∗Y)∣ (Ordered tensor registers, their inner product, and wire permutations, Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent). These identities follow by finite coordinate sums and the partial-trace trace-pairing formula.

[L3]

For a rectangular coefficient map X:R→H, the singular-value decomposition gives X=∑j<rsj∣uj⟩⟨vj∣ with sj>0 and orthonormal families (uj) in H and (vj) in R (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Dirac Notation Conversion). Then XX∗=∑j<rsj2∣uj⟩⟨uj∣, and BX=∑j<rsj∣uj⟩⟨uj∣ is non-negative because ⟨BXz,z⟩=∑j<rsj∣⟨z,uj⟩∣2≥0; also BX2=XX∗. Uniqueness of the non-negative square root gives BX=(XX∗)1/2. Consequently X=(XX∗)1/2W for W=∑j<r∣uj⟩⟨vj∣. The SVD bases show Wvj=uj for j<r, that W vanishes on the remaining basis vectors, and that W∗ has the reverse action; hence both are contractions. This rectangular factorization is derived from the SVD; the cited polar-decomposition theorem is used only for square endomorphisms.

[L4]

Trace-norm duality gives max⁡∥C∥∞≤1∣tr⁡(A∗C)∣=∥A∥1; in equal finite dimensions polar decomposition supplies an attaining unitary (Trace Norm Duality And Norm Properties, Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).

Proof

1.1givenL2algebra

Fix orthonormal bases of H and R. Write x=∑i,aXiaei⊗fa. Directly taking the partial trace gives Tr⁡R∣x⟩⟨x∣=XX∗, while ∥x∥=1 gives tr⁡(XX∗)=1. Thus purifications of ρ are exactly coefficient matrices X with XX∗=ρ and ∥X∥2=1, and the analogous statement holds for σ.

1.2givenL1L2L3L4algebra

By [L3], write X=ρ W and Y=σ V, where W,V:R→H and their adjoints are contractions. Put A=ρσ. The coefficient-matrix inner product [L2] and cyclicity give ∣⟨x,y⟩∣=∣tr⁡(XY∗)∣=∣tr⁡(σρ WV∗)∣=∣tr⁡(A∗WV∗)∣. Since WV∗ is a contraction, [L4] implies ∣⟨x,y⟩∣≤∥A∥1=F(ρ,σ).

2.1givenL1L2L4step 1.1step 1.2algebrachoose∎

Fix the auxiliary space R from the Statement. Since dim⁡R≥dim⁡H, choose an isometric embedding J:H→R using orthonormal bases. Put A=ρσ. By SVD, ∥A∗∥1=∥A∥1, and [L4] supplies a unitary C on H with ∣tr⁡(A∗C)∣=∥A∥1. Set X=ρ J∗ and Y=σ C∗J∗. Then XX∗=ρ and YY∗=σ, so these coefficient matrices define unit purifications on this fixed R. Their overlap satisfies ∣⟨x,y⟩∣=∣tr⁡(XY∗)∣=∣tr⁡(ρCσ)∣=∣tr⁡(A∗C)∣=F(ρ,σ) by cyclicity. The upper bound in step 1.2 and this attaining pair prove the maximum for every fixed R with dim⁡R≥dim⁡H.

Depends on

Used by

Dependency tree · two levels

66 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