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.

Quantum Information Measures

1 · Prerequisites

2 · Summary

This page defines finite-dimensional von Neumann entropy, support-sensitive quantum relative entropy, quantum mutual and conditional information, and classical-quantum ensembles under the library's linear-first inner-product convention and natural-log nats units. It proves the finite entropy identities and Holevo identity, joint convexity and partial-trace/channel data processing for quantum relative entropy, its nonnegativity with equality exactly for equal states, and the finite Holevo measurement bound. Conditional entropy and conditional mutual information are given as entropy-form definitions; no nonnegativity claim for either is included.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Finite-dimensional von Neumann entropy

Definition

Let H be a nonzero finite-dimensional complex inner-product space, with the root convention that its inner product is linear in the first argument, and let ρ be a density operator on H (Density operator). If λ1,…,λd are its eigenvalues counted with multiplicity, define its von Neumann entropy by

S(ρ):=−tr⁡(ρln⁡ρ):=−∑j:λj>0λjln⁡λj.

The trace is the finite-dimensional endomorphism trace (The basis-independent trace of an endomorphism of a finite-dimensional vector space), and the spectral definition makes the expression independent of the eigenbasis. The term for a zero eigenvalue is defined to be 0ln⁡0:=0. The default unit is nats, using the natural logarithm (The natural logarithm as the inverse of the exponential function); the entropy in bits is S2(ρ):=S(ρ)/ln⁡2.

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

Partial traces of a finite bipartite state are states

Statement

For nonzero finite-dimensional complex inner-product spaces HA,HB and a density operator ρAB on HA⊗HB, both marginals ρA:=Tr⁡BρAB and ρB:=Tr⁡AρAB are density operators.

Facts & Assumptions

Given: The spaces HA,HB and the state ρAB in the Statement.

[F1]

Density operator: a density operator is non-negative and has trace one.

[F2]

Partial trace over a finite tensor factor: in ordered orthonormal bases, (Tr⁡BR)ii′=∑jR(i,j),(i′,j).

[F3]

Partial trace over the first tensor factor: in ordered orthonormal bases, (Tr⁡AR)jj′=∑iR(i,j),(i,j′).

[F4]

The partial trace preserves non-negativity and total trace: the partial trace over a finite second tensor factor preserves non-negativity and total trace.

[F5]

Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.

[F6]

Ordered tensor registers, their inner product, and wire permutations: the product inner product and product basis respect the displayed tensor-factor order.

[F7]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F8]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in an ordered basis.

Proof

1.1givenF1F2F4

By the second-factor formula [F2] and the positivity/trace theorem [F4], ρA=Tr⁡BρAB is non-negative and has trace tr⁡(ρAB)=1. It is therefore a density operator by [F1].

1.2givenF1F3F5F6F7choosealgebra

Choose ordered orthonormal bases (ai) and (bj) of HA,HB by [F7]. Formula [F3] and the product inner product in [F6] give ⟨ρBy,y⟩=∑i⟨ρAB(ai⊗y),ai⊗y⟩ for every y∈HB; every summand is nonnegative by [F1] and [F5]. The matrix formula [F3] also shows ρB is self-adjoint because ρAB is self-adjoint. Hence ρB is non-negative.

2.1givenF1F3F8step 1.2algebra∎

Summing the diagonal entries in [F3] gives tr⁡(ρB)=∑i,j(ρAB)(i,j),(i,j)=tr⁡(ρAB)=1 by [F8] and [F1]. Therefore ρB is a density operator by [F1].

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

An orthogonal finite ensemble block sum is a density operator

Statement

Let X be a finite nonempty set, identify its labels with the computational orthonormal basis (ξx)x∈X of a register HX (Finite registers and their ordered computational bases), and define the orthogonal rank-one projection Πx:HX→HX by Πxz:=⟨z,ξx⟩ξx under the root linear-first convention. Let HB be a nonzero finite-dimensional complex inner-product space. For probabilities px≥0 with ∑x∈Xpx=1 and density operators ρx on HB, the operator

ρXB:=∑x∈XpxΠx⊗ρx

is a density operator on HX⊗HB.

Facts & Assumptions

Given: The finite label set X, the register HX, the space HB, the probability vector (px), and the density operators (ρx) in the Statement.

[F1]

Finite registers and their ordered computational bases: the computational vectors (ξx) form an orthonormal basis of their finite register.

[F2]

Density operator: each ρx is non-negative with trace one.

[F3]

Ordered tensor registers, their inner product, and wire permutations: the tensor product carries the product inner product and the displayed factor order.

[F5]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in any ordered basis.

Proof

1.1givenF1F2F3F4algebra

Every v∈HX⊗HB has a unique form v=∑x∈Xξx⊗vx. Orthonormality in [F1] and the product inner product in [F3] give ⟨ρXBv,v⟩=∑xpx⟨ρxvx,vx⟩≥0 by [F2]. In the same product basis ρXB is block diagonal with self-adjoint blocks pxρx, so it is self-adjoint and non-negative by [F4].

2.1givenF2F5step 1.1algebra∎

By [F5], tr⁡(ρXB)=∑xpxtr⁡(ρx)=∑xpx=1. Thus ρXB is a density operator by [F2].

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

Inverse compression for positive resolvents

Statement

Let H,K be finite-dimensional complex inner-product spaces, let T:K→K be positive definite, and let V:H→K satisfy V∗V=IH. For every s≥0,

V∗(T+sIK)−1V⪰(V∗TV+sIH)−1,

where A⪰B means that A−B is non-negative. If H={0}, both sides are the unique endomorphism of H.

Facts & Assumptions

Given: The spaces H,K, the positive definite operator T, the isometry V, and s≥0 in the Statement.

[F1]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, conjugate-linear in its second, and positive definite.

[F3]

Non-negative and positive operators: positive definiteness means self-adjointness and strictly positive quadratic form on nonzero vectors.

[F5]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

Proof

1.1givenF5F1F2F3algebra

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F5]. Let C be positive definite on a finite-dimensional space and y any vector. The operator C is injective by [F3], hence invertible in finite dimension; put z0=C−1y. Expanding with [F1]–[F2] gives 2Re⁡⟨y,z⟩−⟨Cz,z⟩=⟨C−1y,y⟩−⟨C(z−z0),z−z0⟩. The last term is nonnegative by [F3] and vanishes at z=z0, so ⟨C−1y,y⟩=max⁡z{2Re⁡⟨y,z⟩−⟨Cz,z⟩}.

2.1givenF2F3F4step 1.1algebra∎

