Alphabeta Math
Pipeline-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.

Trace Distance, Fidelity, and Information Limits

1 · Prerequisites

2 · Summary

For finite-dimensional density operators, this page fixes the root-fidelity convention F(ρ,σ)=∥ρσ∥1 and the state trace distance D(ρ,σ)=12∥ρ−σ∥1. It proves their measurement, purification, and information-theoretic bounds; contractivity and composition estimates; and the scoped pure-state no-cloning, mixed-state cloning, and no-broadcasting results. The diamond norm on maps is unhalved. Universal pure-state cloning formulas use a normalized Haar branch conditional on the stated choice axiom. The prerequisite channels/Kraus/Choi/Stinespring page and its draft supplier items are present; their CP/TP and representation interfaces support the channel uses on this page. Draft authoring and interface checks do not constitute mathematical acceptance.

3 · Logical flowchart

4 · Definitions, theorems and proofs

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Unitary Group Compact

Statement

For every positive integer d, the unitary group U(d):={U∈Md(C):U∗U=Id} is a compact Hausdorff topological group in the Euclidean topology inherited from the real and imaginary parts of its matrix entries.

Facts & Assumptions

Given: A positive integer d and the stated subspace topology on Md(C)≅R2d2.

[F2]

Under the coordinate bijection C≅R2, complex addition, multiplication, and conjugation are polynomial coordinate operations (C is the real coordinate plane, with coordinate arithmetic); they are therefore continuous in Euclidean coordinates.

[F3]

For an endomorphism of a finite-dimensional inner-product space, U∗U=I implies U is invertible with inverse U∗, and hence UU∗=I (For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent).

[F5]

A compact space is one for which every open cover has a finite subcover, a Hausdorff space separates distinct points by disjoint open neighborhoods, and a topological group is a group whose multiplication and inversion are continuous (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topological group: multiplication and inversion are continuous, Group and abelian group).

Proof

1.1givenF2algebra

The map U↦U∗U is continuous because each entry is a finite sum of products of real-coordinate polynomial expressions from [F2]. The singleton {Id} is closed in the finite-dimensional Euclidean matrix space, so its inverse image U(d) is closed. If U=(uij)∈U(d), each column has squared Euclidean norm ∑i∣uij∣2=1; hence every real and imaginary entry lies in [−1,1]. Thus U(d) is bounded in R2d2.

2.1F1F5step 1.1

By Heine–Borel and the agreement of metric and topological compactness in [F1], the closed bounded set U(d) from step 1.1 is compact in its Euclidean subspace topology. Distinct points of U(d) have disjoint sufficiently small Euclidean balls, so its subspace topology is Hausdorff by [F5]. It is nonempty because Id∈U(d).

3.1F2F3F4F5step 1.1algebra∎

By [F3], each U∈U(d) has inverse U∗, so the defining set is closed under inverses. If U,V∈U(d), then (UV)∗(UV)=V∗(U∗U)V=V∗V=Id, so it is closed under multiplication; associativity and the identity follow from [F4]. Matrix multiplication is continuous by the finite coordinate formulas of step 1.1, and inversion is U↦U∗, which is continuous by [F2]. Thus the group with its subspace topology is a topological group by [F5].

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Diamond Norm

Definition

Let H,K be nonzero finite-dimensional complex Hilbert spaces and let Φ:L(H)→L(K) be complex-linear. For each finite r≥1, the induced trace norm of the amplification is ∥Φ⊗id⁡Cr∥1→1:=sup⁡X≠0∥(Φ⊗id⁡Cr)(X)∥1∥X∥1, where X∈L(H⊗Cr) and ∥⋅∥1 is the finite-dimensional trace norm (Trace Norm). The diamond norm (the completely bounded trace norm) is ∥Φ∥⋄:=sup⁡r≥1∥Φ⊗id⁡Cr∥1→1. There is no factor 1/2 in this map norm. The finite-dimensional ancilla theorem Diamond Norm Ancilla Dimension Bound ↗ proves the supremum is finite, is attained, and can be capped at r=dim⁡H.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Fidelity

Definition

Let H be a nonzero finite-dimensional complex inner-product space and let ρ,σ be density operators on H (nonnegative operators of trace one; Density operator). Their root fidelity is F(ρ,σ):=∥ρ σ∥1, where ρ and σ are the unique non-negative square roots and ∥⋅∥1 is the finite-dimensional trace norm (Trace Norm). This library uses root fidelity; the squared quantity F(ρ,σ)2 is called squared fidelity.

Remarks

The alternative formula F(ρ,σ)=tr⁡ρ σ ρ is proved in The two root-fidelity trace expressions agree. Preskill uses the squared-fidelity convention; when using that source, its quantity is F2 here.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Trace Distance

Definition

Let H be a nonzero finite-dimensional complex inner-product space and let ρ,σ be density operators on H (nonnegative operators of trace one; Density operator). Their trace distance is D(ρ,σ):=12∥ρ−σ∥1, where ∥⋅∥1 is the trace norm (Trace Norm). The factor 1/2 is part of this state-distance convention. The diamond norm below is an unhalved norm on maps.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Faithful State Dominates Positive Operator

Statement

Let H be finite-dimensional, let σ be a density operator that is positive definite on H, and let X be a non-negative endomorphism of H. Then there is a finite real c≥0 such that X≤cσ.

Facts & Assumptions

Given: A finite-dimensional complex inner-product space H, a faithful density operator σ, and X≥0.

[F1]

A density operator is non-negative; faithfulness on H means its restriction to H is positive definite (Density operator). This current draft definition is present, but its declared existence supplier remains unresolved.

[F2]

A non-negative operator has an orthonormal eigenbasis with nonnegative eigenvalues; positive definiteness makes every eigenvalue strictly positive (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S, Non-negative and positive operators).

[F3]

Non-negativity is characterized by nonnegative quadratic forms, so Y≥0 means ⟨Yv,v⟩≥0 for every v (Non-negative and positive operators).

Proof

1.1givenF1F2choose

Diagonalize X and let M≥0 be its largest eigenvalue; if X=0, take M=0. Diagonalize σ and let m>0 be its smallest eigenvalue, which is positive by faithfulness and [F2]. For every v∈H, these spectral bounds give ⟨Xv,v⟩≤M∥v∥2 and ⟨σv,v⟩≥m∥v∥2.

2.1step 1.1F3algebra∎

Set c=M/m. Then c is finite and nonnegative, and for every v step 1.1 gives ⟨(cσ−X)v,v⟩≥(cm−M)∥v∥2=0. By [F3], cσ−X≥0, which is exactly X≤cσ. This also covers X=0 with c=0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Symmetric Subspace Projector

Definition

Let H be a finite-dimensional complex Hilbert space, let k≥1, and let H⊗k use the ordered tensor product register and factor permutation convention of Ordered tensor registers, their inner product, and wire permutations. For π∈Sk, let Uπ be the resulting unitary that permutes the k tensor factors according to π. Define Πsym,k:=1k!∑π∈SkUπ. The symmetric subspace is Sym⁡k(H):={v∈H⊗k:Uτv=v for every τ∈Sk}. For k=0, the tensor unit is one-dimensional and Πsym,0:=I.

The permutation average is the orthogonal projector onto Sym⁡k(H) by The permutation average is the symmetric-subspace projector ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The two root-fidelity trace expressions agree

Statement

For density operators ρ,σ on a finite-dimensional complex Hilbert space, ∥ρ σ∥1=tr⁡ρ σ ρ.

Facts & Assumptions

Given: Density operators ρ,σ on a finite-dimensional complex Hilbert space.

[F1]

Root fidelity is defined by F(ρ,σ)=∥ρσ∥1 (Fidelity).

[L1]

The finite trace norm is the sum of singular values, including zeros, and SVD supplies orthonormal left and right singular vectors (Trace Norm, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition). The current QC01 trace-norm definition is present as a draft and uses this finite-map convention.

[F2]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

Proof

1.1givenL1F2algebra

Put A=ρσ. Since A∗=σρ, we have A∗A=σ ρ σ and AA∗=ρ σ ρ. Both are non-negative. By [L1], the eigenvalues of A∗A and AA∗ are the squares of the singular values of A; because A is an endomorphism, the SVD lists the same d singular values on both sides, with zero multiplicity included.

2.1step 1.1F1L1F2∎

The unique non-negative square roots of A∗A and AA∗ therefore have the same eigenvalue list, namely the singular values of A. Their traces both equal the sum of those singular values, which is ∥A∥1 by [L1]. Substituting AA∗=ρ σ ρ proves the stated identity and, by [F1], its equivalent root-fidelity expression.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Trace norm of a tensor product

Statement

For finite-dimensional complex-inner-product spaces H1,K1,H2,K2 and linear maps A:H1→K1, B:H2→K2, ∥A⊗B∥1=∥A∥1 ∥B∥1. The equality includes zero maps and zero-dimensional factors.

Facts & Assumptions

Given: The finite-dimensional spaces and linear maps in the Statement.

[F1]

The trace norm is the sum of the positive singular values, with zeros contributing nothing (Trace Norm).

[F2]

Each finite-dimensional linear map has a singular-value decomposition with orthonormal left and right singular families and positive singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[F3]

Tensor maps apply each factor map on elementary tensors, and the product inner product is the product of factor inner products (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations).

Proof

1.1givenF1F2choosealgebra

If either A or B is zero, or a domain or codomain factor is zero-dimensional, then A⊗B=0 and at least one factor trace norm is zero, so the formula holds. Otherwise choose SVDs Az=∑i=1rsi⟨z,vi⟩ui and Bw=∑j=1qtj⟨w,qj⟩pj as in [F2], with all si,tj>0.

2.1givenF1F2F3step 1.1algebra∎

By [F3], on elementary tensors (A⊗B)(z⊗w)=∑i=1r∑j=1qsitj⟨z⊗w,vi⊗qj⟩ ui⊗pj. The families (vi⊗qj)i,j and (ui⊗pj)i,j are orthonormal because their pairings are products of the factor pairings. Since elementary tensors span, this is a singular-value decomposition of A⊗B with positive singular values exactly sitj. Thus [F1] gives ∥A⊗B∥1=∑i,jsitj=(∑isi)(∑jtj)=∥A∥1∥B∥1.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Positive Marginals Imply Joint Support

Statement

Let H be finite-dimensional, let Y≥0 act on H⊗H, and let S⊆H be a subspace. If both partial-trace marginals of Y are supported on S, then supp⁡Y⊆S⊗S; equivalently, Y=(PS⊗PS)Y(PS⊗PS), where PS is the orthogonal projection onto S.

Facts & Assumptions

Given: A finite-dimensional complex Hilbert space H, Y≥0 on H⊗H, a subspace S⊆H, and supp⁡(Tr⁡2Y),supp⁡(Tr⁡1Y)⊆S.

[F1]

For any non-negative finite-dimensional operator Z, define supp⁡(Z):=(ker⁡Z)⊥=range⁡(Z); equality follows from self-adjointness (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

[L1]

The partial trace is characterized by tr⁡((Tr⁡BR)T)=tr⁡(R(T⊗I)), independently of the auxiliary orthonormal basis (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent). The QC02 definition and characterization theorem are present as draft carriers; the trace-pairing identity gives the displayed marginal trace rule by cyclicity.

[L2]

PS is the orthogonal projection onto S; it is idempotent and Q=I−PS=PS⊥. It is self-adjoint because the orthogonal decomposition gives ⟨PSx,y⟩=⟨PSx,PSy⟩=⟨x,PSy⟩ for all x,y (The orthogonal projection PWv is the W-component in V=W⊕W⊥, Orthogonal projection is linear, and an orthonormal basis (ei) of W gives PWv=∑i⟨v,ei⟩ei). Hence Q∗=Q and Q2=Q.

[L3]

Tensor maps act factorwise and preserve composition, so operators acting on different tensor factors commute and (PS⊗I)(I⊗PS)=PS⊗PS (Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).

[F2]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root). If such an operator has trace zero, diagonalize it in an orthonormal eigenbasis with nonnegative eigenvalues; trace is their sum, so every eigenvalue is zero and the operator is zero (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S, The basis-independent trace of an endomorphism of a finite-dimensional vector space).