If H={0} the assertion is immediate. Otherwise fix x∈H, put C=T+sIK and y=Vx. By [F2] and V∗V=IH, V∗CV=V∗TV+sIH, which is positive definite. Restrict the maximum in step 1.1 to z=Vw; the isometry identity gives ⟨Vx,Vw⟩=⟨x,w⟩ and ⟨CVw,Vw⟩=⟨(V∗TV+sIH)w,w⟩. Hence ⟨(T+sIK)−1Vx,Vx⟩≥⟨(V∗TV+sIH)−1x,x⟩. This holds for every x, so the self-adjoint operator difference is non-negative by [F4], proving the order inequality.

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

Nonnegativity and equality for finite classical relative entropy

Statement

For probability vectors p=(pi)i∈I and q=(qi)i∈I on a finite nonempty set I, define

D(p∥q):={∑i:pi>0piln⁡piqi,pi>0⇒qi>0,+∞,otherwise.

Then D(p∥q)≥0, and D(p∥q)=0 if and only if p=q.

Facts & Assumptions

Given: The finite set I and probability vectors p,q in the Statement.

[F1]

The natural logarithm as the inverse of the exponential function: ln⁡x is the inverse exponential on (0,∞).

[F2]

Proof

1.1givenF1F2F3F4casesalgebra

Set g(t)=t−1−ln⁡t for t>0. For t>1, [F3] and [F4] give g(t)−g(1)=g′(c)(t−1) for some c∈(1,t), where g′(c)=1−1/c>0; for 0<t<1, they give g(1)−g(t)=g′(c)(1−t) for some c∈(t,1), where g′(c)=1−1/c<0. Thus g(t)>0 unless t=1, when g(1)=0. Equivalently, −ln⁡t≥1−t, with equality only at t=1.

2.1givenstep 1.1algebracases∎

If pi>0=qi for some i, then D(p∥q)=+∞ by definition. Otherwise, for each i with pi>0, apply step 1.1 to t=qi/pi and multiply by pi, obtaining piln⁡(pi/qi)≥pi−qi. Summing gives D(p∥q)≥1−∑i:pi>0qi≥0. Equality forces qi=pi on the positive support by step 1.1 and no q-mass outside it by the final inequality; hence p=q. Conversely, p=q makes every summand zero.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

A finite POVM defines a classical-output quantum channel

Statement

Let H be a nonzero finite-dimensional complex inner-product space and let (Ey)y∈Ω be a finite POVM on H, where Ω={y0,…,ym−1} is a fixed enumeration of its nonempty outcome set. Let K=Cm with standard orthonormal basis (f0,…,fm−1), and set Πjz:=⟨z,fj⟩fj, the rank-one projection onto fj under the root linear-first convention. The map ME(X):=∑j<mtr⁡(XEyj)Πj is a quantum channel from H to K. For the indexed register CΩ with orthonormal basis ∣y⟩, the unitary identification Jfj=∣yj⟩ gives the equivalent channel X↦∑y∈Ωtr⁡(EyX)∣y⟩⟨y∣=JME(X)J∗. Thus either finite outcome-register convention is covered.

Facts & Assumptions

Given: The space H, the finite POVM, its enumeration, and the output register K in the Statement.

[F1]

Finite POVMs and their outcome law: each Ey is non-negative and ∑yEy=IH; the outcome weight on a state ρ is tr⁡(ρEy).

[F2]

A non-negative operator has a unique non-negative square root: every non-negative operator Ey has a non-negative square root Ey1/2.

[F3]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument and conjugate-linear in its second.

[F4]

Finite Kraus representation: a finite Kraus family represents Φ when Φ(X)=∑aKaXKa∗ for every input operator.

[F5]

Kraus and Choi characterizations of complete positivity: a finite Kraus representation implies complete positivity.

[F6]

Trace preservation is Kraus normalization: a finite Kraus representation is trace-preserving exactly when ∑aKa∗Ka=IH.

[F7]
[F8]

Finite-dimensional quantum channel: a finite-dimensional quantum channel is a complex-linear completely positive trace-preserving map on the full operator space.

[F9]
[F10]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F11]

Finite registers and their ordered computational bases: the specified output basis (fj) is orthonormal.

[F12]

Proof

1.1givenF12F2F3F9F10F11constructchoose

The adjoints used below exist uniquely by [F12]. Choose an ordered orthonormal basis (ek)k<d of H using [F10]. For each j<m and k<d, define Kjk:H→K by Kjkx=fj⟨Eyj1/2x,ek⟩. This is linear by the root convention in [F3]. Set Pkx:=⟨x,ek⟩ek. The adjoint identity [F9] and the output-basis orthonormality [F11] give Kjk∗z=⟨z,fj⟩Eyj1/2ek and therefore Kjk∗Kjk=Eyj1/2PkEyj1/2.

2.1givenF1F2F6step 1.1algebra

Since (ek) is a basis, ∑kPk=IH. Using step 1.1 and the completeness relation in [F1], ∑j,kKjk∗Kjk=∑jEyj1/2(∑kPk)Eyj1/2=∑jEyj=IH. Thus the finite family is trace-preserving by [F6].

3.1givenF4F6F5F7F8F11step 1.1step 2.1algebra∎

For each fixed j, the fj output diagonal entry of ∑kKjkXKjk∗ is ∑k⟨Eyj1/2XEyj1/2ek,ek⟩=tr⁡(Eyj1/2XEyj1/2). By trace cyclicity [F7], this is tr⁡(XEyj), and all off-diagonal output entries vanish because each Kjk has range in Cfj and [F11] makes the output basis orthonormal. Summing over j yields ME, so it has the finite Kraus representation [F4] and is completely positive by [F5]. Together with steps 1.1 and 2.1 it is a quantum channel by [F8]. The coordinate map Jfj=∣yj⟩ is unitary because it carries one orthonormal basis onto the other; replacing each Kraus map by JKjk preserves its normalization and complete positivity by [F5]–[F6]. The conjugated output is ∑jtr⁡(XEyj)∣yj⟩⟨yj∣=∑ytr⁡(EyX)∣y⟩⟨y∣ by [F7], proving the indexed-register clause.

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

Finite-dimensional quantum relative entropy

Definition

Let H be a finite-dimensional complex inner-product space and let A,B:H→H be non-negative operators. For such an operator A, set supp⁡(A):=(ker⁡A)⊥, where ker⁡A is the kernel of a linear map (Kernel and image of a linear map); this extends the density-operator support convention in Density operator. If supp⁡(A)⊆supp⁡(B), define

D(A∥B):=tr⁡(Aln⁡A)−tr⁡(Aln⁡B).

Here ln⁡A is defined spectrally on the positive eigenspaces of A with 0ln⁡0:=0, and ln⁡B in the cross term is restricted to supp⁡(B); the support condition ensures that A vanishes on ker⁡B, so the omitted kernel contributes zero. If supp⁡(A)⊈supp⁡(B), set D(A∥B):=+∞. In particular, D(0∥B)=0. For density operators this is the finite-dimensional quantum relative entropy. The logarithms are natural, so the value is in nats; the base-two value is D2(A∥B):=D(A∥B)/ln⁡2.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite quantum mutual, conditional, and conditional mutual information

Definition

For a finite bipartite state ρAB on the ordered product HA⊗HB, write ρA=Tr⁡BρAB and ρB=Tr⁡AρAB, using the partial traces in Partial trace over a finite tensor factor and Partial trace over the first tensor factor. They are states by Partial traces of a finite bipartite state are states. Define

S(A)ρ:=S(ρA),S(A∣B)ρ:=S(ρAB)−S(ρB),I(A:B)ρ:=S(ρA)+S(ρB)−S(ρAB).

For a finite tripartite state ρABC on the ordered product HA⊗HB⊗HC, set ρAB:=Tr⁡HCρABC after identifying the factors as (HA⊗HB)⊗HC, and ρBC:=Tr⁡HAρABC after identifying them as HA⊗(HB⊗HC). Let P:HA⊗HB⊗HC→HA⊗HC⊗HB be the wire permutation taking factor order A,B,C to A,C,B (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations) whose unique adjoint P∗ exists by Every linear map between finite-dimensional inner product spaces has a unique adjoint, and set ρAC:=Tr⁡HB(PρABCP∗), tracing out the last factor. Because P is unitary, PρABCP∗ is a state: unitary conjugation preserves non-negativity by the adjoint identity (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Non-negative and positive operators) and preserves trace by cyclicity (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)). Finally set ρC:=Tr⁡HBρBC. All these marginals are density operators by applying Partial traces of a finite bipartite state are states after grouping factors. Define

I(A:B∣C)ρ:=S(ρAC)+S(ρBC)−S(ρC)−S(ρABC).

These are finite-dimensional definitions only; no non-negativity of conditional entropy or conditional mutual information is part of the notation.

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

The compression Jensen inequality for the negative logarithm

Statement

Let H,K be finite-dimensional complex inner-product spaces, let T:K→K be positive definite, and let V:H→K satisfy V∗V=IH. Then, in the non-negative operator order,

−ln⁡(V∗TV)⪯V∗(−ln⁡T)V,

where R⪯S means S−R is non-negative and logarithms of positive-definite operators are defined by finite spectral calculus.

Facts & Assumptions

Given: H,K,T,V as in the Statement.

[F1]

Inverse compression for positive resolvents: V∗(T+sIK)−1V⪰(V∗TV+sIH)−1 for every s≥0.

[F3]

Non-negative and positive operators: a non-negative operator is self-adjoint with nonnegative quadratic form.

[F4]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is continuous on positive reals, has ln⁡1=0, and obeys ln⁡(u/v)=ln⁡u−ln⁡v.

[F5]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: every real continuous function on a compact interval is Riemann integrable.

[F6]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): an everywhere differentiable primitive on a closed interval, including one-sided endpoint derivatives, with integrable derivative has derivative integral equal to its endpoint increment.

[F7]

Proof

1.1givenF2F4F5F6F7algebra

For t>0 and R>0, set Ft(s)=ln⁡(t+s)−ln⁡(1+s) on s>−min⁡(t,1). Translated difference quotients in [F2] give Ft′(s)=(t+s)−1−(1+s)−1, including the one-sided derivatives on [0,R]. For s,u∈[0,R], ∣(t+s)−1−(t+u)−1∣≤∣s−u∣/t2 and ∣(1+s)−1−(1+u)−1∣≤∣s−u∣, so the derivative is continuous and integrable by [F5]. Thus [F6] and [F4] give ∫0R((t+s)−1−(1+s)−1) ds=ln⁡((t+R)/(1+R))−ln⁡t. As R→∞, the quotient tends to 1, so [F4] gives the limit −ln⁡t (also when t=1). Applying this scalar identity to each of the finitely many positive eigenvalues in [F7] yields the corresponding operator integral identity in norm, since the maximum of finitely many scalar errors tends to zero. On a zero-dimensional space the empty spectral formula is the unique endomorphism, so the same assertion is vacuous and valid.

2.1givenF1F3step 1.1algebra∎

Since V∗V=IH and T is positive definite, V∗TV is positive definite on nonzero H: for x≠0, Vx≠0 and ⟨V∗TVx,x⟩=⟨TVx,Vx⟩>0. Apply [F1] at each s≥0. Subtracting (1+s)−1IH preserves the order inequality. For every x, integrating the resulting quadratic-form inequality over [0,R] gives a non-negative quadratic form; the operator norm limits as R→∞ exist by step 1.1, and the limit remains non-negative because quadratic forms are continuous. The limit is −ln⁡(V∗TV)⪯V∗(−ln⁡T)V, as required.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite classical-quantum states and Holevo information

Definition

Let X be a finite nonempty classical label set, represented by a register HX with computational orthonormal basis (ξx)x∈X (Finite registers and their ordered computational bases). For each x, write Πxz:=⟨z,ξx⟩ξx, the rank-one orthogonal projection using the root linear-first convention, as in An orthogonal finite ensemble block sum is a density operator. Let HB be a nonzero finite-dimensional complex inner-product space. A finite classical-quantum state is

ρXB:=∑x∈XpxΠx⊗ρx,

where px≥0, ∑xpx=1, and each ρx is a density operator on HB. It is a density operator by An orthogonal finite ensemble block sum is a density operator. Its quantum marginal is ρˉB:=∑xpxρx=Tr⁡XρXB by the first-factor partial-trace formula in Partial trace over the first tensor factor, and it is a density operator by Partial traces of a finite bipartite state are states. The Holevo information of this ensemble is

χ({px,ρx}x∈X):=S(ρˉB)−∑x:px>0pxS(ρx),

where zero-probability branches contribute nothing. This is measured in nats under Finite-dimensional von Neumann entropy.

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

Joint state support is contained in the tensor product of its marginal supports

Statement

For a state ρAB on a finite-dimensional bipartite space, with marginals ρA=Tr⁡BρAB and ρB=Tr⁡AρAB,

supp⁡(ρAB)⊆supp⁡(ρA)⊗supp⁡(ρB)=supp⁡(ρA⊗ρB).

Consequently D(ρAB∥ρA⊗ρB) is finite.