Proof

1.1givenF1L1L2F2algebra

Let Q=I−PS. By [F1], the range of Tr⁡2Y lies in S, so QTr⁡2Y=0 and tr⁡(QTr⁡2Y)=0. By [L1], tr⁡((Q⊗I)Y)=0. Cyclicity of trace rewrites this as tr⁡(Y1/2(Q⊗I)Y1/2)=0. Since [L2] gives (Q⊗I)∗=(Q⊗I)2=Q⊗I, the operator inside the trace is Z∗Z≥0 for Z=(Q⊗I)Y1/2; [F2] makes it zero, hence Z=0 because ⟨Z∗Zv,v⟩=∥Zv∥2. Thus (Q⊗I)Y=Y(Q⊗I)=0, and Y=(PS⊗I)Y(PS⊗I).

2.1givenstep 1.1L1L2F2

Applying the same argument to the second marginal with the projection I⊗Q gives Y=(I⊗PS)Y(I⊗PS).

3.1step 1.1step 2.1L2L3algebra∎

The two commuting projections PS⊗I and I⊗PS have product PS⊗PS by [L3]. Combining step 1.1 and step 2.1 yields Y=(PS⊗PS)Y(PS⊗PS), so the range and hence the support of Y lies in S⊗S.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Pure state trace distance

Statement

For unit vectors u,v in a finite-dimensional complex Hilbert space, let Pu=∣u⟩⟨u∣ and Pv=∣v⟩⟨v∣. Then D(Pu,Pv)=1−∣⟨u∣v⟩D∣2, where ⟨⋅∣⋅⟩D is the Dirac pairing converted from the root library's first-argument-linear inner product.

Facts & Assumptions

Given: Unit vectors u,v in a finite-dimensional complex Hilbert space.

[F1]

The root inner product is linear in its first argument and conjugate-linear in its second (Real and complex inner-product spaces and their induced length).

[F2]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality for nonzero vectors exactly when they are linearly dependent (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[L1]

Dirac notation is converted by ⟨u∣v⟩D=⟨v,u⟩root and ∣u⟩⟨u∣x=⟨x,u⟩rootu (Dirac Notation Conversion). The current QC01 definition body is present and supplies the stated convention.

[F3]

D(Pu,Pv)=12∥Pu−Pv∥1 (Trace Distance).

[L2]

For Hermitian trace-zero H, ∥H∥1=2tr⁡(H+) (Hermitian Trace Norm Positive Negative Parts). The current QC01 theorem body is present as a draft; it proves the positive/negative-parts identity used here.

Proof

1.1givenF1F2L1choosealgebra

Put c=∣⟨u∣v⟩D∣∈[0,1] by [F2] and the unit norms. If c=1, equality in [F2] makes v a unit scalar multiple of u, so Pu=Pv and both sides are zero. Suppose c<1. Multiplying v by a unit scalar does not change Pv and lets us assume ⟨v,u⟩root=c: if a=⟨v,u⟩root≠0, multiply v by a‾/∣a∣. Define w=(v−cu)/1−c2. Direct expansion using [F1] gives ⟨w,u⟩root=0 and ∥w∥=1, so (u,w) is orthonormal and v=cu+1−c2w.

2.1step 1.1L2algebra

In the orthonormal basis (u,w) of their span, Pu−Pv has matrix (1−c2−c1−c2−c1−c2−(1−c2)). Its trace is zero and determinant is −(1−c2), so its two eigenvalues are 1−c2 and −1−c2; it is zero on the orthogonal complement. By [L2], ∥Pu−Pv∥1=21−c2.

3.1step 1.1step 2.1F3∎

Applying [F3] to step 2.1 gives D(Pu,Pv)=1−c2; together with the c=1 case in step 1.1 this proves the formula for every pair of unit vectors.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The permutation average is the symmetric-subspace projector

Statement

Let H be finite-dimensional and let k≥1. The average Πsym,k=1k!∑π∈SkUπ is self-adjoint and idempotent, with range exactly Sym⁡k(H)={v:Uτv=v ∀τ∈Sk}. For k=0 on the tensor unit, Πsym,0=I and its range is the full tensor unit.

Facts & Assumptions

Given: A finite-dimensional complex Hilbert space H, an integer k≥0, and the tensor-factor permutation representation π↦Uπ.

[L1]

Ordered tensor registers, their inner product, and wire permutations defines each factor permutation by reordering the product basis. In equal factors this is a basis permutation, hence unitary; under the stated output-order convention, Uπ∗=Uπ−1 and UπUσ=Uσ∘π for ordinary right-to-left composition of permutations.

[F1]

Sk is the finite group of permutations of a k-element set, with k! elements. Inversion and left or right multiplication by a fixed element are bijections; for each τ∈Sk, exactly k! pairs (π,σ) satisfy σ∘π=τ, since every π determines the unique σ=τ∘π−1.

Proof

1.1givenL1F1algebra

For k≥1, Π∗=1k!∑πUπ∗=1k!∑πUπ−1=Π by [L1] and reindexing by inversion. Also Π2=1(k!)2∑π,σUσ∘π=1(k!)2∑τ∈Skk!Uτ=Π, using [F1]. Thus Π is an orthogonal projection.

2.1step 1.1L1F1algebra

For every τ∈Sk, UτΠ=1k!∑πUπ∘τ=Π by [L1] and reindexing by right multiplication. Hence every vector in ran⁡Π is invariant. Conversely, if Uπv=v for all π, then Πv=1k!∑πv=v. Therefore ran⁡Π=Sym⁡k(H).

3.1givenalgebra∎

For k=0, S0 has one element and the defining empty tensor power is the one-dimensional tensor unit, so the stated average is I and its range is the whole space.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Diamond Norm Ancilla Dimension Bound

Statement

Let H,K be nonzero finite-dimensional complex Hilbert spaces, d=dim⁡H, and let Φ:L(H)→L(K) be linear. Then ∥Φ∥⋄=∥Φ⊗id⁡Cd∥1→1, and the latter induced norm is attained on some rank-one operator Rx,y:z↦⟨z,y⟩rootx with unit vectors x,y∈H⊗Cd.

Facts & Assumptions

Given: Nonzero finite-dimensional H,K and a linear map Φ:L(H)→L(K).

[L1]

The trace norm is the sum of singular values; SVD writes X=∑jsjRuj,vj, where Ru,v(z)=⟨z,v⟩rootu, sj≥0, and ∑jsj=∥X∥1 (Trace Norm, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition). The QC01 trace-norm definition is present as a draft and agrees with the root first-argument-linear convention.

[L2]

Tensor maps act on elementary tensors factorwise, factor permutations reorder product bases, and tensor-map adjoints are factorwise (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations, Tensor maps preserve composition, identities, and adjoints). Products of operator matrix units form a basis of the full tensor-product operator space, so checking the amplification identity on those elementary operators proves it for every input (Tensor products of operator matrix units form a basis). The QC02 carriers are present as drafts; step 1.2 proves the singular-value invariance of the two separate isometric embeddings.

[L3]

Every vector x∈H⊗Z has a Schmidt decomposition with at most dim⁡H terms and orthonormal families in both factors (Schmidt decomposition). The QC03 theorem body is present as a draft; this proof uses only its finite-rank decomposition.

[L4]

The finite trace norm is a norm and satisfies the triangle inequality (Trace Norm Duality And Norm Properties). For a matrix A of fixed shape q×p, let m=min⁡(p,q). Its SVD gives ∥A∥1=∑j=1msj(A) and ∑jsj(A)2=tr⁡(A∗A)=∑i,j∣Aij∣2. Since each singular value is at most (∑jsj(A)2)1/2, ∥A∥1≤m(∑i,j∣Aij∣2)1/2. The norm triangle inequality therefore gives, for matrices A,B of the same shape, ∣∥A∥1−∥B∥1∣≤m(∑i,j∣Aij−Bij∣2)1/2. This finite-coordinate bound proves the continuity used below; the singular-value and trace-norm formulas are Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition and Trace Norm.

Proof

1.1givenL1L4F1algebra

For fixed r, let Mr be the maximum of ∥(Φ⊗id⁡r)(Ru,v)∥1 over unit vectors u,v∈H⊗Cr. Their unit spheres are compact by [F1]. In orthonormal coordinates each entry of Ru,v is a finite product of coordinates of u and conjugates of coordinates of v; applying the finite linear map Φ⊗id⁡r remains continuous, and [L4] makes the output trace norm continuous. Hence the maximum exists. By [L1], every X with ∥X∥1≤1 has an SVD X=∑jsjRuj,vj with unit uj,vj, sj≥0, and ∑jsj≤1. Linearity and the trace-norm triangle inequality give ∥(Φ⊗id⁡r)(X)∥1≤∑jsjMr≤Mr. For unit u,v, the adjoint calculation gives Ru,v∗Ru,v=Rv,v, a rank-one orthogonal projection, so its singular values are one 1 and the remaining zeros; hence ∥Ru,v∥1=1. Thus the induced norm equals Mr and is attained.

1.2givenL2L3algebra

Now take any finite ancilla Z and unit vectors x,y∈H⊗Z. By [L3], their Schmidt ranks a,b are at most min⁡(d,dim⁡Z). Let m=max⁡(a,b) and pad each Schmidt list to an orthonormal m-tuple, obtaining x′,y′∈H⊗Cm by replacing the respective ancilla Schmidt vectors by the standard basis vectors and retaining the Schmidt coefficients and H-vectors. Define Vx,Vy:Cm→Z to send that basis to the respective padded orthonormal ancilla families; thus x=(IH⊗Vx)x′ and y=(IH⊗Vy)y′. The tensor-map definition and product pairing show each map I⊗Vx and I⊗Vy is an isometry. Factor permutations are unitary because they carry an orthonormal product basis bijectively to another such basis. Thus (Φ⊗id⁡Z)(Rx,y)=(IK⊗Vx)(Φ⊗id⁡m)(Rx′,y′)(IK⊗Vy)∗. To verify the equality, expand operators in elementary tensors A⊗B: Φ⊗id⁡ sends this to Φ(A)⊗B, and the two isometries send each ancilla matrix unit Rei,ej to Rzi,wj. For isometries U,V, (UA0V∗)∗(UA0V∗)=VA0∗A0V∗. The positive eigenvalues of this operator are those of A0∗A0: an eigenvector z with positive eigenvalue maps to Vz, and any eigenvector with positive eigenvalue must lie in the range of V because the operator vanishes on its orthogonal complement. Hence left/right isometric embeddings preserve the nonzero singular values and trace norm. Embedding Cm isometrically into Cd on both sides is the same case, so the original output has trace norm at most ∥Φ⊗id⁡d∥1→1.

2.1step 1.1step 1.2given∎

By step 1.1, the induced norm for each Z is attained by a rank-one unit input, so step 1.2 gives ∥Φ⊗id⁡Z∥1→1≤∥Φ⊗id⁡d∥1→1. Taking the supremum over all finite Z gives ∥Φ∥⋄≤∥Φ⊗id⁡d∥1→1. The reverse inequality holds because r=d is one of the ancilla dimensions in the supremum. Step 1.1 at r=d supplies an attaining rank-one operator.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Helstrom Binary Discrimination

Statement

Let ρ,σ be density operators on a finite-dimensional complex Hilbert space. If they are presented with equal prior probability, the greatest success probability of any binary measurement for identifying the state is 12(1+D(ρ,σ)). The binary projective measurement whose first effect is the spectral projection of Δ=ρ−σ onto its strictly positive eigenspaces attains this value.

Facts & Assumptions

Given: Density operators ρ,σ and equal prior probabilities 1/2.

[F1]

D(ρ,σ)=12∥ρ−σ∥1 (Trace Distance).

[L1]

A finite POVM has nonnegative effects summing to I and outcome probabilities pa=tr⁡(ρEa) (Finite POVMs and their outcome law). The current QC04 definition body is present as a draft.

[L2]

For Hermitian trace-zero Δ, its positive and negative spectral parts satisfy tr⁡Δ+=tr⁡Δ−=12∥Δ∥1 (Hermitian Trace Norm Positive Negative Parts). The current QC01 theorem body is present as a draft.

Proof

1.1givenF1L1algebra

Write a binary POVM as (E,I−E) with 0≤E≤I. Its equal-prior success probability is 12tr⁡(Eρ)+12tr⁡((I−E)σ)=12+12tr⁡(EΔ),Δ=ρ−σ, using tr⁡σ=1.

1.2givenL2L3algebra

For any such effect, [L2] gives tr⁡(EΔ)=tr⁡(EΔ+)−tr⁡(EΔ−)≤tr⁡Δ+: the second trace is nonnegative by [L3], and tr⁡((I−E)Δ+)≥0 by [L3] bounds the first by tr⁡Δ+. Thus [L2] implies tr⁡(EΔ)≤D(ρ,σ).

2.1step 1.2L2

Let E+ be the orthogonal projection onto the positive eigenspaces of Δ. Then E+Δ=Δ+, so tr⁡(E+Δ)=tr⁡Δ+=D(ρ,σ) by [L2]. The binary projective measurement (E+,I−E+) therefore attains the upper bound from step 1.2.

3.1step 1.1step 1.2step 2.1algebra∎

Substituting the maximum tr⁡(EΔ)=D into the success formula of step 1.1 gives 12+12D=12(1+D), as claimed.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Trace Distance Range And Equality

Statement

For finite-dimensional density operators ρ,σ, 0≤D(ρ,σ)≤1. Moreover, D(ρ,σ)=0 iff ρ=σ, and D(ρ,σ)=1 iff their supports are orthogonal.

Facts & Assumptions

Given: Density operators ρ,σ on a finite-dimensional complex Hilbert space.

[F1]

D(ρ,σ)=12∥ρ−σ∥1 (Trace Distance).

[F2]

Density operators are non-negative with trace one (Density operator). The current QC03 definition is present as a draft; its declared existence supplier is still unresolved.

[L1]

If Δ=ρ−σ is Hermitian with trace zero, then its positive and negative spectral parts have equal trace 12∥Δ∥1 (Hermitian Trace Norm Positive Negative Parts).

[F3]

For nonnegative Y, write supp⁡Y:=(ker⁡Y)⊥. If P is an orthogonal projection and tr⁡(PY)=0, cyclicity gives tr⁡(PY)=tr⁡((PY)∗(PY)), a sum of squared coordinate moduli, so PY=0. The positive spectral decomposition gives ker⁡Y=ker⁡Y, hence range⁡Y=supp⁡Y (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA), A non-negative operator has a unique non-negative square root, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

Proof

1.1givenF1F2L1

Let Δ=ρ−σ=Δ+−Δ−. Since tr⁡Δ=0, [L1] gives tr⁡Δ+=tr⁡Δ−=D≥0, proving the lower bound.

1.2givenF1F2algebra

If supp⁡ρ⊥supp⁡σ, then ρσ=0 and Δ acts as ρ on supp⁡ρ, as −σ on supp⁡σ, and as zero on the orthogonal complement. Hence ∥Δ∥1=tr⁡ρ+tr⁡σ=2 and D=1.

2.1step 1.1F2L1L2

Let P+ project onto the strictly positive eigenspaces of Δ. Then 0≤P+≤I and D=tr⁡(P+Δ)=tr⁡(P+ρ)−tr⁡(P+σ)≤tr⁡(P+ρ)≤1. The first inequality uses tr⁡(P+σ)≥0 by [L2], and the last follows from tr⁡((I−P+)ρ)≥0 by [L2] and tr⁡ρ=1.

2.2F1step 1.1algebra

If D=0, [F1] gives ∥ρ−σ∥1=0, so definiteness of the trace norm gives ρ=σ. Conversely equal states have distance zero by [F1].

3.1step 2.1F2F3∎

Conversely, if D=1, then both inequalities in step 2.1 are equalities: tr⁡(P+ρ)=1 and tr⁡(P+σ)=0. Thus tr⁡((I−P+)ρ)=0 and tr⁡(P+σ)=0. Applying [F3] to each positive operator gives (I−P+)ρ=0 and P+σ=0, so supp⁡ρ⊆ran⁡P+ and supp⁡σ⊆ker⁡P+. These subspaces are orthogonal.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Symmetric Power Irreducible

Statement

For every positive integer d and integer k≥0, the natural unitary action of U(d) on Sym⁡k(Cd) is irreducible.

Facts & Assumptions

Given: d≥1, k≥0, and the natural action U⊗k on the permutation-invariant subspace.

[F1]

U(d) is the group of d×d unitary matrices (Unitary Group Compact).

[F2]

Sym⁡k(Cd) is the range of the permutation-average projector; its vectors are exactly those fixed by every tensor-factor permutation (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector).

[L1]

Tensor products of finitely many linear maps defines U⊗k as the factorwise tensor map. The ordered register and permutation convention Ordered tensor registers, their inner product, and wire permutations shows on elementary tensors that this map commutes with each factor permutation. The tensor-map adjoint and composition identities Tensor maps preserve composition, identities, and adjoints make U⊗k a unitary representation when U is unitary. The QC02 interfaces are present as draft carriers.

Proof

1.1givenF2L1algebra

If k=0, the tensor unit is one-dimensional and the action is trivial, so the representation is irreducible. Suppose k≥1. Let e1,…,ed be the standard orthonormal basis of Cd. For each multi-index α=(α1,…,αd)∈Nd with ∑jαj=k, let Ωα be the set of words of length k in which j occurs αj times, and set vα=∣Ωα∣−1/2∑(i1,…,ik)∈Ωαei1⊗⋯⊗eik. The sets Ωα partition the elementary tensor basis, so the vα are orthonormal. A vector fixed by all permutations has equal coefficients on each permutation orbit Ωα; hence these vectors span exactly the symmetric subspace in [F2].

1.2givenF1algebra

Put t=(2k+1)−1 and D=diag⁡(eit,eit2,…,eitd)∈U(d). Each vα is an eigenvector of D⊗k with eigenvalue λα=ei∑jαjtj. These eigenvalues are distinct: for α≠β, let ℓ be the first index with cℓ:=αℓ−βℓ≠0. Then ∣cℓ∣tℓ≥tℓ, while ∣∑j>ℓcjtj∣≤ktℓ+1/(1−t)=tℓ/2; thus the phase difference is nonzero. Also ∣∑jcjtj∣≤kt/(1−t)=1/2<2π, so the phase difference is not a nonzero multiple of 2π.

2.1step 1.1step 1.2choosealgebra

Let W≠{0} be a subspace invariant under every U⊗k, and choose 0≠w=∑αcαvα∈W. At least one coefficient cα is nonzero. Because the eigenvalues in step 1.2 are distinct, the interpolation polynomial pα(z)=∏β≠α(z−λβ)/(λα−λβ) satisfies pα(D⊗k)w=cαvα. Invariance under D⊗k and linearity imply vα∈W. If d=1, step 1.1 has only the single multi-index (k), so this already gives W=Sym⁡k(C). Hence assume d≥2 in the transfer argument below.

3.1step 2.1F1L1choosealgebra

Fix indices i≠j with αi>0, let q>0 be sufficiently small, and set c=(1+q2)−1/2 and s=q(1+q2)−1/2, so c2+s2=1. The unitary rotation sending ei↦cei+sej, ej↦−sei+cej and fixing all other eℓ sends vα into the symmetric subspace by [L1]. The coefficient of vβ for β=α−ei+ej is the positive factor ∣Ωβ∣/∣Ωα∣ times scαi+αj−1P(q2),P(z)=∑r=0min⁡(αi−1,αj)(−1)r(αi−1r)(αj+1r+1)zr. This follows by counting which r output i-positions came from j and which r+1 output j-positions came from i in the tensor expansion. Since P(0)=αj+1>0 and P is a polynomial, choose q>0 small enough that P(q2)≠0. The rotated vector lies in W by invariance; applying the interpolation projection from step 2.1 for weight β isolates a nonzero multiple of vβ, so vβ∈W.

4.1step 1.1step 3.1algebra∎

Repeating step 3.1 transfers one unit from any coordinate with αi>βi to one with αj<βj. Any two nonnegative multi-indices of total k are connected by finitely many such transfers. Thus W contains every basis vector vβ from step 1.1 and equals Sym⁡k(Cd). Every nonzero invariant subspace is therefore the whole representation, proving irreducibility.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Measurement Variation At Most Trace Distance

Statement

Let ρ,σ be density operators on a finite-dimensional complex Hilbert space and let {Ea}a∈A be any finite POVM. If pa=tr⁡(ρEa) and qa=tr⁡(σEa), then 12∑a∈A∣pa−qa∣≤D(ρ,σ). The two-effect projective measurement from the Holevo–Helstrom theorem attains equality.

Facts & Assumptions

Given: Density operators ρ,σ and a finite POVM {Ea}.

[F1]

A finite POVM has nonnegative effects Ea, ∑aEa=I, and probabilities pa=tr⁡(ρEa) (Finite POVMs and their outcome law). The current QC04 definition body is present as a draft.

[F2]

D(ρ,σ)=12∥Δ∥1 for Δ=ρ−σ (Trace Distance).

[L1]

For Hermitian trace-zero Δ=Δ+−Δ−, tr⁡Δ+=tr⁡Δ−=12∥Δ∥1 (Hermitian Trace Norm Positive Negative Parts).

[L2]

The positive spectral projection of Δ and its complement form an attaining binary projective measurement (Helstrom Binary Discrimination).

Proof

1.1givenF1algebra

Set δa=pa−qa=tr⁡(EaΔ). Since ∑aEa=I and tr⁡Δ=tr⁡ρ−tr⁡σ=0, one has ∑aδa=0. Therefore the sum of the positive δa equals 12∑a∣δa∣.

2.1step 1.1F1F2F3L1algebra

Let J={a:δa>0} and EJ=∑a∈JEa. Positivity and completeness in [F1] imply 0≤EJ≤I. By [L1], Δ=Δ+−Δ− with both parts non-negative. Then tr⁡(EJΔ−)≥0 and tr⁡((I−EJ)Δ+)≥0 by [F3], so tr⁡(EJΔ)≤tr⁡Δ+. Consequently 12∑a∣δa∣=∑a∈Jtr⁡(EaΔ)=tr⁡(EJΔ)≤tr⁡Δ+=D(ρ,σ) by [L1] and [F2].

3.1L1L2step 2.1∎

For the positive spectral projection E+ of Δ, the binary measurement (E+,I−E+) has signed outcome differences tr⁡Δ+ and −tr⁡Δ+; hence its total variation is tr⁡Δ+=D. It attains the bound in step 2.1.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Broadcasting Family

Definition

Let H be a nonzero finite-dimensional complex inner-product space, let D(H) be its density operators (nonnegative operators of trace one; Density operator), and let S⊆D(H) be any set, finite or infinite. A broadcaster for S is one quantum channel B:L(H)→L(H⊗H) (completely positive and trace-preserving; Finite-dimensional quantum channel) such that for every ρ∈S, Tr⁡1(B(ρ))=ρandTr⁡2(B(ρ))=ρ. Here Tr⁡1 and Tr⁡2 are the partial traces over the indicated output factors (Partial trace over a finite tensor factor). The joint output may be correlated; this definition does not require B(ρ)=ρ⊗ρ.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Symmetric Subspace Dimension And Haar Moment

Statement

Assume the axiom-of-choice branch used by Normalized Haar probability on a compact group. For integers d≥1 and k≥0, put Nk=(k+d−1d−1). Then dim⁡Sym⁡k(Cd)=Nk, and if μ is the probability measure on the unit sphere obtained by pushing normalized Haar probability on U(d) through U↦Ue1, then ∫∣u⟩⟨u∣⊗k dμ(u)=1NkΠsym,k. For k=0, the tensor power and projector are the identity on the one-dimensional tensor unit.

Facts & Assumptions

Given: d≥1, k≥0, the natural tensor action of U(d), and the stated normalized Haar probability.

[F1]

The symmetric subspace is the range of the average of the k! tensor-factor permutations (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector). The current QC02 permutation definition and the local projector lemma specify the action used here; both are draft carriers.

[F2]

The representation of U(d) on this subspace is irreducible (Symmetric Power Irreducible).

[F3]

The unitary group is compact and normalized Haar probability exists on it under the declared choice axiom (Unitary Group Compact, Normalized Haar probability on a compact group, The Axiom of Choice). The owner-published root bodies exist; their hypotheses and the stated conditional branch were checked.

[F5]

For a unit vector u, Pu=∣u⟩⟨u∣ is a rank-one orthogonal projection of trace one; tensor maps give Pu⊗k=∣u⊗k⟩⟨u⊗k∣, and u⊗k is a unit vector by the product inner product. Every tensor-factor permutation fixes u⊗k, so this tensor is symmetric (Ray-to-projector is well-defined and bijective, Dirac Notation Conversion, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).

Proof

1.1givenF1algebra

For each weak composition α1+⋯+αd=k with αj≥0, sum and normalize the elementary tensors in which index j occurs αj times. Different compositions have disjoint orthonormal tensor supports, and permutation invariance forces coefficients to be constant on each such orbit, so these vectors form a basis of Sym⁡k(Cd) by [F1]. Weak compositions correspond bijectively to placements of d−1 separators among k+d−1 positions (the numbers of stars before, between, and after separators recover the parts). There are (k+d−1d−1)=Nk such placements. For k=0 this gives the single empty tensor.

1.2givenF1F3F5algebra

The pushforward measure μ is invariant under every V∈U(d): left invariance of Haar gives VU the same distribution as U, and (VU)e1=V(Ue1). Define the finite-dimensional operator integral M=∫∣u⟩⟨u∣⊗k dμ(u). By [F5], every integrand is a rank-one projection onto a symmetric tensor and has trace one, so M=ΠsymMΠsym by [F1]. Invariance gives V⊗kM(V⊗k)∗=M.

2.1givenF1F2F4F5step 1.2algebra∎

The coordinate integral in step 1.2 is self-adjoint and nonnegative: each integrand is a rank-one orthogonal projection by [F5], so M∗=M and ⟨Mv,v⟩=∫∣⟨v,u⊗k⟩∣2 dμ(u)≥0. Since M=ΠsymMΠsym, its restriction to the symmetric subspace is self-adjoint and nonnegative. By the spectral theorem [F4], that restriction has an orthogonal decomposition into eigenspaces. Each eigenspace is invariant under U(d) because M commutes with the representation by step 1.2; irreducibility [F2] therefore permits only one eigenspace, so M=cΠsym for some c≥0. Taking traces gives 1=tr⁡M=ctr⁡Πsym=cNk, since every integrand has trace one by [F5] (also for k=0). Thus c=1/Nk, proving the moment identity.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Trace Distance Channel Contractivity

Statement

For every finite-dimensional quantum channel Φ:L(H)→L(K) and every pair of density operators ρ,σ on H, D(Φ(ρ),Φ(σ))≤D(ρ,σ).

Facts & Assumptions

Given: Nonzero finite-dimensional complex Hilbert spaces H,K, a completely positive trace-preserving linear map Φ, and states ρ,σ∈D(H).

[L1]

For a Hermitian trace-zero difference of states, D is the maximum 12∑a∣pa−qa∣ over finite POVMs; each POVM's total variation is at most D (Trace Distance, Measurement Variation At Most Trace Distance, Helstrom Binary Discrimination). The QC06 measurement and Helstrom results are draft suppliers in this same batch.

[L2]

A channel has a finite Kraus representation Φ(X)=∑jKjXKj∗ and trace-preserving Kraus operators satisfy ∑jKj∗Kj=I (Finite-dimensional quantum channel, Kraus and Choi characterizations of complete positivity, Trace preservation is Kraus normalization). The QC05 bodies are present as drafts; their exact outputs remain subject to cross-batch reconciliation.

Proof

1.1givenL1L2algebra

Let {Ea}a∈A be any finite POVM on K and choose Kraus operators from [L2]. Define Fa=∑jKj∗EaKj. For every x∈H, ⟨Fax,x⟩=∑j⟨EaKjx,Kjx⟩≥0, so Fa is nonnegative. Completeness follows from ∑aFa=∑jKj∗(∑aEa)Kj=∑jKj∗Kj=IH by [L2]. Thus {Fa} is a finite POVM on H.

2.1givenL1L2step 1.1algebra∎

For each outcome, trace cyclicity and the Kraus formula give tr⁡(Φ(ρ)Ea)=∑jtr⁡(KjρKj∗Ea)=tr⁡(ρFa), and likewise for σ. Their output total variation is therefore the total variation of the pulled-back POVM and is at most D(ρ,σ) by [L1]. Maximizing over output POVMs gives D(Φ(ρ),Φ(σ)) by the Helstrom formula in [L1], proving contractivity, including ρ=σ.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fidelity classical measurement minimum

Statement

For states ρ,σ on a nonzero finite-dimensional complex Hilbert space H, let a finite POVM be a finite family (Ea)a=1n of nonnegative operators summing to IH. Then F(ρ,σ)=min⁡(Ea)∑a=1ntr⁡(ρEa)tr⁡(σEa). The minimum is attained by a projective measurement with d=dim⁡H rank-one outcomes.

Facts & Assumptions

Given: d=dim⁡H≥1 and density operators ρ,σ on H.

[L1]

Taking the fixed auxiliary space R=H, root fidelity is the maximum overlap of purifications on that common space (Fidelity Purification Characterization). The QC06 theorem proves this case as part of its every-R statement.

[L2]

A finite POVM consists of nonnegative effects summing to identity, and outcome probabilities are tr⁡(ρEa) (Finite POVMs and their outcome law). The QC04 definition body is present as a draft.

[F1]

Cauchy–Schwarz for the inner product gives ∣⟨x,y⟩∣≤∥x∥∥y∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F7]