Facts & Assumptions

Given: A finite-dimensional bipartite density operator ρAB and the partial traces in the Statement.

[F1]

Finite-dimensional quantum relative entropy: for every non-negative operator R, supp⁡(R)=(ker⁡R)⊥; support inclusion is the finiteness condition for D.

[F2]

Partial trace over a finite tensor factor: the second-factor marginal has entries (ρA)ii′=∑j(ρAB)(i,j),(i′,j).

[F3]

Partial trace over the first tensor factor: the first-factor marginal has entries (ρB)jj′=∑i(ρAB)(i,j),(i,j′).

[F4]

Partial traces of a finite bipartite state are states: both marginals are density operators.

[F5]
[F7]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

Proof

1.1givenF1F2F5F7choosealgebra

Choose an orthonormal basis (bj) of HB using [F7]. If u∈ker⁡ρA, then [F2] gives 0=⟨ρAu,u⟩=∑j⟨ρAB(u⊗bj),u⊗bj⟩. Every term is nonnegative by [F1], so every term is zero. By [F5], write ρAB=S∗S; a zero quadratic form then gives S(u⊗bj)=0 and hence ρAB(u⊗bj)=0. Since (bj) spans HB, ρAB annihilates ker⁡ρA⊗HB.

1.2givenF1F3F5F7choosealgebra

Choose an orthonormal basis (ai) of HA using [F7]. If v∈ker⁡ρB, then [F3] similarly gives 0=⟨ρBv,v⟩=∑i⟨ρAB(ai⊗v),ai⊗v⟩. Positivity and [F5] show that ρAB annihilates HA⊗ker⁡ρB.

2.1F1F4F6step 1.1step 1.2algebra∎

Self-adjointness of ρAB implies its range is orthogonal to both subspaces annihilated in steps 1.1 and 1.2. Using the orthogonal decompositions HA=supp⁡(ρA)⊕ker⁡ρA and HB=supp⁡(ρB)⊕ker⁡ρB, the intersection of their orthogonal complements is supp⁡(ρA)⊗supp⁡(ρB). For non-negative ρAB its range equals its support by [F6]. The product spectral decomposition also gives supp⁡(ρA⊗ρB)=supp⁡(ρA)⊗supp⁡(ρB). Hence the stated inclusion holds, and [F1] makes the divergence finite.

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

Relative modular representation of finite quantum relative entropy

Statement

Let A,B be positive-definite operators on a nonzero finite-dimensional complex inner-product space H. On L(H), with Hilbert-Schmidt inner product ⟨X,Y⟩HS:=tr⁡(XY∗), define ΔB,A(X):=BXA−1. Then ΔB,A is positive definite and

D(A∥B)=⟨(−ln⁡ΔB,A)(A1/2),A1/2⟩HS.

The logarithm of ΔB,A is defined by its positive eigenvalues.

Facts & Assumptions

Given: H,A,B as in the Statement.

[F1]

Finite-dimensional quantum relative entropy: for positive-definite A,B, D(A∥B)=tr⁡(Aln⁡A)−tr⁡(Aln⁡B).

[F3]

A non-negative operator has a unique non-negative square root: A has a positive-definite square root A1/2.

[F5]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument and conjugate-linear in its second, so Ejix=⟨x,ui⟩vj is linear.

[F6]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

[F7]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: the adjoint is characterized by ⟨Tx,y⟩=⟨x,T∗y⟩.

[F8]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive real x,y, ln⁡(x/y)=ln⁡x−ln⁡y.

Proof

1.1givenF6F7F8F2F5algebrachoose

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F6]. Choose orthonormal eigenbases (ui) and (vj) for A and B, with Aui=aiui, Bvj=bjvj and ai,bj>0, using [F2]. For each i,j define Ejix:=⟨x,ui⟩vj. These linear matrix units form an orthonormal basis of L(H) for ⟨⋅,⋅⟩HS by the adjoint pairing [F7] and direct trace evaluation. They satisfy BEji=bjEji and EjiA−1=ai−1Eji, so ΔB,AEji=(bj/ai)Eji. The quotient law [F8] gives −ln⁡(bj/ai)=−ln⁡bj+ln⁡ai, so spectral calculus on this basis shows that ΔB,A is positive definite and gives (−ln⁡ΔB,A)(X)=−(ln⁡B)X+X(ln⁡A).

2.1F1F3F4step 1.1algebra∎

Applying the formula in step 1.1 to A1/2 gives ⟨(−ln⁡ΔB,A)(A1/2),A1/2⟩HS=tr⁡(−Aln⁡B+A1/2(ln⁡A)A1/2). By trace cyclicity [F4], the second trace is tr⁡(Aln⁡A). The result equals D(A∥B) by [F1], proving the identity.

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

Support-sensitive regularization limit for quantum relative entropy

Statement

For non-negative A,B on a finite-dimensional complex inner-product space,

lim⁡ε↓0D(A+εI∥B+εI)=D(A∥B),

where the right side may be +∞ under the support convention of Finite-dimensional quantum relative entropy.

Facts & Assumptions

Given: The finite-dimensional non-negative operators A,B in the Statement.

[F1]

Finite-dimensional quantum relative entropy: D(A∥B) is finite exactly when supp⁡(A)⊆supp⁡(B), and on that branch it is the difference of the two spectral logarithmic traces.

[F3]

A non-negative operator has a unique non-negative square root: ⟨Av,v⟩=∥A1/2v∥2, so zero quadratic form for a non-negative operator implies it annihilates the vector.

[F4]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is strictly increasing and onto R. For every real M, choose u>0 with ln⁡u<M; then 0<t<u implies ln⁡t<M, so ln⁡t→−∞ as t↓0.

[F5]

The natural logarithm is bounded above by its positive argument minus one: for x≥1, 0≤ln⁡x≤x−1.

Proof

1.1givenF1F2F4F5algebrachoose

First suppose supp⁡(A)⊆supp⁡(B), so ker⁡B⊆ker⁡A. Choose an orthonormal eigenbasis (ej) of B with eigenvalues bj≥0, and put aj:=⟨Aej,ej⟩≥0. If bj=0, then ej∈ker⁡A, so aj=0, and therefore tr⁡(Aln⁡(B+εI))=∑j:bj>0ajln⁡(bj+ε)→tr⁡(Aln⁡B). Also εtr⁡(ln⁡(B+εI))→0: positive bj terms use continuity, while zero bj terms use εln⁡ε→0. The latter follows from [F5]: for 0<t≤1, put u=t−1/2≥1. Then 0≤−tln⁡t=2tln⁡u≤2t(u−1)=2(t−t)→0 by applying the bound to u. The same limit gives tln⁡t→0 at zero, so tr⁡((A+εI)ln⁡(A+εI))→tr⁡(Aln⁡A). Substituting these limits in the definition proves the claim in this support-inclusion case.