Density operators are nonnegative and have trace one (Density operator).

[L3]

The positive square root is unique, and the root formula F(ρ,σ)=tr⁡ρ σρ follows from the SVD trace-norm formula (A non-negative operator has a unique non-negative square root, The two root-fidelity trace expressions agree).

[F2]

U(d) is compact in its finite matrix coordinates (Unitary Group Compact), and bounded sequences of matrix coordinates have convergent subsequences by finite-dimensional Heine–Borel (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line). The compactness theorem body is a current QC06 draft; the Heine–Borel supplier is published.

[L4]

Partial trace is characterized by tr⁡((Tr⁡RZ)T)=tr⁡(Z(T⊗IR)) (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent); the QC02 definition and characterization theorem are present as drafts.

[L5]

The finite trace norm is a norm and satisfies the triangle inequality (Trace Norm Duality And Norm Properties). For a fixed matrix shape q×p, set m=min⁡(p,q). SVD gives ∥A∥1≤m(∑i,j∣Aij∣2)1/2, since each singular value is at most the square root of the sum of their squares and ∑jsj(A)2=tr⁡(A∗A)=∑i,j∣Aij∣2. Hence ∣∥A∥1−∥B∥1∣≤m(∑i,j∣Aij−Bij∣2)1/2 for same-shape matrices, proving the coordinate continuity needed below (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Trace Norm).

[F3]

Every finite-dimensional inner-product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[F6]

A limit of nonnegative matrices is nonnegative because self-adjointness and each quadratic-form inequality pass to the coordinate limit (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

Proof

1.1givenF7L1L2L4F1algebra

Let x,y be purifications attaining F(ρ,σ) as in [L1]. For a finite POVM (Ea), put xa=(Ea⊗I)x and ya=(Ea⊗I)y. Since ∑aEa=I, the adjoint identity gives ⟨x,y⟩=∑a⟨xa,ya⟩. By [L4], ∥xa∥2=tr⁡(ρEa) and ∥ya∥2=tr⁡(σEa). The triangle inequality and [F1] termwise give ∣⟨x,y⟩∣≤∑a∥xa∥∥ya∥=∑atr⁡(ρEa)tr⁡(σEa). Therefore every finite POVM overlap is at least F(ρ,σ).

1.2givenF7L3L5F2F5F6algebra

For arbitrary ρ,σ, set ρε=(1−ε)ρ+εI/d and σε=(1−ε)σ+εI/d for 0<ε≤1. Both are positive definite. The root fidelity is continuous on density operators: if An→A are density operators and Bn=An, then [F5] and [F7] give ∑i,j∣(Bn)ij∣2=tr⁡(Bn∗Bn)=1. Thus the coordinate matrices Bn are bounded. Every convergent subsequence has a nonnegative limit B by [F6] and B2=A, so uniqueness in [L3] gives B=A. If (Bn) did not converge to A, a subsequence staying a fixed positive distance away would have a convergent subsubsequence by [F2], contradicting that every such limit is A. Applying this to both state sequences shows their square roots converge; their product converges by the finite matrix-product formula, and its trace norm converges by [L5]. Hence F(ρε,σε)→F(ρ,σ).

2.1givenF7L3F4L6step 1.1algebrachoose

Suppose first that ρ is positive definite. By [F4], choose an orthonormal eigenbasis of ρ; its eigenvalues are strictly positive by positive definiteness, so ρ−1/2 is defined by the reciprocal square roots in this basis. Define M=ρ−1/2(ρ σρ)1/2ρ−1/2. Its quadratic form is nonnegative because it is the quadratic form of (ρ σρ)1/2 at ρ−1/2x, and direct multiplication gives MρM=σ. By [F4], choose an orthonormal eigenbasis of M, with rank-one projections Ej and eigenvalues μj≥0. If pj=tr⁡(ρEj), then tr⁡(σEj)=μj2pj, so the measurement overlap is ∑jμjpj=tr⁡(Mρ)=tr⁡(ρ σρ)=F(ρ,σ) by [L3] and [L6]. Thus a rank-one PVM attains the lower bound when ρ is faithful.

3.1givenstep 2.1step 1.2F2F3algebrachoose

Fix an orthonormal basis of H by [F3], and identify H with Cd. Let Qj be the rank-one projector onto its jth basis vector. Define Pd as ordered families (UQjU∗)j=1d for U∈U(d). Every ordered rank-one PVM has this form, since unit vectors spanning its mutually orthogonal one-dimensional ranges form an orthonormal basis. The map U↦(UQjU∗)j=1d is continuous in matrix coordinates, so Pd is compact by [F2]. For every ε>0, step 2.1 supplies a minimizing PVM in Pd. For n≥1, let Cn be the closure in Pd of all such minimizing PVMs for 0<ε<1/n. The Cn are nonempty nested compact sets, so their intersection is nonempty; fix P0 in it. The overlap function g(ε,P)=∑jtr⁡(ρεPj)tr⁡(σεPj) is continuous at every (0,P0), since trace is a finite coordinate sum and scalar square root is continuous on [0,∞). Given δ>0, choose a neighborhood of (0,P0) where g differs from g(0,P0) by less than δ, and choose n so large that 1/n is inside its ε-neighborhood and, by step 1.2, ∣F(ρε,σε)−F(ρ,σ)∣<δ for 0<ε<1/n. Since P0∈Cn, the definition of closure supplies a minimizing PVM P′ in that neighborhood for some 0<ε<1/n. For this pair, g(ε,P′)=F(ρε,σε), so ∣g(0,P0)−F(ρ,σ)∣<2δ. As δ>0 is arbitrary, g(0,P0)=F(ρ,σ). This gives an attaining rank-one PVM also in the singular case.

4.1step 1.1step 3.1∎

Step 1.1 bounds every finite POVM overlap below by F, and step 3.1 exhibits a finite rank-one PVM whose overlap equals F. This proves the stated minimum and attainment.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Optimal Cloner Attains Bound

Statement

Assume the choice branch in Symmetric Subspace Dimension And Haar Moment. Let d≥1 and 1≤n≤m. Write Nr=(r+d−1d−1) and let Πsym,r project onto Sym⁡r(Cd). For any fixed output density operator ω on (Cd)⊗m, the map Φ(X)=NnNmΠsym,m(X⊗I⊗(m−n))Πsym,m+tr⁡((I−Πsym,n)X) ω is a channel and satisfies tr⁡(Φ(∣u⟩⟨u∣⊗n)∣u⟩⟨u∣⊗m)=Nn/Nm for every unit u∈Cd.

Facts & Assumptions

Given: d≥1, 1≤n≤m, projectors Πsym,r, a fixed output density ω, and the choice-dependent Haar-moment theorem.

[L1]

Πsym,r is the orthogonal projector on the permutation-invariant subspace (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector). The QC02 permutation definition and the local projector proof are draft carriers.

[L2]

dim⁡Sym⁡r=Nr and ∫∣u⟩⟨u∣⊗rdμ=Πsym,r/Nr (Symmetric Subspace Dimension And Haar Moment, The Axiom of Choice). The Haar supplier is a current draft; its choice assumption is explicit.

[L3]

Finite Kraus sums are completely positive (A finite Kraus sum is completely positive), and the partial trace satisfies tr⁡(A(X⊗I))=tr⁡(XTr⁡m−nA) (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent, For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)). The QC02 carriers are present as drafts; the trace identity follows from the stated trace-pairing characterization.