2.1givenF1F2F3F4F5step 1.1algebrachoose∎

Now suppose supp⁡(A)⊈supp⁡(B). There is a unit vector e∈ker⁡B∖ker⁡A, so a:=⟨Ae,e⟩>0 by [F3]. Choose an orthonormal eigenbasis of B containing a basis (uk) of ker⁡B. At least one coefficient ⟨Auk,uk⟩ is positive: otherwise [F3] would give Auk=0 for every k, hence Ae=0. Therefore the sum c:=∑k⟨Auk,uk⟩ is positive. In tr⁡(Aln⁡(B+εI)), this coefficient multiplies ln⁡ε→−∞, while terms from positive eigenvalues of B remain bounded. The entropy trace tr⁡((A+εI)ln⁡(A+εI)) has a finite limit as in step 1.1, and the additional εtr⁡(ln⁡(B+εI)) tends to zero by [F4]–[F5]. Therefore the relative entropy tends to +∞, equal to the right side of the Statement.

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

Isometric invariance of finite quantum relative entropy

Statement

Let V:H→K be a linear map between finite-dimensional complex inner-product spaces satisfying V∗V=IH, and let A,B be non-negative on H. Then

D(VAV∗∥VBV∗)=D(A∥B).

Facts & Assumptions

Given: V,A,B as in the Statement.

[F1]

Finite-dimensional quantum relative entropy: support inclusion determines the finite branch of D; its value is computed from spectral logarithms on the supports.

[F2]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: V∗V=IH implies ⟨Vx,Vy⟩=⟨x,y⟩ for every x,y∈H.

[F4]
[F5]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

Proof

1.1givenF5F2F3algebra

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F5]. Let M=ran⁡V. Since V is an isometry, it maps an orthonormal eigenbasis of A to an orthonormal eigenbasis of VAV∗ on M with the same nonzero eigenvalues; VAV∗ is zero on M⊥. The same holds for B. Consequently supp⁡(VAV∗)=V(supp⁡A) and supp⁡(VBV∗)=V(supp⁡B), so support inclusion holds on one side exactly when it holds on the other.

2.1givenF1F3F4step 1.1casesalgebra∎

On M, spectral calculus gives ln⁡(VAV∗)=V(ln⁡A)V∗ on the positive support of A, with the analogous identity for B; on M⊥ both conjugated operators contribute zero to the support-restricted traces. Thus in the finite branch, cyclicity [F4] gives tr⁡(VAV∗ln⁡(VAV∗))=tr⁡(Aln⁡A) and tr⁡(VAV∗ln⁡(VBV∗))=tr⁡(Aln⁡B). By [F1] their difference is D(A∥B). If support inclusion fails, step 1.1 shows both sides are +∞ by [F1].

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

Finite quantum conditional mutual information identity

Statement

For every finite-dimensional tripartite state ρABC, the entropy-form conditional mutual information defined in Finite quantum mutual, conditional, and conditional mutual information satisfies

I(A:B∣C)ρ=I(A:BC)ρ−I(A:C)ρ.

This is an algebraic identity; it asserts no non-negativity.

Facts & Assumptions

Given: A finite-dimensional tripartite density operator ρABC with the marginal conventions in Finite quantum mutual, conditional, and conditional mutual information.

[F1]

Finite quantum mutual, conditional, and conditional mutual information: I(A:B∣C)=S(AC)+S(BC)−S(C)−S(ABC) and I(A:B)=S(A)+S(B)−S(AB).

Proof

1.1givenF1

By [F1], I(A:BC)ρ=S(A)ρ+S(BC)ρ−S(ABC)ρ.

2.1givenF1step 1.1algebra∎

Also by [F1], I(A:C)ρ=S(A)ρ+S(C)ρ−S(AC)ρ. Subtracting this from step 1.1 cancels S(A)ρ and gives S(AC)ρ+S(BC)ρ−S(C)ρ−S(ABC)ρ, which is I(A:B∣C)ρ by [F1]. No inequality or non-negativity premise is used.

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

Joint convexity of finite quantum relative entropy

Statement

Let H be a finite-dimensional complex inner-product space, let n≥1, let Ai,Bi:H→H be non-negative for 1≤i≤n, and let λi≥0 with ∑iλi=1. Then, in the extended-real order,

D ⁣(∑iλiAi ∥ ∑iλiBi)≤∑iλiD(Ai∥Bi),

where zero-weight terms are omitted from the right side, and the order is that on the extended real line.

Facts & Assumptions

Given: H, the finite families (Ai),(Bi) and the probability vector (λi) in the Statement.

[F1]

Finite-dimensional quantum relative entropy: for non-negative operators, D is finite under support inclusion and uses natural spectral logarithms; otherwise it is +∞.

[F2]

The compression Jensen inequality for the negative logarithm: −ln⁡(V∗TV)⪯V∗(−ln⁡T)V for positive-definite T and an isometry V.

[F3]

Relative modular representation of finite quantum relative entropy: for positive-definite A,B, D(A∥B)=⟨(−ln⁡ΔB,A)(A1/2),A1/2⟩HS with ΔB,A(X)=BXA−1.

[F4]

Support-sensitive regularization limit for quantum relative entropy: D(A+εI∥B+εI)→D(A∥B) as ε↓0, including the infinite support-failure branch.

[F6]

A non-negative operator has a unique non-negative square root: each positive-definite A has a positive-definite square root A1/2, hence an inverse square root.

[F7]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: Ui∗ is characterized by ⟨UiX,Y⟩=⟨X,Ui∗Y⟩.

[F8]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

Proof

1.1givenF8F1F5F6F7algebracasesconstruct

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F8]. Discard all indices with λi=0 from both sides; at least one index remains because the weights sum to one. The remaining weights are strictly positive and still sum to one. If H={0}, all operators and relative entropies are zero by [F1], so the result holds. Now assume H≠{0} and first suppose every Ai,Bi is positive definite. Set A=∑iλiAi and B=∑iλiBi. Positive-definite square roots and inverse square roots exist by [F6]. On the Hilbert-Schmidt spaces, with direct-sum inner product, define Ui(X):=λiXA−1/2Ai1/2 and U(X):=(Ui(X))i. Trace cyclicity [F5] and the adjoint definition [F7] in ⟨Ui(X),Y⟩HS give Ui∗(Y)=λiYAi1/2A−1/2. Therefore U∗U(X)=XA−1/2(∑iλiAi)A−1/2=X, so U is an isometry.