[F1]

A quantum channel is completely positive and trace-preserving on the full operator space (Finite-dimensional quantum channel).

[F2]

A density operator has trace one (Density operator).

[F4]

Finite-dimensional complex inner-product spaces have orthonormal bases (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[F5]

A nonnegative operator has a unique nonnegative square root (A non-negative operator has a unique non-negative square root).

[F6]

Dirac outer products act by z↦⟨z,y⟩x, and tensor maps are the factorwise linear extensions on ordered tensor registers (Dirac Notation Conversion, Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations).

Proof

1.1givenL1L3F3F4F5F6algebrachoose

Put E=I−Πsym,n≥0 by [L1], so E1/2 exists by [F5]. The first summand of Φ is completely positive: by [F4], choose an orthonormal product basis (gj) of the added registers and set Aj=Nn/Nm Πsym,m(I⊗∣gj⟩). Then ∑jAjXAj∗=NnNmΠsym,m(X⊗I⊗(m−n))Πsym,m. When m=n, the added tensor unit has its single basis vector and this map is the identity before compression. By [F3], write ω=∑ℓsℓ∣fℓ⟩⟨fℓ∣ in an orthonormal eigenbasis and choose an input orthonormal basis (ej) by [F4]. The second summand has Kraus operators Kℓj=sℓ∣fℓ⟩⟨ej∣E1/2, using [F6] and the outer-product convention, since ∑ℓ,jKℓjXKℓj∗=tr⁡(EX)ω. Thus both summands and their sum are completely positive by the finite Kraus theorem [L3].

2.1givenL1L2L3F1F2F6step 1.1algebra

The Haar moment [L2], followed by the coordinate partial trace over the last m−n factors, gives Tr⁡m−n(Πsym,m)=(Nm/Nn)Πsym,n, because each product-basis partial trace sends ∣u⟩⟨u∣⊗m to ∣u⟩⟨u∣⊗n. Finite-dimensionality allows the partial trace to pass through the coordinatewise integral. Therefore tr⁡ ⁣(NnNmΠsym,m(X⊗I)Πsym,m)=tr⁡(XΠsym,n), where cyclicity, Πsym,m2=Πsym,m, and [L3] were used. The second summand has trace tr⁡(EX)tr⁡(ω)=tr⁡(EX) by [F2]. Their sum is tr⁡X, so [F1] and step 1.1 make Φ a channel.

3.1givenL1step 2.1algebra∎

For unit u, ∣u⟩⊗n lies in the symmetric subspace, so the second summand vanishes. Also ∣u⟩⊗m is fixed by Πsym,m. Its expectation in the first summand is therefore (Nn/Nm)⟨u⊗m∣(∣u⟩⟨u∣⊗n⊗I)∣u⊗m⟩=Nn/Nm. This value is independent of u, proving the claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Optimal Cloning Worst Case Upper Bound

Statement

Assume the choice branch in Symmetric Subspace Dimension And Haar Moment. Let d≥1 and 1≤n≤m. Every channel Φ:L((Cd)⊗n)→L((Cd)⊗m) has inf⁡∥u∥=1F ⁣(Φ(∣u⟩⟨u∣⊗n),∣u⟩⟨u∣⊗m)2≤NnNm,Nr=(r+d−1d−1).

Facts & Assumptions

Given: d≥1, 1≤n≤m, a channel Φ, and the normalized unitary-invariant measure in the stated choice branch.

[L1]

The Haar moment is ∫∣u⟩⟨u∣⊗rdμ=Πsym,r/Nr (Symmetric Subspace Dimension And Haar Moment, The Axiom of Choice).

[L2]

For a state η and a pure projector Pu, the squared root fidelity is F(η,Pu)2=tr⁡(ηPu); this follows from the definition and the one-nonzero-singular-value formula (Fidelity, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[L3]

A channel is completely positive and trace-preserving on the full operator space; it has a finite Kraus representation Φ(X)=∑aAaXAa∗ with ∑aAa∗Aa=I (Finite-dimensional quantum channel, Kraus and Choi characterizations of complete positivity, Trace preservation is Kraus normalization).

[F1]

For r∈{n,m}, Πsym,r is the orthogonal projector onto the symmetric subspace; it and I−Πsym,r are nonnegative (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector).

[F2]

If A,B are nonnegative, then tr⁡(AB)=tr⁡(B1/2AB1/2)≥0 by cyclicity and positivity (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA), A non-negative operator has a unique non-negative square root).

[F3]

Cauchy–Schwarz gives ∣⟨x,y⟩∣2≤∥x∥2∥y∥2 (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs). Rank-one operators act by ∣x⟩⟨y∣z=⟨z,y⟩x (Dirac Notation Conversion).

Proof

1.1givenL2L3F1F3algebrachoose

Choose a finite Kraus family (Aa) from [L3], and write Πn=Πsym,n and Πm=Πsym,m. For each unit u, put v=u⊗n, w=u⊗m, and f(u)=tr⁡(Φ(∣v⟩⟨v∣)∣w⟩⟨w∣). By [L2], this is the squared root fidelity in the Statement. Since v is a unit symmetric tensor, Πnv=v by [F1]. The Kraus formula, the rank-one convention, and Cauchy–Schwarz [F3] give f(u)=∑a∣⟨Aav,w⟩∣2=∑a∣⟨v,ΠnAa∗w⟩∣2≤∑a∥ΠnAa∗w∥2=⟨Cw,w⟩, where C=∑aAaΠnAa∗ is self-adjoint and nonnegative: each quadratic form is ∥ΠnAa∗w∥2.

2.1givenL1L3F1F2step 1.1algebra∎

Integrating this pointwise bound and applying the m-th Haar moment [L1] yields ∫f(u)dμ(u)≤tr⁡(CΠm)/Nm. Since C and I−Πm are nonnegative by step 1.1 and [F1], [F2] gives tr⁡(C(I−Πm))≥0, hence tr⁡(CΠm)≤tr⁡C. Trace cyclicity [F2], normalization [L3], and [L1] give tr⁡C=∑atr⁡(ΠnAa∗Aa)=tr⁡Πn=Nn. Therefore ∫f(u)dμ(u)≤Nn/Nm. The function f is continuous in the finite coordinates of u, hence measurable; because μ is a probability measure, its infimum is no larger than its average. Thus inf⁡∥u∥=1f(u)≤Nn/Nm, including d=1 and n=m.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Channel Diamond Norm One

Statement

Every quantum channel Φ:L(H)→L(K) between nonzero finite-dimensional complex Hilbert spaces has ∥Φ∥⋄=1.

Facts & Assumptions

Given: Nonzero finite-dimensional H,K and a completely positive trace-preserving map Φ.

[L1]

The diamond norm is the supremum of induced trace norms of finite amplifications, and it may be capped at dim⁡H (Diamond Norm, Diamond Norm Ancilla Dimension Bound). The ancilla-bound carrier is draft.

[L2]

A channel has a finite Kraus representation Φ(X)=∑jKjXKj∗ and trace preservation gives ∑jKj∗Kj=I (Finite-dimensional quantum channel, Kraus and Choi characterizations of complete positivity, Trace preservation is Kraus normalization).

[L3]

A finite Kraus sum is completely positive, and trace-norm duality is ∥X∥1=max⁡∥B∥∞≤1∣tr⁡(B∗X)∣ (A finite Kraus sum is completely positive, Trace Norm Duality And Norm Properties).

[L4]

Ordered tensor registers fix the factor and pairing conventions; tensor maps act factorwise and their adjoints are factorwise, so tensor amplification of the Kraus formula has Kraus operators Kj⊗IR (Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints, [L2]).

[L6]

Products of operator matrix units form a basis for the full operator space on a tensor product, so the factorwise Kraus expansion checked on these matrix units determines the amplified map for every operator (Tensor products of operator matrix units form a basis).

[F2]

The operator norm is ∥T∥∞=sup⁡∥x∥=1∥Tx∥, and the trace pairing is cyclic for finite-dimensional rectangular maps (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)).

[F3]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[L5]

For a unit vector v, ∣v⟩⟨v∣ is a rank-one orthogonal projection and is a density operator (Dirac Notation Conversion, Ray-to-projector is well-defined and bijective, Density operator).

Proof

1.1givenL1L2L3L4L6F2F3algebra

By [L1], it suffices to use the ancilla R=Cd, where d=dim⁡H. Let Λ=Φ⊗id⁡R. By [L4], its Kraus operators are Kj⊗IR, and [L6] ensures this factorwise Kraus formula agrees with the amplification on every operator. Its trace-preserving normalization follows from [L2]. Define Λ∗(B)=∑j(Kj∗⊗IR)B(Kj⊗IR). It is completely positive by [L3] and unital because ∑j(Kj∗⊗IR)(Kj⊗IR)=I. If ∥B∥∞≤1, then (IBB∗I) is nonnegative: for any (x,y) its quadratic form is at least ∥x∥2+∥y∥2−2∥x∥∥y∥≥0 by [F2]–[F3]. Complete positivity of Λ∗ applied with the two-dimensional auxiliary space preserves this block positivity. For T=Λ∗(B), test the resulting block operator on (−Ty,y); its quadratic form is ∥y∥2−∥Ty∥2, so ∥Λ∗(B)∥∞≤1.

2.1givenL1L2L3L4F1F2F3L5step 1.1algebra∎

For any input operator X, the Kraus formula for Λ∗ and cyclicity [F2] give tr⁡(B∗Λ(X))=tr⁡(Λ∗(B)∗X). Trace-norm duality [L3] then gives ∥Λ(X)∥1=max⁡∥B∥∞≤1∣tr⁡(B∗Λ(X))∣=max⁡∥B∥∞≤1∣tr⁡(Λ∗(B)∗X)∣≤∥X∥1, using step 1.1. Thus the induced norm at ancilla dimension d is at most one, and [L1] gives ∥Φ∥⋄≤1. Conversely choose unit vectors x∈H and e∈Cd. The rank-one projector P=∣x⊗e⟩⟨x⊗e∣ is a density operator by [L5]. The amplified map Λ is completely positive by [L3] and trace-preserving by [L2] and [L4], so Λ(P) is a density operator and has trace norm one by [F1]. Therefore the induced norm at d is at least one, and [L1] gives ∥Φ∥⋄≥1.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fidelity range equality and products

Statement

For finite-dimensional density operators ρ,σ, 0≤F(ρ,σ)≤1,F(ρ,σ)=1  ⟺  ρ=σ,F(ρ,σ)=0  ⟺  supp⁡ρ⊥supp⁡σ. For density operators ρ,σ on H and τ,ω on K, F(ρ⊗τ,σ⊗ω)=F(ρ,σ)F(τ,ω).

Facts & Assumptions

Given: Nonzero finite-dimensional spaces H,K and density operators on them.

[L1]