2.1givenF2F3F6step 1.1algebra

Put T:=⨁iΔBi,Ai, positive definite by [F3]. For each i, multiplication gives Ui∗ΔBi,AiUi(X)=λiBiXA−1, hence U∗TU(X)=BXA−1=ΔB,A(X); also U(A1/2)=(λiAi1/2)i by [F6]. Apply [F2] to U,T and evaluate the order inequality on A1/2 in the Hilbert-Schmidt inner product. Using [F3] on both sides yields D(A∥B)≤∑iλiD(Ai∥Bi).

3.1givenF1F4step 2.1algebracases∎

For general non-negative Ai,Bi, if some D(Ai∥Bi)=+∞, the right side is +∞ and the claim holds. Otherwise each supp⁡(Ai)⊆supp⁡(Bi). If v∈ker⁡B, where B=∑iλiBi, then 0=⟨Bv,v⟩=∑iλi⟨Biv,v⟩ forces Biv=0 for every i; support inclusion then gives Aiv=0, so Av=0. Thus supp⁡(A)⊆supp⁡(B). Apply the positive-definite case to Ai+εI,Bi+εI; their weighted sums are A+εI,B+εI. Let ε↓0 and use [F4] for every term to obtain the desired inequality.

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

Finite quantum mutual information identities and the Holevo identity

Statement

For a finite-dimensional bipartite state ρAB,

I(A:B)ρ=S(ρA)+S(ρB)−S(ρAB)=D(ρAB∥ρA⊗ρB).

For a finite classical-quantum state ρXB=∑xpxΠx⊗ρx, its mutual information equals its Holevo information:

I(X:B)ρ=S ⁣(∑xpxρx)−∑x:px>0pxS(ρx)=χ({px,ρx}).

Facts & Assumptions

Given: The finite-dimensional states in the Statement, with the root linear-first convention.

[F1]

Finite quantum mutual, conditional, and conditional mutual information: I(A:B)ρ=S(ρA)+S(ρB)−S(ρAB) and I(X:B)ρ=S(ρX)+S(ρB)−S(ρXB).

[F2]

Finite-dimensional quantum relative entropy: on support inclusion, D(A∥B)=tr⁡(Aln⁡A)−tr⁡(Aln⁡B) with support-restricted spectral logarithms.

[F3]

Joint state support is contained in the tensor product of its marginal supports: supp⁡(ρAB)⊆supp⁡(ρA⊗ρB), so the QRE in the Statement is finite.

[F4]

Finite classical-quantum states and Holevo information: ρXB=∑xpxΠx⊗ρx, ρB=∑xpxρx, and χ=S(ρB)−∑px>0pxS(ρx).

[F5]

The partial trace is characterized by the trace pairing and is basis-independent: tr⁡((Tr⁡BR)T)=tr⁡(R(T⊗IB)).

[F6]

Partial trace over the first tensor factor: Tr⁡A is the first-factor partial trace and has entries (Tr⁡AR)jj′=∑iR(i,j),(i,j′).

[F7]

Partial trace over a finite tensor factor: the second-factor partial trace has entries (Tr⁡BR)ii′=∑jR(i,j),(i′,j).

[F8]

Ordered tensor registers, their inner product, and wire permutations: tensor product bases retain the displayed factor order and use the product inner product.

[F10]

Finite-dimensional von Neumann entropy: entropy is −tr⁡(Rln⁡R), with zero-eigenvalue terms omitted.

Proof

1.1givenF2F3

By [F3], the support condition in [F2] holds for ρAB and ρA⊗ρB, so the relative entropy is evaluated by its finite trace formula.

2.1givenF2F8F9F11step 1.1algebrachoose

Choose orthonormal eigenbases of the marginals using [F9], with positive eigenvalues ai for ρA on its support and bj for ρB on its support. Their product vectors form an orthonormal eigenbasis of ρA⊗ρB on its support by [F8], with eigenvalues aibj>0. Since [F11] gives ln⁡(aibj)=ln⁡ai+ln⁡bj, spectral calculus gives ln⁡(ρA⊗ρB)=(ln⁡ρA)⊗IB+IA⊗(ln⁡ρB) on that support.

3.1F1F2F3F5F6step 2.1algebra

Extend each marginal logarithm by zero on its kernel, which does not affect the support-restricted traces by [F2] and [F3]. Taking T=ln⁡ρA in [F5] gives tr⁡(ρAB((ln⁡ρA)⊗IB))=tr⁡(ρAln⁡ρA). For the second marginal, expanding the finite product-basis trace and using the entries in [F6] gives tr⁡(ρAB(IA⊗ln⁡ρB))=tr⁡(ρBln⁡ρB). Combining these identities with [F2] and step 2.1 yields D(ρAB∥ρA⊗ρB)=S(ρA)+S(ρB)−S(ρAB)=I(A:B)ρ.

4.1givenF1F4F7F9F10F11step 2.1algebra∎

In the orthogonal blocks of ρXB, the eigenvalues are pxλxj, where λxj are the eigenvalues of ρx; zero-probability blocks contribute only zeros. By [F7] and tr⁡ρx=1, ρX=∑xpxΠx; its eigenvalues are (px), and the B-marginal is ρˉB=∑xpxρx by [F4]. The block eigenvalues follow from [F9]. For px>0 and λxj>0, applying [F11] and expanding −(pxλxj)ln⁡(pxλxj) and using ∑jλxj=1 gives S(ρXB)=S(ρX)+∑x:px>0pxS(ρx) by [F10]. Substitution into the definition [F1] cancels S(ρX) and proves I(X:B)ρ=χ({px,ρx}).

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

Partial-trace data processing for finite quantum relative entropy

Statement

Let HA,HB be nonzero finite-dimensional complex inner-product spaces, let d=dim⁡HB≥1, and let A,B be non-negative operators on HA⊗HB. Then

D(Tr⁡BA∥Tr⁡BB)≤D(A∥B).

Facts & Assumptions

Given: The spaces and non-negative operators in the Statement.

[F1]

Joint convexity of finite quantum relative entropy: QRE is jointly convex for finite convex mixtures of non-negative operators.

[F2]

Isometric invariance of finite quantum relative entropy: QRE is invariant under simultaneous isometric conjugation.

[F3]

Partial trace over a finite tensor factor: in product bases, (Tr⁡BR)ii′=∑jR(i,j),(i′,j).

[F4]

The partial trace preserves non-negativity and total trace: the partial trace preserves non-negativity and total trace.

[F5]