Taking the fixed auxiliary space R=H, root fidelity is the maximum absolute inner product of purifications (Fidelity Purification Characterization); the QC06 theorem proves this as part of its every-R statement.

[L2]

Root fidelity equals ∥ρσ∥1 (Fidelity), the trace norm is a norm, and singular values of a tensor product are pairwise products of singular values (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Trace Norm Duality And Norm Properties). The QC01 norm theorem body is present as a draft.

[F2]

Density operators are nonnegative and have trace one (Density operator).

[F1]

Cauchy–Schwarz bounds the absolute inner product of unit vectors by one, with equality exactly for linearly dependent vectors (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F3]

On finite product spaces, ρ⊗τ is nonnegative and squares to ρ⊗τ: diagonalize both nonnegative factors in orthonormal eigenbases; the product basis has eigenvalues equal to products of their nonnegative eigenvalues, and tensor-map composition gives the square identity. Uniqueness of the nonnegative square root identifies it with ρ⊗τ (A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints, A non-negative operator has a unique non-negative square root).

[L3]

The trace norm of a tensor product of finite-dimensional maps is the product of the trace norms (Trace norm of a tensor product).

Proof

1.1givenL1L2F1F2algebra

The fidelity is nonnegative because it is a trace norm. Choose unit purifications attaining the maximum in [L1]; [F1] gives their overlap at most one, so F≤1. If F=1, equality in [F1] makes the two purifying vectors scalar multiples of modulus one. Their partial traces are then equal, hence ρ=σ. Conversely, if ρ=σ, choose the same purification twice to obtain overlap one.

1.2givenL2algebra

By [L2], F=0 exactly when ρσ=0, since a norm vanishes only at zero. The range of σ is supp⁡σ, while the kernel of ρ is (supp⁡ρ)⊥. Thus the product is zero exactly when supp⁡σ⊆(supp⁡ρ)⊥, which is the asserted orthogonality.

2.1givenL2F2F3L3algebra∎

By [F3] and uniqueness of the nonnegative square root, ρ⊗τ=ρ⊗τ. Tensor-map composition gives (ρ⊗τ)(σ⊗ω)=(ρσ)⊗(τω). Now [L3] makes the trace norm of this product the product of the two factor trace norms, which by the root-fidelity definition is F(ρ,σ)F(τ,ω).

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Channel Composition Hybrid Bound

Statement

Let H0,H1,H2 be nonzero finite-dimensional complex Hilbert spaces, and let Φ0,Ψ0:L(H0)→L(H1) and Φ1,Ψ1:L(H1)→L(H2) be finite-dimensional channels. Then ∥Ψ1∘Ψ0−Φ1∘Φ0∥⋄≤∥Ψ0−Φ0∥⋄+∥Ψ1−Φ1∥⋄.

Facts & Assumptions

Given: Nonzero finite-dimensional H0,H1,H2 and four channels with the indicated domains and codomains.

[F1]

A channel is a completely positive trace-preserving linear map (Finite-dimensional quantum channel).

[L1]

The diamond norm is the supremum of induced trace norms over all finite ancillas and equals the induced norm at input dimension (Diamond Norm, Diamond Norm Ancilla Dimension Bound). The ancilla theorem is a current draft.

[L2]

Every finite trace norm satisfies its triangle inequality and the induced norm is submultiplicative under composition (Trace Norm Duality And Norm Properties).

[L3]

Each channel has diamond norm one (Channel Diamond Norm One). The QC06 supplier is draft.

[L4]

For each finite R, the operators built from products of matrix units span L(H⊗R) (Tensor products of operator matrix units form a basis); on them, factorwise tensor-map composition gives (A⊗id⁡R)∘(B⊗id⁡R)=(A∘B)⊗id⁡R (Tensor products of finitely many linear maps, Tensor maps preserve composition, identities, and adjoints).

Proof

1.1givenL1L2L4algebra

For any fixed ancillary space R, write ΛR(T)=T⊗id⁡R. By [L4], the amplification respects composition, so ∥((A∘B)⊗id⁡R)(X)∥1≤∥A⊗id⁡R∥1→1∥B⊗id⁡R∥1→1∥X∥1 for each X. Taking suprema over nonzero X and then over R proves ∥A∘B∥⋄≤∥A∥⋄∥B∥⋄. The pointwise trace-norm triangle inequality likewise gives the triangle inequality for the diamond norm.

2.1givenF1L2L3step 1.1algebra∎

The algebraic identity Ψ1Ψ0−Φ1Φ0=Ψ1(Ψ0−Φ0)+(Ψ1−Φ1)Φ0 holds on every input by expansion. Apply step 1.1 and [L3] to the two terms: the first has diamond norm at most ∥Ψ1∥⋄∥Ψ0−Φ0∥⋄=∥Ψ0−Φ0∥⋄, and the second at most ∥Ψ1−Φ1∥⋄∥Φ0∥⋄=∥Ψ1−Φ1∥⋄. The triangle inequality from step 1.1 proves the claimed sum.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fidelity Data Processing

Statement

For every finite-dimensional channel Φ:L(H)→L(K) and states ρ,σ∈D(H), F(ρ,σ)≤F(Φ(ρ),Φ(σ)). No general equality characterization is asserted.

Facts & Assumptions

Given: Nonzero finite-dimensional spaces H,K, a channel Φ, and density operators ρ,σ on H.

[L1]

An isometric Stinespring dilation writes Φ(X)=Tr⁡E(VXV∗) for an isometry V:H→K⊗E (Finite-dimensional quantum channel, Every finite-dimensional channel has a finite isometric dilation). The QC05 definition and theorem bodies are present as drafts.

[L2]

For every auxiliary space R with dim⁡R≥dim⁡H, the maximum overlap of purifications of the inputs on H⊗R is F(ρ,σ) and is attained (Fidelity Purification Characterization). The QC06 proof is a draft, not accepted.

[F1]
[F2]

Partial trace is characterized by its trace-pairing identity (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent). The successive-trace rule follows by pairing both sides with any endomorphism T on the retained factor: each pairing is tr⁡(Z(T⊗I⊗I)). For the specific local-isometry use below, write x=∑i,axiaei⊗ra and Vei=∑b,cVbc,ikb⊗fc. The (b,b′) entry after tracing E⊗R from (V⊗IR)∣x⟩⟨x∣(V∗⊗IR) is ∑c,a,i,i′Vbc,ixiaVb′c,i′‾xi′a‾; tracing R first and then E from V(Tr⁡R∣x⟩⟨x∣)V∗ gives the same finite sum. Thus the partial-trace identity in step 1.1 follows directly in the ordered product coordinates.

Proof

1.1givenL1L2F1F2algebra

Choose R with dim⁡R≥max⁡(dim⁡H,dim⁡K) and purifications x,y∈H⊗R attaining F(ρ,σ) by [L2]. The Stinespring environment E is nonzero because V:H→K⊗E is an isometry and H≠0, so dim⁡(E⊗R)≥dim⁡K. The tensor map V⊗IR and the factor permutation identify their images with vectors in K⊗(E⊗R) by [F1]. Their norms are one because V is an isometry. In product coordinates, the partial-trace characterization [F2] gives Tr⁡E⊗R((V⊗IR)∣x⟩⟨x∣(V∗⊗IR))=Tr⁡E(V(Tr⁡R∣x⟩⟨x∣)V∗)=Φ(ρ), and the same calculation gives output marginal Φ(σ) for y. Their inner product is ⟨x,y⟩ because V∗V=I. Thus they are purifications of the output states with the same overlap.

2.1step 1.1L2∎

The maximum-overlap formula [L2] for the output states is at least the overlap of the particular output purifications in step 1.1. That overlap has absolute value F(ρ,σ), so F(Φ(ρ),Φ(σ))≥F(ρ,σ), as required.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Fuchs Van De Graaf

Statement

For density operators ρ,σ on a nonzero finite-dimensional complex Hilbert space, 1−F(ρ,σ)≤D(ρ,σ)≤1−F(ρ,σ)2, where F is root fidelity and D(ρ,σ)=12∥ρ−σ∥1.

Facts & Assumptions

Given: Density operators ρ,σ on a nonzero finite-dimensional H.

[L1]

Some finite rank-one PVM has classical overlap ∑apaqa=F(ρ,σ), and every such measurement has total variation at most D (Fidelity classical measurement minimum, Trace Distance, Measurement Variation At Most Trace Distance).

[L2]

Taking the fixed auxiliary space R=H, there are purifications with overlap F (Fidelity Purification Characterization); the QC06 theorem proves this as part of its every-R statement.

[L3]

For unit vectors x,y, D(∣x⟩⟨x∣,∣y⟩⟨y∣)=1−∣⟨x,y⟩∣2 (Pure state trace distance).

[L4]

Proof

1.1givenL1algebra

Let (Ea) be the rank-one PVM from [L1], with probabilities pa=tr⁡(ρEa) and qa=tr⁡(σEa). For nonnegative p,q, pq≥min⁡(p,q) because if p≤q then pq≥p2, and the other case is symmetric. Since ∑apa=∑aqa=1, 1−F=1−∑apaqa≤1−∑amin⁡(pa,qa)=12∑a∣pa−qa∣≤D(ρ,σ). The last inequality is [L1].

2.1givenL2L3L4∎

Choose purifications x,y attaining the overlap ∣⟨x,y⟩∣=F(ρ,σ) by [L2]. By [L3], their pure-state trace distance is 1−F(ρ,σ)2. Taking the partial trace over the auxiliary factor maps their rank-one projectors to ρ and σ; contractivity [L4] therefore gives D(ρ,σ)≤1−F(ρ,σ)2. This proves the upper bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Optimal Universal Pure State Cloning Bound

Statement

Assume the choice branch used by the normalized Haar moment theorem. For d≥1 and 1≤n≤m, the largest possible worst-case squared root fidelity of a channel from n identical d-dimensional input registers to m output registers is NnNm,Nr=(r+d−1d−1). For n=1,m=2 this value is 2/(d+1).

Facts & Assumptions

Given: d≥1, 1≤n≤m, and the choice-dependent symmetric-subspace/Haar results.

[L1]

Every such channel has worst-case squared fidelity at most Nn/Nm (Optimal Cloning Worst Case Upper Bound, The Axiom of Choice). The lemma is a draft and depends on the Haar-moment branch.

[L2]

The displayed measure-and-prepare correction channel is CPTP and has squared fidelity exactly Nn/Nm on every pure input (Optimal Cloner Attains Bound). Its supplier is a draft.

Proof

1.1givenL1L2algebra

The upper bound [L1] applies to every admissible channel. The explicit channel in [L2] belongs to this same class and attains the bound for every unit input, so its worst-case value is at least Nn/Nm. Combining the two inequalities shows that the supremum over channels is exactly Nn/Nm, and the construction attains it.

2.1givenstep 1.1algebra∎

For n=1,m=2, N1=(dd−1)=d and N2=(d+1d−1)=d(d+1)/2. Their ratio is 2/(d+1), including d=1, where it equals one and the one-dimensional state is cloned trivially.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Pure State No Cloning

Statement

Let S be a set of pure-state rays in a nonzero finite-dimensional Hilbert space H. If one channel maps every pure-state projector Pψ with ray ψ∈S to Pψ⊗Pψ, then every pair of rays in S is identical or orthogonal. Consequently no channel exactly clones all pure states when dim⁡H≥2; when dim⁡H=1, the unique ray is cloned by the one-dimensional isometry.

Facts & Assumptions

Given: Nonzero finite-dimensional H, a set S of rays, and a channel Φ with the stated exact pure-state outputs.

[L1]

A pure state is a ray represented by a rank-one projector (Pure state and ray); Ray-to-projector is well-defined and bijective proves the projector is independent of the unit representative. The QC03 definition and its well-definedness theorem are present as drafts.

[L2]

Every finite-dimensional channel has an isometric Stinespring dilation V:H→H⊗H⊗E (Finite-dimensional quantum channel, Every finite-dimensional channel has a finite isometric dilation). The QC05 channel and dilation theorem bodies are present as drafts.

[L3]

The Schmidt decomposition of a bipartite vector has orthonormal factor families and positive Schmidt coefficients; a rank-one reduced projector therefore leaves one Schmidt coefficient and a product vector (Schmidt decomposition). The QC03 theorem body is present as a draft.

[L4]

The ordered tensor-register convention supplies the factorwise product inner product; partial trace is defined on finite tensor registers, and an isometry followed by partial trace defines a channel (Ordered tensor registers, their inner product, and wire permutations, Partial trace over a finite tensor factor, An isometry followed by partial trace is a channel).

Proof

1.1givenL1L2L3algebra

For each unit representative ψ of a ray in S, the reduced state of Vψ on the two output registers is the pure projector Pψ⊗Pψ. By the Schmidt decomposition [L3], there is a unit environment vector eψ and a phase absorbed into it such that Vψ=ψ⊗ψ⊗eψ.

2.1givenstep 1.1algebra

For any two unit representatives ψ,ϕ∈S, the isometry preserves their inner product. By step 1.1, ⟨ψ,ϕ⟩=⟨Vψ,Vϕ⟩=⟨ψ,ϕ⟩2⟨eψ,eϕ⟩. Taking absolute values and applying Cauchy–Schwarz to the unit environment vectors gives c=c2∣⟨eψ,eϕ⟩∣≤c2, where c=∣⟨ψ,ϕ⟩∣∈[0,1]. Hence c(1−c)≤0 with both factors nonnegative, so c=0 or c=1. The first case is orthogonality; in the second, equality in Cauchy–Schwarz makes the two vectors scalar multiples and their rays identical (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

3.1givenstep 2.1L4algebrachoose∎

If dim⁡H≥2, choose orthonormal e1,e2; the rays of e1 and (e1+e2)/2 are neither equal nor orthogonal, contradicting step 2.1 for a universal exact cloner. If dim⁡H=1, fix a unit vector e and take the one-dimensional environment E=C with unit vector f. Define V(e)=e⊗e⊗f and extend linearly; because this sends the unit basis vector to a unit product vector, it is an isometry. By [L4], X↦Tr⁡E(VXV∗) is a channel; on the sole pure-state projector it outputs Pe⊗Pe. Hence the unique ray is cloned by a channel.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Channel Tensor Error Bound

Statement

For nonzero finite-dimensional complex Hilbert spaces Hi,Ki and linear maps Φi:L(Hi)→L(Ki), i=1,2, ∥Φ1⊗Φ2∥⋄=∥Φ1∥⋄∥Φ2∥⋄. Consequently, if Φi,Ψi:L(Hi)→L(Ki) are channels, then ∥Φ1⊗Φ2−Ψ1⊗Ψ2∥⋄≤∥Φ1−Ψ1∥⋄+∥Φ2−Ψ2∥⋄.

Facts & Assumptions

Given: Nonzero finite-dimensional input and output spaces, two linear maps, and, for the error bound, four channels with matching factor domains and codomains.

[L1]

The diamond norm is the supremum of amplified induced trace norms; the ancilla dimension can be capped at the input dimension, and an attaining rank-one input exists (Diamond Norm, Diamond Norm Ancilla Dimension Bound). The dimension-bound carrier is a current draft.

[L2]

The trace norm of a tensor product of finite-dimensional maps is the product of the trace norms (Trace norm of a tensor product).

[L3]

Factor reorderings are unitary by Finite wire permutations are unitary basis permutations. If U,V are unitary, then (UAV)∗(UAV)=V∗A∗AV, whose eigenvalues equal those of A∗A by unitary conjugacy; hence UAV has the same singular values and trace norm as A (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[L5]

Tensor maps act on elementary tensors factorwise (Tensor products of finitely many linear maps); their composition is factorwise, and tensoring identities gives the identity on the tensor product (Tensor maps preserve composition, identities, and adjoints).

[L7]

Products of matrix units form a basis of the full tensor-product operator space, so equalities checked on those product operators hold for every input (Tensor products of operator matrix units form a basis).

[F1]

The trace norm satisfies the triangle inequality (Trace Norm Duality And Norm Properties).

[F2]

A channel is a completely positive trace-preserving linear map (Finite-dimensional quantum channel).

[L6]

Every channel has diamond norm one (Channel Diamond Norm One).

Proof

1.1givenL1L3L5L7algebra

Put a=∥Φ1∥⋄ and b=∥Φ2∥⋄. For any finite ancilla R, let Smid:K1⊗H2⊗R→H2⊗K1⊗R and Sout:K2⊗K1⊗R→K1⊗K2⊗R be the wire swaps from [L3]. For each product matrix unit X=X1⊗X2⊗XR on H1⊗H2⊗R, factorwise tensor-map composition [L5] shows that first applying Φ1⊗id⁡H2⊗R, conjugating by Smid, applying Φ2⊗id⁡K1⊗R, and conjugating by Sout gives Φ1(X1)⊗Φ2(X2)⊗XR. This is exactly (Φ1⊗Φ2⊗id⁡R)(X). By the matrix-unit basis [L7], equality holds for every operator X. The two amplified maps have induced trace norms at most a and b; conjugating by the wire swaps preserves trace norm by [L3]. Hence the composite output has trace norm at most ab∥X∥1, and taking the suprema proves ∥Φ1⊗Φ2∥⋄≤ab.

2.1givenL1L2L3L5L7step 1.1algebra

By [L1], choose unit rank-one operators Xi=Rxi,yi on an ancilla of dimension dim⁡Hi attaining ∥Φi∥⋄. The tensor input X1⊗X2 has trace norm ∥X1∥1∥X2∥1=1 by [L2]. After the factor reordering, its output is (Φ1⊗id⁡Cdim⁡H1)(X1)⊗(Φ2⊗id⁡Cdim⁡H2)(X2) by [L5] and [L7]; its trace norm is the product of the two output trace norms by [L2]. It is therefore an admissible test showing ∥Φ1⊗Φ2∥⋄≥ab. Together with step 1.1 this proves multiplicativity.

3.1givenF1F2L1L6step 2.1algebra∎

Use the exact identity Φ1⊗Φ2−Ψ1⊗Ψ2=(Φ1−Ψ1)⊗Φ2+Ψ1⊗(Φ2−Ψ2). For each ancilla, [F1] gives the triangle inequality for the amplified trace norm; taking its supremum gives the diamond-norm triangle inequality. By [F2] the four factor maps are channels, so step 2.1 bounds the two tensor terms by ∥Φ1−Ψ1∥⋄∥Φ2∥⋄ and ∥Ψ1∥⋄∥Φ2−Ψ2∥⋄. Both channel norms equal one by [L6], giving the stated sum.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Exact Mixed State Cloning Fidelity Criterion

Statement

Let ρ0,ρ1 be finite-dimensional density operators. If one channel Φ satisfies Φ(ρi)=ρi⊗ρi for i=0,1, then F(ρ0,ρ1)∈{0,1}. Therefore the inputs are identical or have orthogonal supports.

Facts & Assumptions

Given: States ρ0,ρ1 and a channel exactly cloning both.

[L1]

Fidelity cannot decrease under a channel (Fidelity Data Processing); the QC06 proof is draft.

[L2]

Fidelity is multiplicative on tensor products, lies in [0,1], equals one exactly for equal states, and equals zero exactly for orthogonal supports (Fidelity range equality and products); its QC06 proof is draft.

[L3]

The output states of the exact cloning channel are ρi⊗ρi (Finite-dimensional quantum channel, given hypothesis).

Proof

1.1givenL1L2L3algebra

Apply data processing [L1] to the channel and the two inputs, then use its exact outputs and the tensor-product formula [L2]: F(ρ0,ρ1)≤F(ρ0⊗ρ0,ρ1⊗ρ1)=F(ρ0,ρ1)2. Writing f=F(ρ0,ρ1)∈[0,1], the inequality f≤f2 forces f=0 or f=1, because f(1−f)≤0 and both factors are nonnegative.

2.1step 1.1L2∎

If f=1, [L2] gives ρ0=ρ1. If f=0, [L2] gives orthogonality of their supports. These are the asserted alternatives.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Full Rank Pair No Broadcasting

Statement

Let H be a nonzero finite-dimensional complex Hilbert space and let ρ0,ρ1 be positive-definite density operators on H. One channel B:L(H)→L(H⊗H) broadcasts both states if and only if ρ0ρ1=ρ1ρ0.

Facts & Assumptions

Given: Positive-definite density operators ρ0,ρ1 and a single channel B whose two output marginals are each the corresponding input.

[F1]

A density operator is nonnegative and has trace one (Density operator).

[L1]

Broadcasting means both partial traces of each output equal that input (Broadcasting Family, Partial trace over a finite tensor factor). The partial-trace trace-pairing identity gives the marginal calculations below, and partial trace is a channel (The partial trace is characterized by the trace pairing and is basis-independent, An isometry followed by partial trace is a channel). The coordinate definition also gives Tr⁡1(X(I⊗G))=(Tr⁡1X)G, Tr⁡2(X(G⊗I))=(Tr⁡2X)G, and Tr⁡i(X∗)=(Tr⁡iX)∗: each identity follows by expanding the repeated traced index in the defining finite sum.

[L2]

Fidelity is the minimum classical measurement overlap, attained by a PVM for faithful input states (Fidelity classical measurement minimum). Its full proof is drafted in this batch.

[L3]

Fidelity is monotone under channels (Fidelity Data Processing). The QC06 proof remains draft.

[L4]

Square endomorphism polar decomposition gives a unitary U with UA=(A∗A)1/2; the trace-norm spectral formula then gives ∣tr⁡(UA)∣=∥A∥1. Positive square roots are unique (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, Trace Norm Spectral Formula, Trace Norm Duality And Norm Properties, A non-negative operator has a unique non-negative square root).

[L5]

The Hilbert–Schmidt pairing on matrices is an inner product and satisfies Cauchy–Schwarz with equality exactly for linearly dependent pairs (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs); in coordinates this is the ordinary finite inner-product theorem.

[L6]

Self-adjoint finite-dimensional operators have orthonormal eigenbases (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, Every finite-dimensional real or complex inner product space has an orthonormal basis). A finite Kraus family defines a completely positive map, and its normalization ∑jKj∗Kj=I makes it trace-preserving (A finite Kraus sum is completely positive, Trace preservation is Kraus normalization).

[L7]

Under the Dirac convention, ∣x⟩⟨y∣ maps z to ⟨z,y⟩x; its adjoint is ∣y⟩⟨x∣ by the defining adjoint identity (Dirac Notation Conversion, The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V).

Proof

1.1givenF1L2algebra

Since ρ0,ρ1 are faithful, the measurement-minimum theorem [L2] supplies a rank-one PVM (Eb) whose classical overlap is F(ρ0,ρ1). Every ps,b=tr⁡(ρsEb) is positive: if Eb=∣b⟩⟨b∣ and ρs is positive definite, then ps,b=⟨ρsb,b⟩>0.

2.1givenL1L2L3step 1.1algebra

Put ρ~s=B(ρs). Data processing under B gives F(ρ0,ρ1)≤F(ρ~0,ρ~1). Data processing under either partial trace, whose outputs are ρs by [L1], gives the reverse inequality. Hence equality holds. Measuring Eb⊗I on the first output factor, or I⊗Eb on the second, produces the same probabilities as measuring Eb on the input; each classical overlap is F(ρ~0,ρ~1) and so is optimal by [L2].

3.1givenL2L4L5step 1.1step 2.1algebra

For any two states R,S and a finite POVM (Qb) attaining the minimum overlap, choose a polar unitary U with URS=SRS. For each outcome let Ab=URQb1/2 and Cb=SQb1/2. The Hilbert–Schmidt norms satisfy ∥Ab∥22=tr⁡(RQb) and ∥Cb∥22=tr⁡(SQb), while their inner product is tr⁡(URQbS). Thus Cauchy–Schwarz and the triangle inequality give ∑btr⁡(RQb)tr⁡(SQb)≥∑b∣tr⁡(UR QbS)∣≥∣tr⁡(URS)∣=F(R,S). Equality of the endpoints forces equality term by term in Cauchy–Schwarz and common nonnegative phase in the triangle inequality. For each outcome with tr⁡(SQb)>0, this gives a scalar γb≥0 with UR Qb1/2=γbS Qb1/2. Applying this to the two optimal PVMs of step 2.1, there are unitaries U,V and nonnegative αb,βb such that Uρ~0(I⊗Eb)=αbρ~1(I⊗Eb),Vρ~0(Eb⊗I)=βbρ~1(Eb⊗I), and both U,V satisfy Uρ~0ρ~1=Vρ~0ρ~1=ρ~1ρ~0ρ~1. For these two PVMs every outcome probability is positive by step 1.1 and the broadcaster marginals, so neither Cauchy–Schwarz vector is zero; dependence therefore gives the displayed scalar equations.

4.1givenL1step 3.1algebra

Set G=∑bαbEb and J=∑bβbEb. Summing the equations in step 3.1 gives Uρ~0=ρ~1(I⊗G) and Vρ~0=ρ~1(J⊗I). Multiply the first by ρ~0U∗ on the left and trace out the first factor; multiply the second by ρ~0V∗ and trace out the second. The marginal identities yield ρ0=AG=CJ, where A=Tr⁡1(ρ~0U∗ρ~1) and C=Tr⁡2(ρ~0V∗ρ~1). Since ρ0 is invertible, both G and J are invertible.

5.1givenL1L4step 4.1algebra

Left-multiply the two summed equations of step 4.1 by ρ~1 and trace out the first factor in the first equation and the second in the second. The partial-trace adjoint identity and the local-factor multiplication rule in [L1] give A∗=ρ1G and C∗=ρ1J. Taking adjoints in ρ0=AG=CJ gives ρ0=Gρ1G=Jρ1J. For either positive operator G or J, conjugating this equation by ρ11/2 shows (ρ11/2Gρ11/2)2=ρ11/2ρ0ρ11/2, and likewise for J. Uniqueness of the positive square root [L4] therefore yields G=J.

5.2givenL4step 4.1algebra

The operators G=J=∑bαbEb are positive and invertible by step 4.1, so write G∣b⟩=gb∣b⟩ with each gb>0. Substituting G=J into step 4.1 and eliminating ρ~1 gives V∗Uρ~0=ρ~0(G−1⊗G). For w=ρ~0(∣b⟩⊗∣c⟩)≠0, this equation says the unitary V∗U has eigenvalue gc/gb>0 on w, whose modulus must be one. Hence gb=gc; when they differ, w=0.

6.1givenstep 5.1step 5.2algebra

For any b,b′ with gb≠gb′ and any c, either gc≠gb, in which case step 5.2 gives ρ~0∣b,c⟩=0, or gc=gb, in which case it gives ρ~0∣b′,c⟩=0. In the first case the column of ρ~0 vanishes; in the second its corresponding row vanishes because ρ~0 is self-adjoint. Therefore every summand in ⟨b′∣ρ0∣b⟩=∑c⟨b′,c∣ρ~0∣b,c⟩ is zero. Thus [G,ρ0]=0. Since ρ0=Gρ1G from step 5.1, ρ1=G−1ρ0G−1 also commutes with ρ0.

7.1givenL1L6L7algebra∎

Conversely, diagonalize ρ0 in an orthonormal basis by [L6]. Commutation makes each eigenspace invariant under ρ1; the restriction of the self-adjoint ρ1 to each eigenspace has an orthonormal eigenbasis by [L6]. Combining them gives a common orthonormal eigenbasis (∣j⟩). Define Kj=∣j,j⟩⟨j∣ and B(X)=∑jKjXKj∗. By [L7], Kj∗Kj=∣j⟩⟨j∣, so the basis identity gives ∑jKj∗Kj=I; [L6] therefore makes B completely positive and trace-preserving, hence a channel. For either diagonal state ρs=∑jλs,j∣j⟩⟨j∣, B(ρs)=∑jλs,j∣j,j⟩⟨j,j∣, whose two marginals are both ρs. This proves the reverse direction.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Singular Pair No Broadcasting

Statement

For any two density operators ρ0,ρ1 on a nonzero finite-dimensional H, one channel broadcasts both if and only if [ρ0,ρ1]=0.

Facts & Assumptions

Given: States ρ0,ρ1 on H and, for necessity, a common channel B broadcasting both.

[L1]

A broadcaster is one channel whose two partial-trace marginals equal each input; density operators are nonnegative and trace one (Broadcasting Family, Finite-dimensional quantum channel, Density operator, Partial trace over a finite tensor factor).

[L2]

A faithful state σ on a finite-dimensional support dominates each positive X on that support up to a finite scalar (Faithful State Dominates Positive Operator).

[L3]

If both marginals of a positive joint operator are supported on S, then the joint operator is supported on S⊗S (Positive Marginals Imply Joint Support).

[L4]

Complete positivity means every finite amplification preserves nonnegativity; composing those amplifications with isometric inclusions and orthogonal compressions preserves nonnegativity. Positive square roots exist (Completely positive maps, A non-negative operator has a unique non-negative square root, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

[L5]

The full-rank pair theorem gives commutation for broadcastable faithful states on any nonzero finite-dimensional support (Full Rank Pair No Broadcasting).

[F2]

A finite Kraus sum is completely positive and trace-preserving exactly when ∑jKj∗Kj=I; the rank-one operator ∣x⟩⟨y∣ acts as z↦⟨z,y⟩x (A finite Kraus sum is completely positive, Trace preservation is Kraus normalization, Dirac Notation Conversion).

[F3]

Every self-adjoint finite-dimensional operator is a difference of its nonnegative positive and negative spectral parts; every operator is the sum of a self-adjoint operator and i times a self-adjoint operator (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

Proof

1.1givenL1L4algebra

Let S=supp⁡(ρ0)+supp⁡(ρ1), the linear span of the two supports. It is nonzero. Set σ=(ρ0+ρ1)/2. For x∈S, ⟨(ρ0+ρ1)x,x⟩=0 implies both nonnegative terms vanish, hence x lies in both kernels and is orthogonal to S, so x=0. Therefore σ is positive definite on S; it has trace one and support S. By linearity, B(σ) has both marginals equal to σ.

2.1givenL2L3L4step 1.1algebra

For any nonnegative X on S, faithfulness in step 1.1 and [L2] give 0≤X≤cσ for some finite c. Positivity of B yields 0≤B(X)≤cB(σ). By [L3], B(σ) is supported on S⊗S. If 0≤A≤C and x∈ker⁡C, then 0≤⟨Ax,x⟩≤⟨Cx,x⟩=0. Thus ∥A1/2x∥2=0, so Ax=0 and ker⁡C⊆ker⁡A; taking orthogonal complements gives supp⁡A⊆supp⁡C. Applying this to A=B(X) shows B(X) is supported on S⊗S.

3.1givenL1L4L5F3step 1.1step 2.1algebra

Nonnegative operators span L(S) over C by [F3]. Therefore step 2.1 shows B(X) is supported on S⊗S for every X∈L(S). Define B~:L(S)→L(S⊗S) by restricting the input and identifying each supported output with its compression to S⊗S. For each finite amplification, the input inclusion and output compression preserve nonnegativity, so B~ is completely positive by [L4]. In an orthonormal basis of H extending one of S, the embedded input has X as its S-block and zero elsewhere, so its trace is tr⁡X; output compression leaves the supported B(X) unchanged. Thus B~ is trace-preserving and a channel by [L1]. It broadcasts the restrictions of ρ0,ρ1 on S. For fixed 0<ε<1, the states τi=(1−ε)ρi+εσ are faithful on S and are broadcast by B~. By [L5], [τ0,τ1]=0. Direct expansion using σ=(ρ0+ρ1)/2 gives [τ0,τ1]=(1−ε)[ρ0,ρ1]; since 1−ε≠0, the original states commute.

4.1givenL1F1F2step 3.1algebrachoose∎

Suppose [ρ0,ρ1]=0. Choose an orthonormal eigenbasis of ρ0 by [F1] and group it into its finitely many eigenspaces Sλ. For x∈Sλ, ρ0(ρ1x)=ρ1(ρ0x)=λρ1x, so Sλ is invariant under ρ1. The restriction of ρ1 to Sλ is self-adjoint, since ⟨ρ1x,y⟩=⟨x,ρ1y⟩ for x,y∈Sλ. Apply [F1] on each Sλ and combine these orthonormal eigenbases to obtain a common orthonormal basis (ej). Write ρi=∑jλi,j∣ej⟩⟨ej∣. The Kraus operators Kj=∣ej⊗ej⟩⟨ej∣ obey ∑jKj∗Kj=I. Their map B(X)=∑jKjXKj∗ is a channel by [F2]. It sends ρi to ∑jλi,j∣ej⊗ej⟩⟨ej⊗ej∣, whose two marginals are ρi. Thus the pair is broadcastable.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

State Family No Broadcasting Iff Commuting

Statement

Let S be any family, finite or infinite, of density operators on a nonzero finite-dimensional complex Hilbert space H. One common channel broadcasts every member of S if and only if every pair of members commutes.

Facts & Assumptions

Given: A nonzero finite-dimensional H and a family S⊆D(H), possibly empty.

[L1]

Broadcasting uses one channel and requires both marginals to equal each input (Broadcasting Family).

[L2]

Any pair of finite-dimensional states is jointly broadcastable only if it commutes (Singular Pair No Broadcasting). Its body is draft with open QC02/QC03 dependencies.

[L3]

A pairwise commuting family of diagonalizable endomorphisms on a finite-dimensional space has one common eigenbasis, including the empty family (A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise). The root supplier is published and states exactly this arbitrary-family interface.

[L4]

Density operators are self-adjoint and hence diagonalizable with real eigenvalues; finite-dimensional inner-product spaces have orthonormal bases (Density operator, Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, Every finite-dimensional real or complex inner product space has an orthonormal basis). The QC03 state carrier is a draft.

[L5]

A finite Kraus sum X↦∑jKjXKj∗ is completely positive (A finite Kraus sum is completely positive).

[L6]

The partial-trace characterization computes each marginal by tracing the corresponding tensor factor (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent); rank-one operators use the stated Dirac convention and tensor maps act on elementary tensors factorwise (Dirac Notation Conversion, Tensor products of finitely many linear maps).

Proof

1.1givenL1L2algebra

Suppose one channel broadcasts every member of S. For any ρ,σ∈S, the same channel broadcasts the pair, so [L2] gives [ρ,σ]=0. If S has fewer than two elements, pairwise commutation is vacuous or follows from [ρ,ρ]=0.

1.2givenL3L4algebra

Conversely, suppose all members commute pairwise. Each is diagonalizable by [L4], so [L3] gives a common eigenbasis (vj) (not assumed orthogonal). Group this finite basis by its joint eigenvalue tuples across S. If two tuples differ, some self-adjoint ρ∈S has distinct real eigenvalues on the corresponding vectors, and those vectors are orthogonal because ⟨ρv,w⟩=⟨v,ρw⟩ forces (λ−μ)⟨v,w⟩=0. Within each common eigenspace, choose an orthonormal basis by Gram–Schmidt; every ρ∈S acts there as one scalar, so the resulting orthonormal basis (ej) still diagonalizes every member. If S is empty, any orthonormal basis suffices.

2.1givenL1L5L6F1step 1.2algebra∎

Define Kj=∣ej⊗ej⟩⟨ej∣ and B(X)=∑jKjXKj∗. The map is completely positive by [L5]. Also Kj∗Kj=∣ej⟩⟨ej∣, so ∑jKj∗Kj=I; cyclicity [F1] gives tr⁡B(X)=tr⁡X for every X, hence B is a channel. For any ρ=∑jλj∣ej⟩⟨ej∣ in S, B(ρ)=∑jλj∣ej⊗ej⟩⟨ej⊗ej∣, and the partial-trace identity [L6] gives either marginal as ρ. The same channel works for every member, proving sufficiency.

5 · Examples, counterexamples and false statements

None yet.

Sources