Ordered tensor registers, their inner product, and wire permutations: ordered product bases and their inner products retain the stated factor order.

[F6]

Finite-dimensional quantum relative entropy: QRE uses support inclusion and the support-restricted spectral logarithms; if inclusion fails its value is +∞.

[F8]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F9]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, so z↦⟨z,es⟩er is linear.

[F10]

Complex de Moivre formula for every integer exponent: for every integer m and real t, (cos⁡t+isin⁡t)m=cos⁡(mt)+isin⁡(mt).

[F12]

exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: for real t, exp⁡(it)=cos⁡t+isin⁡t and ∣exp⁡(it)∣=1.

[F13]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive x,y, ln⁡(x/y)=ln⁡x−ln⁡y, with ln⁡1=0.

Proof

1.1givenF3F5F8F9F10F11F12constructchoosealgebra

Choose an orthonormal basis (ej)j<d of HB using [F8], and set ω=exp⁡(2πi/d). By [F10] and [F12], ∣ω∣=1 and ωm=exp⁡(2πim/d) for every integer m; by [F11], ωm=1 exactly when d divides m. Thus ω has order d. Define Xej=ej+1 mod d and Zej=ωjej; these maps are unitary because they respectively permute the basis and multiply its vectors by unit-modulus scalars. If d∤m, then q=ωm≠1, qd=1, and (1−q)∑b=0d−1qb=1−qd=0, so d−1∑b=0d−1ωbm=0; if d∣m, that average is 1. Choose an orthonormal basis (ui) of HA by [F8]. For 0≤r,s<d, define the linear block Rrs:HA→HA by Rrsui′=∑i⟨R(ui′⊗es),ui⊗er⟩ui, extending linearly. Expanding R(ui′⊗es) in the product basis [F5] then gives R=∑r,sRrs⊗Mrs, where Mrsz:=⟨z,es⟩er: both sides agree on every product basis vector. Direct application to basis vectors gives ZbMrs(Zb)∗=ωb(r−s)Mrs and XaMrs(Xa)∗=Mr+a,s+a, with indices modulo d. For 0≤r,s<d, d∣(r−s) exactly when r=s, so the proved phase average removes precisely the off-diagonal units. Also d−1∑a=0d−1Mr+a,r+a=IB/d. Therefore T(R):=d−2∑a,b(IA⊗XaZb)R(IA⊗XaZb)∗=∑rRrr⊗IB/d=Tr⁡B(R)⊗IB/d by [F3]. For every a,b, the lifted map IA⊗XaZb sends ui⊗ej to ωbjui⊗ej+a, hence sends an orthonormal product basis to an orthonormal product basis; it is therefore unitary, including d=1. When d=1, X=Z=IB and there is only the diagonal unit, so the same formula holds directly.

1.2givenF6F7F13algebra

For non-negative C,D on HA, their tensor products with IB/d have supports supp⁡(C)⊗HB and supp⁡(D)⊗HB by the tensor-product eigenbases [F7]. Thus support inclusion holds for (C,D) exactly when it holds for (C⊗IB/d,D⊗IB/d). In the finite branch, each positive tensor eigenvalue has the form λ/d, and [F13] gives ln⁡(λ/d)=ln⁡λ−ln⁡d; the two logarithms therefore have the same additive term −ln⁡d, which cancels, while tr⁡(IB/d)=1; hence D(C⊗IB/d∥D⊗IB/d)=D(C∥D). If inclusion fails both sides are +∞ by [F6].

2.1givenF1F2step 1.1algebra

Apply joint convexity [F1] to the finite average defining T and isometric invariance [F2] to each unitary conjugate. This gives D(T(A)∥T(B))≤D(A∥B).

3.1givenF4step 1.1step 1.2step 2.1algebra∎

By [F4], C=Tr⁡BA and D=Tr⁡BB are non-negative. Substitute them into step 1.2, use step 1.1 to identify their twirls, and then apply step 2.1 to obtain D(Tr⁡BA∥Tr⁡BB)≤D(A∥B).

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

Channel data processing for finite quantum relative entropy

Statement

Let H,K be nonzero finite-dimensional complex inner-product spaces, let Φ:L(H)→L(K) be a quantum channel (Finite-dimensional quantum channel), and let A,B be non-negative operators on H. Then

D(Φ(A)∥Φ(B))≤D(A∥B).

Facts & Assumptions

Given: The spaces, channel and non-negative operators in the Statement.

[F1]

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

[F2]

Finite Kraus representation: a Kraus representation has the form Φ(X)=∑jKjXKj∗ on the full operator space.

[F3]

Trace preservation is Kraus normalization: trace preservation is equivalent to ∑jKj∗Kj=IH.

[F4]

Partial-trace data processing for finite quantum relative entropy: partial trace over a nonzero finite factor does not increase QRE.

[F5]

Isometric invariance of finite quantum relative entropy: simultaneous isometric conjugation preserves QRE.

[F6]

Partial trace over a finite tensor factor: partial trace over the environment removes the matching diagonal Kraus blocks and retains the output operator.

[F7]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: ⟨Kx,Ky⟩=⟨x,K∗Ky⟩ under the repository's inner-product convention.

[F8]

Finite registers and their ordered computational bases: the standard register E=Cr has the specified ordered orthonormal basis (fj).

Proof

1.1givenF1F2F3F7F8construct

By [F1]–[F2], choose a finite Kraus family (Kj)j<r for Φ. Since H≠{0} and [F3] gives ∑jKj∗Kj=IH, the family is nonempty. Let E=Cr with the ordered orthonormal basis (fj) from [F8], and define V:H→K⊗E by Vx:=∑j<rKjx⊗fj. For x,y∈H, orthonormality and [F3], [F7] give ⟨Vx,Vy⟩=∑j⟨Kjx,Kjy⟩=⟨x,(∑jKj∗Kj)y⟩=⟨x,y⟩; hence V∗V=IH.

2.1givenF2F6F8step 1.1algebra

Expanding in the environment basis [F8] gives VXV∗=∑j,kKjXKk∗⊗Mjk, where Mjkz=⟨z,fk⟩fj. The partial-trace formula [F6] keeps exactly the terms j=k, so Tr⁡E(VXV∗)=∑jKjXKj∗=Φ(X) for every X.

3.1givenF4F5step 2.1algebra∎

Apply isometric invariance [F5] and then partial-trace data processing [F4] to the pair (VAV∗,VBV∗) on K⊗E. By step 2.1, D(Φ(A)∥Φ(B))=D(Tr⁡E(VAV∗)∥Tr⁡E(VBV∗))≤D(VAV∗∥VBV∗)=D(A∥B).

Remarks

The finite Stinespring dilation used in the proof is summarized by the following map diagram. It records the factor that is discarded by the partial trace; the proof relies on the Kraus and trace calculations above, not on the diagram.

L(H)L(K¬E)L(K)X7!VXV¤PhioperatornameTrE
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Nonnegativity and equality for finite quantum relative entropy

Statement

For density operators ρ,σ on a finite-dimensional complex inner-product space,

D(ρ∥σ)≥0,

with equality if and only if ρ=σ.

Facts & Assumptions

Given: The states ρ,σ in the Statement.

[F1]

Channel data processing for finite quantum relative entropy: applying one quantum channel to both arguments cannot increase QRE.

[F2]

A finite POVM defines a classical-output quantum channel: every finite POVM gives a channel to a diagonal classical register with its stated outcome weights.

[F3]

Nonnegativity and equality for finite classical relative entropy: finite classical relative entropy is non-negative and vanishes exactly for equal probability vectors.

[F4]

Finite POVMs and their outcome law: a finite POVM is a non-negative operator family summing to the identity, and its state outcome weights are tr⁡(ρEy).

[F5]

POVM outcome weights are probabilities: finite POVM weights of a density operator form a probability vector.

[F6]

Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.

[F7]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F8]

Density operator: states are non-negative operators of trace one.

[F9]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument and conjugate-symmetric.

[F10]

Finite-dimensional quantum relative entropy: if support inclusion holds, D(A∥B)=tr⁡(Aln⁡A)−tr⁡(Aln⁡B).

Proof

1.1givenF1F2F4F5F8F10F11algebra

The singleton POVM E0=IH is a finite POVM by [F4]. By [F8] the inputs have trace one, and [F2] sends each density operator to the scalar state 1 on a one-dimensional register. The definition [F10] and ln⁡1=0 from [F11] give D(1∥1)=0, so applying [F1] yields D(ρ∥σ)≥0.

1.2givenF1F3F4F5F6F7F9construct

Suppose D(ρ∥σ)=0 and choose any orthonormal basis (ej)j<d of H using [F7]. The rank-one maps Pjx:=⟨x,ej⟩ej are self-adjoint and satisfy ⟨Pjx,x⟩=∣⟨x,ej⟩∣2≥0 by [F9], so they are non-negative by [F6]. Their sum is IH, so [F4] makes them a finite POVM; it has nonempty outcome set because H≠{0}. By [F5], the outcome vectors pj=tr⁡(ρPj) and qj=tr⁡(σPj) are probability vectors. Data processing [F1] and classical KL nonnegativity [F3] give 0=D(ρ∥σ)≥D(p∥q)≥0, so pj=qj for every j.

2.1givenF6F7F9step 1.2algebrachoose

For any unit vector v∈H, extend v to an orthonormal basis using [F7]. Step 1.2 applied to that basis gives ⟨ρv,v⟩=⟨σv,v⟩; by homogeneity this equality holds for every v. Put Δ=ρ−σ, which is self-adjoint by [F6], and q(v)=⟨Δv,v⟩. Under the root convention [F9], expansion gives 4⟨Δx,y⟩=q(x+y)−q(x−y)+iq(x+iy)−iq(x−iy). Since every q(v)=0, all matrix coefficients of Δ vanish, hence ρ=σ.

3.1givenF10algebra∎

Conversely, if ρ=σ, [F10] gives the support inclusion, and the two spectral logarithmic traces in the QRE definition agree, so D(ρ∥σ)=0.

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

The finite Holevo measurement bound

Statement

Let X be a finite nonempty set, let (px) be a probability vector, let ρx be density operators on a nonzero finite-dimensional space HB, and let ρˉ:=∑xpxρx. For a finite POVM (Ey)y∈Y on HB, define w(y∣x):=tr⁡(ρxEy), qy:=∑xpxw(y∣x), and the classical mutual information

I(X:Y):=∑x,y:pxw(y∣x)>0pxw(y∣x)ln⁡w(y∣x)qy.

Then

I(X:Y)≤χ({px,ρx})=S(ρˉ)−∑x:px>0pxS(ρx).

Facts & Assumptions

Given: The finite ensemble, average state, POVM, and outcome probabilities in the Statement.

[F1]

Finite classical-quantum states and Holevo information: χ=S(ρˉ)−∑px>0pxS(ρx) for the associated cq state.

[F2]

Finite-dimensional quantum relative entropy: QRE is computed by the support-restricted spectral logarithm, with +∞ when supports fail.

[F3]

Channel data processing for finite quantum relative entropy: QRE cannot increase under a finite-dimensional quantum channel.

[F4]

A finite POVM defines a classical-output quantum channel: the POVM defines a channel whose output on a state has diagonal entries tr⁡(ρEy).

[F5]

POVM outcome weights are probabilities: each w(⋅∣x) is a probability vector.

[F7]

Trace is a linear functional on Mn(F): trace is linear over finite sums and scalar multiples.

Proof

1.1givenF2F6algebra

Fix x with px>0. The operator ρˉ−pxρx=∑z≠xpzρz is non-negative. If v∈ker⁡ρˉ, then 0=⟨ρˉv,v⟩≥px⟨ρxv,v⟩≥0, so [F6] gives ρxv=0. Thus ker⁡ρˉ⊆ker⁡ρx and supp⁡(ρx)⊆supp⁡(ρˉ); D(ρx∥ρˉ) is finite for every x with px>0.

2.1givenF2F3F4F5F7step 1.1algebra

The measurement channel [F4] sends ρx to the diagonal state with entries w(y∣x) and ρˉ to the diagonal state with entries qy by linearity [F7]. For px>0, if w(y∣x)>0 then qy≥pxw(y∣x)>0. The QRE formula [F2] on diagonal states and data processing [F3] therefore give D(ρx∥ρˉ)≥∑y:w(y∣x)>0w(y∣x)ln⁡w(y∣x)qy.

3.1givenF1F2F7step 1.1step 2.1algebra∎

Multiply step 2.1 by px and sum only over x with px>0. Extend the support logarithm of ρˉ by zero on its kernel; step 1.1 and [F2] ensure that this preserves every retained cross trace. Trace linearity [F7] and ρˉ=∑x:px>0pxρx give ∑x:px>0pxD(ρx∥ρˉ)=∑x:px>0pxtr⁡(ρxln⁡ρx)−tr⁡(ρˉln⁡ρˉ)=χ by [F1]. The summed measurement terms are exactly the displayed I(X:Y) by its definition. Hence I(X:Y)≤χ.

5 · Examples, counterexamples and false statements

None yet.

Sources