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.

✓ 9 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Quantum Channel Capacities and Entanglement Assistance

1 · Prerequisites

2 · Summary

All registers and channels in this page are finite-dimensional, and all entropies use natural logarithms. The operational quantum and private capacities have regularized information formulas for a general memoryless channel. The regularization is essential to the statement: no general single-letter additivity claim is made. Entanglement assistance has an additive mutual-information formula. Degradable channels admit a single-letter quantum and private formula, and the flagged erasure channel provides an exact family across both degradable and antidegradable regimes.

A channel dilation keeps the receiver's output and the environment's output side by side. The two partial traces define the channel and its complement, respectively; the formulas are given by the maps, not by the diagram.

A \arrow[r,"V"] & B\otimes E \arrow[dl,"\\operatorname{Tr}_E"'] \arrow[dr,"\\operatorname{Tr}_B"] & \\
B & & E

For a purification on a reference register R and channel input A, coherent information is Ic(ρ,N)=S(B)−S(BR). A Stinespring dilation gives S(BR)=S(E), so the same quantity is the receiver entropy minus the environment entropy. Private information compares the Holevo information available at the receiver and environment. The capacity definitions specify their respective coding tasks and error criteria.

The entanglement-assisted one-use information is S(ρ)+Ic(ρ,N)=I(R;B), maximized over input states. Its additivity follows by applying data processing to the two local complementary channels and using nonnegative mutual information. For a degradable channel, the environment is obtained from the receiver by a channel; this makes coherent information concave and subadditive across tensor factors. The flagged erasure channel has complementary erasure probability 1−ϵ: for ϵ≤1/2 it is degradable, for ϵ≥1/2 it is antidegradable, and at ϵ=1/2 the two channels are identical up to the flag convention.

The companion examples specialize the noiseless qubit entanglement-assisted endpoint and the qudit erasure-capacity curve. The supplied Schumacher compression and HSW page provides finite-dimensional coding context; the Knill–Laflamme page fixes the separate error-correction setting; the Bell-state page supplies the dense-coding protocol used in the noiseless example.

The operational coding proofs are supplied by finite-block entropy continuity, exponential spectral-projector estimates, exact flat spectral-type reduction, finite unitary averaging and recovery, cq wiretap packing/covering with unnormalized Holevo leakage control, and flat Weyl entanglement-assisted codes. Finite ordered selections retain the stated no-choice convention. The converse arguments apply to the respective isometric quantum encoders, strong-secrecy mixed-state private codes, and arbitrary finite shared-state entanglement-assisted encoders.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Entropy bounds for a finite mixture of states

Statement

For states ρi and finite probabilities pi, put ρˉ=∑ipiρi. Then 0≤S(ρˉ)−∑ipiS(ρi)≤H(p).

Facts & Assumptions

Given: A common nonzero finite-dimensional space H, a finite probability vector (pi), and density operators ρi on H. The Shannon entropy is in nats: H(p):=−∑i:pi>0piln⁡pi, with 0ln⁡0:=0.

[F1]

Finite-dimensional von Neumann entropy: Finite-dimensional von Neumann entropy.

[F2]

Nonnegativity and equality for finite quantum relative entropy: Nonnegativity and equality for finite quantum relative entropy.

[F3]

Schmidt decomposition: Schmidt decomposition.

[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: 'The basis-independent trace of an endomorphism of a finite-dimensional vector space'.

[F6]

Finite-dimensional quantum relative entropy and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: on support inclusion, D(α∥β)=tr⁡(αln⁡α)−tr⁡(αln⁡β), and ln⁡(xy)=ln⁡x+ln⁡y for positive x,y.

Proof

1.1F1F2F4F5F6givenalgebraconstruct

Omit zero weights. For each i with pi>0, ρˉ−piρi=∑j≠ipjρj is non-negative. If v∈ker⁡ρˉ, then 0=⟨ρˉv,v⟩=pi⟨ρiv,v⟩+∑j≠ipj⟨ρjv,v⟩. All terms are nonnegative, so pi>0 implies ⟨ρiv,v⟩=0 and [F5] gives ρiv=0. Hence supp⁡ρi⊆supp⁡ρˉ and every D(ρi∥ρˉ) is finite. The trace formula [F6], linearity of trace [F4], and ρˉ=∑ipiρi give ∑ipiD(ρi∥ρˉ)=S(ρˉ)−∑ipiS(ρi)≥0 by [F2].

2.1F1F2F3F4F6givenalgebraconstructstep 1.1

For the upper bound, diagonalize each ρi=∑jλij∣vij⟩⟨vij∣, omitting zero weights and eigenvalues, and purify the mixture as ∣v⟩=∑ijpiλij∣vij⟩⊗∣i,j⟩. Its label marginal G is a state with diagonal qij=piλij and has the same nonzero eigenvalues as ρˉ by Schmidt decomposition. The logarithm product law in [F6] gives H(q)=H(p)+∑ipiS(ρi).

3.1F1F2F3F4F5F6givenalgebraconstructstep 2.1∎

For Δ=diag⁡(q), its kernel is spanned by coordinate labels with qij=0. Each such basis vector eij has ⟨Geij,eij⟩=qij=0, so [F5] gives Geij=0. Hence G annihilates ker⁡Δ and supp⁡G⊆supp⁡Δ. The formula [F6] now gives 0≤D(G∥Δ)=H(q)−S(G)=H(p)+∑ipiS(ρi)−S(ρˉ). This proves both bounds, including singleton/zero-weight cases.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Exponential averaged spectral projectors for a finite cq ensemble

Statement

For every fixed finite ensemble px,ρx and fixed η>0, there are constants C,c>0 (depending on this ensemble and η, not n) and projectors Pn,Qxn such that, writing ρˉ=∑pxρx and s=∑pxS(ρx), rank⁡Pn≤en(S(ρˉ)+η),Pnρˉ⊗nPn⪯e−n(S(ρˉ)−η)Pn, rank⁡Qxn≤en(s+η),QxnρxnQxn⪯e−n(s−η)Qxn, and Etr⁡(ρXn(I−Pn))≤Ce−cn,Etr⁡(ρXn(I−QXn))≤Ce−cn. The second pair of algebraic bounds holds for every word, including words with zero sampling probability; no per-word high-acceptance assertion is required.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Finite-dimensional von Neumann entropy: Finite-dimensional von Neumann entropy.

[F2]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F3]

Finite classical-quantum states and Holevo information: Finite classical-quantum states and Holevo information.

[F4]

Taylor's Schlömilch–Roche remainder formula: Taylor's Schlömilch–Roche remainder formula.

[F5]

The exponential function is smooth and (exp⁡)′=exp⁡: The exponential function is smooth and (exp⁡)′=exp⁡.

[F6]

Markov's inequality for random variables: Markov's inequality for random variables.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm product law converts product eigenvalues into sums of self-information.

Proof

1.1F1F2F3F4F5F6F7givenalgebraconstruct

For Pn, retain product eigenvectors of ρˉ⊗n whose positive eigenvalue has negative logarithm in n[S(ρˉ)−η,S(ρˉ)+η]. For Qxn, use product eigenvectors of ρxn=⨂iρxi whose eigenvalue has negative logarithm in n[s−η,s+η]. The upper eigenvalue bounds are immediate. The lower retained eigenvalue and trace at most one imply each rank bound. Under the joint law Pr⁡(X=x,J=j)=pxλxj, with zero-probability eigenvalues omitted, the random variable Z=−ln⁡λXJ has finite support and mean s. By [F7], the negative logarithm of each product eigenvalue is the sum of the coordinate self-information variables, so its IID sum controls the second failure probability exactly. The first failure is the same argument for the spectral law of ρˉ; averaging inputs gives ρˉ⊗n.

2.1F1F2F3F4F5F6F7step 1.1givenalgebraconstruct∎

For completeness, a finite supported centered variable Y with ∣Y∣≤b obeys EeuY≤1+u2b2e∣u∣b/2, by the Taylor remainder and EY=0. For small fixed u>0, ln⁡EeuY<uη/2. Markov's inequality and independence then bound Pr⁡(∑Yi≥nη)≤e−nuη/2; the logarithm product law [F7] gives the factor n when taking the log of the product moment generating function. Apply the same argument to −Y and add. A constant spectral variable has zero failure probability and needs no division by a range. All logarithms are evaluated only on positive-probability eigenvalues.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Finite unitary averaging and a decoupling second-moment bound

Statement

Let D≥2, 1≤K≤D, and ωAE⪰0 with dim⁡A=D, tr⁡ω≤1, and r=rank⁡ωE. For every δ>0 there is an explicitly specified finite probability ensemble of isometries W:CK→CD such that, for ωREW=DK(WT⊗IE)ωAE(W‾⊗IE), one has E∥ωREW−IRK⊗ωE∥1≤2Krtr⁡(ωAE2)+δ. At the same time the ensemble can be required to satisfy, for every Hermitian ZAE, E∥DK(WT⊗I)Z(W‾⊗I)∥1≤(1+δ)∥Z∥1. No Haar existence or Gaussian-law supplier, and no choice axiom, is used.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F2]

Trace Norm Duality And Norm Properties: Trace Norm Duality And Norm Properties.

[F3]

Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors: Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors.

[F4]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: 'The basis-independent trace of an endomorphism of a finite-dimensional vector space'.

[F5]

Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.

[F7]

Trace Norm Unitary Invariance And Positive Formula: the trace norm of a positive operator is its trace.

[F8]

Hermitian Trace Norm Positive Negative Parts: a Hermitian operator is the difference of positive and negative parts and its trace norm is the sum of their traces.

Proof

1.1F1F2F3F4F5F9givenalgebraconstruct

Set ζ=exp⁡(2πi/5). The three finite complex-exponential premises in [F9] show ∣ζ∣=1 and ζm=1 exactly when 5 divides m. Let G be the finite group of monomial unitaries whose nonzero entries belong to {1,ζ,ζ2,ζ3,ζ4}. Let R be the real rotation by π/4 in coordinates 1 and 2, acting identically elsewhere. Use the symmetric finite list S=G∪{R,R∗}, retaining multiplicities if any. At each walk step choose the identity with probability 1/2 and an element of this list uniformly with the remaining probability. For j=1,2, the moment operator on matrices is Tj(X)=12X+12∣S∣∑U∈SU⊗jX(U∗)⊗j. These are self-adjoint contractions for the Hilbert–Schmidt inner product, because the list is inverse-symmetric; laziness makes every eigenvalue nonnegative. Moreover ⟨X,(I−Tj)X⟩=14∣S∣∑U∈S∥X−U⊗jX(U∗)⊗j∥22. Thus their fixed spaces are exactly the simultaneous commutants of the displayed finite unitaries.

2.1F1F2F3F4F5step 1.1givenalgebraconstruct

For j=1, the independent diagonal fifth-root phases force a commuting matrix to be diagonal; permutations force all its diagonal entries equal. For j=2, a matrix coefficient from ∣i,j⟩ to ∣k,l⟩ can survive the diagonal phases only when the unordered multisets {i,j} and {k,l} agree. By the primitive-order identity established in step 1.1, each index occurs with multiplicity 0, 1 or 2; equality modulo 5 of every exponent forces equality of these integer multiplicities. Commutation with all permutations then leaves three constants: c on ∣i,i⟩, a on ∣i,j⟩⟨i,j∣ for i≠j, and b on ∣i,j⟩⟨j,i∣. Commutation with R⊗R applied to ∣1,1⟩, whose rotated vector has nonzero coefficients on both ∣1,2⟩ and ∣2,1⟩, forces c=a+b. Conversely I and the swap F commute with every tensor-square unitary. The fixed space is therefore precisely span⁡{I,F}, also when D=2.

3.1F1F2F3F4F5step 2.1givenalgebraconstruct

Finite-dimensional spectral decomposition now gives orthogonal projections P1,P2 onto these fixed spaces and a number 0≤λ<1 such that ∥TjL−Pj∥2→2≤λL,j=1,2. If the orthogonal complement is zero, take its spectral radius as zero. Every TjL is the moment of an finite distribution of length-L unitary words; the limit is only a finite-matrix spectral calculation, not an assumed Haar integral. The first projection is P1(X)=tr⁡(X)I/D. For any rank-K projection P0, invariance of trace and swap trace gives P2(P0⊗P0)=a0I+b0F,a0=K(KD−1)D(D2−1),b0=K(D−K)D(D2−1). The coefficients solve a0D2+b0D=K2 and a0D+b0D2=K.

4.1F1F2F3F4F5step 3.1givenalgebraconstruct

Choose a coordinate isometry W0 and let W=UW0, where U is a finite walk word. Complex conjugation preserves the same limiting first and second moment projections and their norm bounds, so they apply to P=W‾WT as well. The swap identity on matrix units gives the following limiting second moment, with Ω=IR/K⊗ωE: lim⁡L→∞E∥ωW−Ω∥22=D(KD−1)K(D2−1)tr⁡(ω2)+1−DKK(D2−1)tr⁡(ωE2)≤2tr⁡(ω2). In detail, the squared-state term is (D2/K2){a0tr⁡(ω2)+b0tr⁡(ωE2)}, and the limiting mean is Ω, so subtract tr⁡(ωE2)/K.

5.1F1F2F3F4F5F6step 4.1givenalgebraconstruct

The finite moment error has a quantitative bound. Put dE=dim⁡E and ε=λL. The first-moment error in each matrix unit of the compressed reference is at most ε in Hilbert–Schmidt norm; contracting it with ω shows ∥EωW−Ω∥2≤Dε∥ω∥2≤Dε. For the squared-state term, the second-moment error on P0⊗P0 has Hilbert–Schmidt norm at most Kε. In its trace pairing with FE(ω⊗ω), the partial trace over the two environment copies has Hilbert–Schmidt norm at most dE∥ω∥22≤dE (Cauchy–Schwarz for each diagonal block). Consequently that squared-state error is at most D2dEε/K. The cross term with Ω, whose Hilbert–Schmidt norm is at most 1/K, has error at most 2Dε/K. Hence, with CD=D2dE+2D, E∥ωW−Ω∥22≤2tr⁡(ω2)+CDε. Positivity implies supp⁡ω⊆A⊗supp⁡ωE: if v∈ker⁡ωE, the marginal quadratic form is a sum of nonnegative diagonal quadratic forms of ω; each is zero, and [F6] makes the corresponding product vectors kernel vectors of ω. Self-adjointness then makes the corresponding rows and columns zero. Compression acts only on A, so both ωW and Ω are supported in CK⊗supp⁡ωE; each difference therefore has rank at most Kr. Cauchy–Schwarz on singular values and Jensen give the trace-norm bound at most 2Krtr⁡(ω2)+KrCDε.

6.1F1F2F3F4F5F7F8step 5.1givenalgebraconstruct∎

Finally write a Hermitian Z as Z+−Z− using [F8]. Each compression of Z+ or Z− is positive, so its trace norm is its trace by [F7]; positivity and linearity therefore bound the trace norm of the difference by the sum of the two compressed traces. The first-moment bound ∥EP−(K/D)I∥∞≤Kε gives E∥CW(Z)∥1≤(1+Dε/K)∥Z∥1. Choose a finite L with both KrCDλL≤δ2 and DλL/K≤δ. Such an integer exists by λ<1; the least such integer is a specified choice. If r=0, the positive operator is zero and its decoupling bound is automatic. This proves both assertions with an finite ensemble and exact dimension-dependent moment control.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pendingOpen item page →

Every finite extension is obtained from a purification by a channel

Statement

Let ωZA be any finite-dimensional state with Tr⁡ZωZA=ρA, and let ∣ψ⟩RA purify ρA with R a copy of A. There is a CPTP map Λ:R→Z with (Λ⊗id⁡A)(∣ψ⟩⟨ψ∣)=ωZA.

Facts & Assumptions

Given: Nonzero finite-dimensional spaces A,Z, states ρA and ωZA with Tr⁡ZωZA=ρA, and a purification ∣ψ⟩RA where R is a copy of A.

[F1]

Purifications exist and are unitarily equivalent after padding: Purifications exist and are unitarily equivalent after padding.

[F3]

Finite-dimensional quantum channel: Finite-dimensional quantum channel.

[F4]

An isometry followed by partial trace is a channel: An isometry followed by partial trace is a channel.

[F6]

Partial trace over a finite tensor factor, Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations, and The product basis is orthonormal and tensor dimensions multiply: the tensor factors have the declared order, factor reordering is unitary, and tracing the auxiliary factor after applying a channel to R gives the corresponding marginal on ZA.

[F7]

Proof

1.1F1F2F3F7givenalgebraconstruct

Choose a finite purification ∣Ω⟩ZAF of ωZA by [F1] and reorder its factors as A(ZF). Let ρA=∑j=1rλj∣aj⟩⟨aj∣ be a spectral decomposition on its positive support, obtained from [F7]. Expand each purification in the product basis using this same eigenbasis on A: ∣ψ⟩RA=∑j=1r∣rj0⟩R∣aj⟩A,∣Ω⟩A(ZF)=∑j=1r∣aj⟩A∣zj0⟩ZF. The partial-trace coordinate formula [F2] and the fact that both A marginals equal ρA show that the coefficient vectors have Gram matrices ⟨rj0,rk0⟩=λjδjk and ⟨zj0,zk0⟩=λjδjk. Thus ∣rj⟩:=∣rj0⟩/λj and ∣zj⟩:=∣zj0⟩/λj are orthonormal and ∣ψ⟩RA=∑j=1rλj∣rj⟩R∣aj⟩A,∣Ω⟩A(ZF)=∑j=1rλj∣aj⟩A∣zj⟩ZF. This coefficient argument also handles repeated positive eigenvalues because the chosen basis is fixed before either expansion.

2.1F1F2F3F5F6givenalgebraconstructstep 1.1

Let d=dim⁡R=dim⁡A. In every case set G=Cd, fix its first coordinate unit vector ∣0⟩G, and append it to ∣Ω⟩. Since Z and the purifying space F are nonzero, dim⁡(Z⊗F⊗G)≥d. Denote the resulting orthonormal Schmidt partners by ∣zj′⟩=∣zj⟩∣0⟩G. The map U0:span⁡{∣rj⟩}→span⁡{∣zj′⟩} given by U0∣rj⟩=∣zj′⟩ is an isometry. Extend {∣rj⟩} to an orthonormal basis of R and choose the same number of additional orthonormal vectors in the orthogonal complement of the zj′ in Z⊗F⊗G; [F5] and the target dimension bound ensure this is possible. Sending the added basis vectors to those target vectors extends U0 to a linear isometry U:R→Z⊗F⊗G on all of R. By construction, (U⊗IA)∣ψ⟩ is exactly the padded purification ∣Ω⟩⊗∣0⟩G, after reordering to Z(F⊗G)A. This construction includes the singular case r<d, since it extends U on all zero-Schmidt directions of R.

3.1F1F3F4F6givenalgebraconstructstep 2.1∎

Define Λ(X)=Tr⁡F⊗G(UXU∗) from L(R) to L(Z). Since U is an isometry, [F4] makes Λ completely positive and trace-preserving on the full operator space. Applying it to the reference factor of ∣ψ⟩⟨ψ∣ traces F⊗G from the pure state ∣(U⊗IA)ψ⟩⟨(U⊗IA)ψ∣, leaving its ZA marginal, which is ωZA by construction and is unchanged by the appended pure G register [F6]. Thus (Λ⊗id⁡A)(∣ψ⟩⟨ψ∣)=ωZA, as required.

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

Finite-dimensional quantum erasure channel

Definition

Let A be a d-dimensional complex inner-product space with d≥1. Form the orthogonal direct sum B:=A⊕Ce, where e is a unit erasure vector orthogonal to every vector in A; the inner product on pairs is ⟨(x,a),(y,b)⟩B=⟨x,y⟩A+ab‾. Thus dim⁡B=d+1 by If V=⨁i<nUi with every Ui finite-dimensional, then V is finite-dimensional and dim⁡FV=∑i<ndim⁡FUi; in particular dim⁡F(U⊕W)=dim⁡FU+dim⁡FW. Let J:A→B be the isometric inclusion into the data summand.

For an erasure probability ϵ∈[0,1], the d-dimensional quantum erasure channel is the linear map

Ed,ϵ(X):=(1−ϵ)JXJ∗+ϵtr⁡(X)∣e⟩⟨e∣,X∈L(A).

For a density operator ρ, this outputs the data state with probability 1−ϵ and the orthogonal erasure flag with probability ϵ. The definition is on the full operator space, and its channel property is established in The finite-dimensional erasure map is a quantum channel ↗.

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

Limit formula for linearly bounded superadditive sequences

Statement

Let (an)n≥0 be a real sequence with a0=0, am+n≥am+an for all m,n≥0, and ∣an∣≤Cn for some finite constant C. Then

lim⁡n→∞ann=sup⁡k≥1akk.

Facts & Assumptions

Given: The real sequence and superadditivity and linear boundedness assumptions in the Statement.

[A1]

am+n≥am+an for all nonnegative integers m,n, and ∣an∣≤Cn.

Proof

1.1givenA1algebra

Set α:=sup⁡k≥1ak/k. The bound in [A1] makes α finite, and the definition of supremum gives an/n≤α for every n≥1. Hence lim sup⁡n→∞an/n≤α.

1.2givenA1algebrachoose

Fix k≥1. For each n, write n=qk+r with integers q≥0 and 0≤r<k. Repeated use of superadditivity in [A1] gives an≥qak+ar. The finitely many values a0,…,ak−1 have a finite minimum mk, so an/n≥(q/n)ak+mk/n. As n→∞, q/n→1/k and mk/n→0, yielding lim inf⁡n→∞an/n≥ak/k.

2.1step 1.1step 1.2algebra∎

Since step 1.2 holds for every k≥1, taking the supremum gives lim inf⁡n→∞an/n≥α. Combining with step 1.1 proves the asserted limit and its value.

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

Complementary channels and coherent information

Definition

Let A and B be nonzero finite-dimensional complex inner-product spaces and let N:L(A)→L(B) be a quantum channel as in Finite-dimensional quantum channel. Choose a finite-dimensional environment E and a linear isometry V:A→B⊗E such that

N(X)=Tr⁡E(VXV∗)

for every X∈L(A); such a dilation exists by Every finite-dimensional channel has a finite isometric dilation. The channel

Nc(X):=Tr⁡B(VXV∗)∈L(E)

is the complementary channel associated with this chosen dilation. The partial trace Tr⁡B contracts the first factor of the ordered product B⊗E (Partial trace over the first tensor factor).

It is a quantum channel: reorder B⊗E to E⊗B by the finite wire-permutation unitary (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations); the reordered V is still an isometry, so tracing its second factor B gives a channel by An isometry followed by partial trace is a channel.

For a density operator ρ on A, choose a finite purification ∣ψ⟩∈A⊗R with Tr⁡R∣ψ⟩⟨ψ∣=ρ (Ensemble and purification), and define ωBR:=(N⊗id⁡R)(∣ψ⟩⟨ψ∣). Its coherent information from A to B is

Ic(ρ,N):=S(N(ρ))−S(ωBR),

where S is finite-dimensional von Neumann entropy in nats (Finite-dimensional von Neumann entropy). The value does not depend on the chosen purification: after padding reference spaces, any two purifications differ by a unitary on R (Purifications exist and are unitarily equivalent after padding); applying N⊗id⁡R preserves that unitary relation. A unitary maps an orthonormal eigenbasis to an orthonormal eigenbasis with the same eigenvalues, so entropy is unchanged (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely). Padding adds only zero eigenvalues, which do not contribute.

Remarks

The chosen complement may vary with the dilation, but its output entropy on ρ equals S(ωBR): applying V to the first tensor factor of the purifying vector gives a pure state on B⊗E⊗R. After reordering the factors, its complementary BR and E marginals have the same positive eigenvalues. The corresponding entropy identity is proved in Coherent information equals output entropy minus environment entropy.

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

Entropy of a finite flagged state

Statement

Let H be a nonzero finite-dimensional complex inner-product space, let τ be a density operator on H, let e be a unit vector orthogonal to the data summand in H⊕Ce, and let p∈[0,1]. With h(p):=−pln⁡p−(1−p)ln⁡(1−p) and 0ln⁡0:=0, the block-diagonal state

ωp:=pτ⊕(1−p)∣e⟩⟨e∣

satisfies S(ωp)=h(p)+pS(τ).

Facts & Assumptions

Given: The finite-dimensional state, orthogonal flag, and probability p in the Statement.

[F1]

Finite-dimensional von Neumann entropy: entropy is −∑λ>0λln⁡λ, and zero-eigenvalue terms contribute zero.

[F3]

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

Proof

1.1F1F2F3givenalgebra

The orthogonal summands reduce ωp, so its eigenvalues, including multiplicities, are pλj on H and 1−p on the flag. For 0<p<1, [F1]–[F3] give S(ωp)=−∑j:λj>0pλjln⁡(pλj)−(1−p)ln⁡(1−p)=h(p)+pS(τ), because ∑jλj=1.

2.1F1step 1.1casesalgebra∎

At p=0, ωp is the pure flag state and both sides equal zero. At p=1, ωp=τ and both sides equal S(τ). Thus the formula holds on the closed interval, including its endpoints.

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

Data processing for finite quantum mutual information

Statement

Let A,B,A′,B′ be nonzero finite-dimensional complex inner-product spaces, let ρAB be a density operator on A⊗B, and let Φ:A→A′ and Ψ:B→B′ be quantum channels. Then

I(A′:B′)(Φ⊗Ψ)(ρ)≤I(A:B)ρ,

where quantum mutual information is I(X:Y)ω=S(ωX)+S(ωY)−S(ωXY) as in Finite quantum mutual, conditional, and conditional mutual information.

Facts & Assumptions

Given: The spaces, state, and channels in the Statement.

[F1]

Finite quantum mutual, conditional, and conditional mutual information: I(X:Y)=S(X)+S(Y)−S(XY) for finite bipartite states.

[F2]

Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state ωXYZ, S(XY)+S(YZ)≥S(Y)+S(XYZ).

[F3]

Every finite-dimensional channel has a finite isometric dilation: each finite-dimensional channel has an isometric dilation V with output obtained by tracing its finite environment.

[F5]

Partial traces of a finite bipartite state are states: partial traces of finite-dimensional density operators are density operators.

[F6]

Ordered tensor registers, their inner product, and wire permutations and Finite wire permutations are unitary basis permutations: factors may be reordered by a unitary wire permutation, preserving the state and its entropy.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm product law used in the entropy identities underlying strong subadditivity.

Proof

1.1givenF1F3F4algebrachoose

First apply Φ to A. Choose a Stinespring isometry V:A→A′⊗E from [F3], and form ρ~A′EB:=(V⊗IB)ρAB(V∗⊗IB). This is a state: a spectral decomposition of ρAB in [F4] shows that its nonzero eigenvalues remain the same under the isometric embedding. Its A′E marginal is VρAV∗ and has the same positive eigenvalues as ρA, while its A′EB joint state has the same positive eigenvalues as ρAB. Thus [F1] gives I(A′E:B)ρ~=I(A:B)ρ.

2.1F1F2F3F5F6F7step 1.1algebra

Reorder A′EB to EA′B by the unitary permutation in [F6]. Apply [F2] to the ordered tripartite state ρ~EA′B, with A′=Y, to obtain S(EA′)+S(A′B)≥S(A′)+S(EA′B). Rearranging by [F1] gives I(EA′:B)≥I(A′:B). The entropy identities and their logarithm product law are supplied by [F7]. The A′B marginal is (Φ⊗id⁡B)(ρ) by [F3] and the partial-trace convention; hence applying Φ cannot increase mutual information.

3.1givenF1F2F3F5F6F7step 2.1algebra∎

Repeat step 1.1–2.1 with Ψ acting on the second register, now taking the first register to be A′. This gives I(A′:B′)(Φ⊗Ψ)(ρ)≤I(A′:B)(Φ⊗id⁡B)(ρ). Combine this with step 2.1 to obtain the claimed inequality. The entropy-law prerequisite remains [F7].

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

The maximally mixed state maximizes finite quantum entropy

Statement

Let H be a nonzero finite-dimensional complex inner-product space of dimension d, and let ρ be a density operator on H. Then

S(ρ)≤ln⁡d,

with equality if and only if ρ=IH/d.

Facts & Assumptions

Given: The finite-dimensional state ρ and nonzero space H in the Statement.

[F1]

Finite-dimensional von Neumann entropy: S(ρ)=−tr⁡(ρln⁡ρ), with zero-eigenvalue terms omitted.

[F2]

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

[F3]

Nonnegativity and equality for finite quantum relative entropy: for finite-dimensional density operators ρ,σ, D(ρ∥σ)≥0, with equality exactly when ρ=σ.

[F5]

Proof

1.1F2F4F5givenalgebra

The operator τ:=IH/d is a density operator: it is nonnegative and has trace d/d=1 by [F4]–[F5]. Its support is all of H, so supp⁡(ρ)⊆supp⁡(τ) and the finite formula in [F2] applies.

2.1F1F2F3F4F6step 1.1algebra

Spectral calculus gives ln⁡τ=ln⁡(1/d)IH=−(ln⁡d)IH by [F4], [F6]. Hence [F1]–[F2] yield D(ρ∥τ)=tr⁡(ρln⁡ρ)−tr⁡(ρln⁡τ)=−S(ρ)+ln⁡d, using tr⁡(ρ)=1 by [F4]. By [F3], this is nonnegative, so S(ρ)≤ln⁡d.

3.1F1F3step 2.1algebra∎

Equality S(ρ)=ln⁡d is equivalent by step 2.1 to D(ρ∥τ)=0. The equality case of [F3] then gives ρ=τ=IH/d. Conversely, substituting ρ=IH/d into [F1] gives S(ρ)=ln⁡d.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Dimension-dependent quantum entropy continuity and Holevo control

Statement

Write h(t)=−tln⁡t−(1−t)ln⁡(1−t) with continuous endpoints. Let g(t)=(1+t)ln⁡(1+t)−tln⁡t for t∈[0,1], with g(0)=0. For states ρ,σ on dimension d≥1 and t=12∥ρ−σ∥1, ∣S(ρ)−S(σ)∣≤tln⁡d+g(t). Moreover, if σ1,…,σM are states on that space and a=M−1∑m12∥σm−σ∥1, their uniform Holevo information is at most 2aln⁡d+2g(a). In particular on dimension dEn, exponential decay of a makes unnormalized Holevo information tend to zero.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.

[F2]

The maximally mixed state maximizes finite quantum entropy: The maximally mixed state maximizes finite quantum entropy.

[F3]

Trace Distance: Trace Distance.

[F4]

Trace Norm Unitary Invariance And Positive Formula: Trace Norm Unitary Invariance And Positive Formula.

[F5]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F6]

Trace Norm Duality And Norm Properties and Trace Norm Unitary Invariance And Positive Formula: the trace norm satisfies the triangle inequality, and for positive operators it equals the trace.

[F8]
[F9]

The logarithm grows more slowly than every positive real power: ln⁡x/x→0 as x→∞.

[F10]

The exponential dominates every fixed nonnegative integer power at +∞: a polynomial factor times e−cn tends to zero for each fixed c>0.

[F11]

Hermitian Trace Norm Positive Negative Parts: if a Hermitian operator has trace zero, its positive and negative parts have equal trace, each half its trace norm.

[F12]

Finite-dimensional von Neumann entropy: S(ω)=−∑λ>0λln⁡λ, so a density operator has nonnegative entropy.

Proof

1.1F1F2F3F4F5F6F7F8F9F11F12givenalgebraconstruct

The trace norm is nonnegative and, by [F6], ∥ρ−σ∥1≤∥ρ∥1+∥σ∥1=2; hence t∈[0,1]. If t=0, equality of the states settles the claim. Otherwise [F11] says the positive and negative parts of ρ−σ have trace t. Normalize them to states ω+,ω−. Then θ=ρ+tω−1+t=σ+tω+1+t. Apply the lower mixture-entropy bound to the first representation and upper bound to the second. After multiplication by 1+t this gives S(ρ)−S(σ)≤t[S(ω+)−S(ω−)]+(1+t)h(t/(1+t))≤tln⁡d+g(t). Here S(ω+)≤ln⁡d by [F2], while S(ω−)≥0 by [F12]. Interchanging the states gives the absolute-value bound. Dimension one causes no exception. For t>0, [F7] gives g′(t)=ln⁡(1+1/t)>0 and g′′(t)=−1/[t(1+t)]<0. Moreover tln⁡t→0 as t↓0 by [F9], so g is continuous on [0,1] with the stated endpoint value. Jensen for g follows from [F8] applied to the convex function −g, including the endpoint.

2.1F1F2F3F4F5F6F8F10step 1.1givenalgebraconstruct∎

For each m, let tm=T(σm,σ). By step 1.1, 0≤tm≤1, so a=M−1∑mtm∈[0,1]. The average state σˉ=M−1∑mσm satisfies T(σˉ,σ)≤a by the trace-norm triangle inequality [F6]. Applying step 1.1 to σˉ gives a bound with its actual distance t′≤a; since g is increasing and ln⁡d≥0, its right side is at most aln⁡d+g(a). Applying step 1.1 to each σm, averaging, and using finite Jensen [F8] for concave g gives the other aln⁡d+g(a). The Holevo formula [F8] therefore yields χ({M−1,σm})=S(σˉ)−1M∑mS(σm)≤2aln⁡d+2g(a). When d=dEn and a≤Ce−cn, the first term tends to zero by [F10], and the second tends to zero by continuity of g at zero from step 1.1.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pendingOpen item page →

Exact flat spectral-type reduction of channel information

Statement

Let N:L(A)→L(B) be a finite-dimensional channel, let d=dim⁡A, and let ρ be a state on A. Fix a finite Stinespring dilation of N and its complementary channel. For each integer n≥1 there is an exact decomposition ρ⊗n=∑tptτt into mutually orthogonal flat spectral-type states, with at most (n+1)d positive-weight types and H(T):=−∑t:pt>0ptln⁡pt≤dln⁡(n+1). For the fixed complement and its tensor powers, ∑tptIc(τt,N⊗n)≥nIc(ρ,N)−H(T), ∑tpt[S(τt)+Ic(τt,N⊗n)]≥n[S(ρ)+Ic(ρ,N)]−2H(T). Thus in each inequality some flat type state attains at least the displayed lower bound.

Facts & Assumptions

Given: The channel N:L(A)→L(B), its fixed finite Stinespring dilation and complementary channel, and the state ρ on its input space A. The finite type variable T has probabilities pt and natural-log Shannon entropy H(T)=−∑pt>0ptln⁡pt.

[F1]

Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.

[F2]

Complementary channels and coherent information: Complementary channels and coherent information.

[F3]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F4]

Coherent information equals output entropy minus environment entropy: Ic(σ,M)=S(M(σ))−S(Mc(σ)) for the fixed dilation.

[F6]

Finite distributions, entropy, divergence, and stochastic matrices and Nonnegativity and equality for finite classical relative entropy: H(p)=−∑pi>0piln⁡pi, and D(p∥q)≥0 for finite probability vectors.

Proof

1.1F1F2F3F5F6givenalgebraconstruct

Write ρ=∑j=1dλj∣j⟩⟨j∣, including zero eigenvalues. For each count vector t=(n1,…,nd) with ∑jnj=n, let mt be the number of product basis words of that type, pt=mt∏j:nj>0λjnj (zero if any such λj=0), and omit types with pt=0. Let Pt project onto the span of the words of type t and set τt=Pt/mt. These states are flat, their supports are mutually orthogonal, and ρ⊗n=∑t:pt>0ptτt. There are at most (n+1)d types. If NT is their number and u is the uniform law on them, [F6] gives 0≤D(p∥u)=ln⁡NT−H(T), so H(T)≤dln⁡(n+1). Since S(τt)=ln⁡mt, the logarithm product law [F5] and ∑tptnj=nλj yield ∑tptS(τt)=∑tptln⁡mt=nS(ρ)−H(T).

2.1F1F2F3F4F5givenalgebraconstructstep 1.1

Let Bt=N⊗n(τt) and Et=(Nc)⊗n(τt), with averages Bˉ=∑tptBt=N(ρ)⊗n and Eˉ=∑tptEt=Nc(ρ)⊗n. By [F4], the receiver-minus-environment entropy identity applies to each type. The upper entropy-excess bound [F1] gives ∑tptS(Bt)≥S(Bˉ)−H(T), while its lower entropy-excess bound gives ∑tptS(Et)≤S(Eˉ). Product spectral decompositions and [F5] give S(Bˉ)−S(Eˉ)=n[S(N(ρ))−S(Nc(ρ))]=nIc(ρ,N). Hence ∑tptIc(τt,N⊗n)≥nIc(ρ,N)−H(T). Adding ∑tptS(τt)=nS(ρ)−H(T) from step 1.1 gives the second inequality.

3.1step 2.1givenalgebra∎

Each displayed left side in step 2.1 is an average over the finite positive-probability types, so at least one type attains at least the corresponding average lower bound. These are exact finite-n estimates; no replacement of fixed-dimensional continuity by a uniform bound is involved.

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

Flat-input coherent information is achievable by subspace codes

Statement

Let N:L(A)→L(B) be a finite-dimensional channel with d=dim⁡A≥1. Fix a Stinespring isometry V:A→B⊗E satisfying N(X)=Tr⁡E(VXV∗) for every X, and set Nc(X)=Tr⁡B(VXV∗) and τ=IA/d. Every 0<R<Ic(τ,N) is achievable by isometric subspace entanglement transmission; if Ic(τ,N)≤0, rate zero is achieved by a one-dimensional code. An n-use code has an isometry Wn:CKn→A⊗n and a CPTP decoder to CKn; its squared overlap with the maximally entangled target tends to one and n−1ln⁡Kn→R. More generally, for any isometric inclusion J:CD→A with D≥1, the same conclusion holds for the flat state JJ∗/D by applying the result to X↦N(JXJ∗) and composing encoders with J⊗n.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Finite unitary averaging and a decoupling second-moment bound: Finite unitary averaging and a decoupling second-moment bound.

[F2]

Exponential averaged spectral projectors for a finite cq ensemble: Exponential averaged spectral projectors for a finite cq ensemble.

[F3]

Gentle measurement bound in finite dimensions: Gentle measurement bound in finite dimensions.

[F4]

Every finite-dimensional channel has a finite isometric dilation: Every finite-dimensional channel has a finite isometric dilation.

[F5]

Schmidt decomposition: Schmidt decomposition.

[F6]

Fidelity Purification Characterization: Fidelity Purification Characterization.

[F7]

Purifications exist and are unitarily equivalent after padding: Purifications exist and are unitarily equivalent after padding.

[F8]

Fuchs Van De Graaf: Fuchs Van De Graaf.

[F9]

Partial trace contracts the trace norm on Hermitian operators: Partial trace contracts the trace norm on Hermitian operators.

[F10]

Strong subadditivity of finite-dimensional quantum entropy: Strong subadditivity of finite-dimensional quantum entropy.

[F11]

Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for the fixed dilation, Ic(ρ,N)=S(N(ρ))−S(Nc(ρ)).

[F13]

An isometry followed by partial trace is a channel: an isometry followed by a finite partial trace is a CPTP map.

Proof

1.1F1F2F3F4F5F6F7F8F9F10F11givenalgebraconstruct

Put sB=S(N(τ)) and sE=S(Nc(τ)). By [F11], sB−sE=Ic(τ,N); choose η>0 with R<sB−sE−2η. On n uses, let ∣vn⟩=(I⊗V⊗n)∣Φdn⟩ in factor order A′BnEn. Let Pn,Qn be the spectral projectors for the IID receiver and environment states from Exponential averaged spectral projectors for a finite cq ensemble, and let ϵn≤Ce−cn bound the sum of their failure probabilities. The commuting joint projection has acceptance at least 1−ϵn. For ∣v^n⟩=(IA′⊗Pn⊗Qn)∣vn⟩, the rank-two pure-vector calculation used in gentle measurement gives ∥∣vn⟩⟨vn∣−∣v^n⟩⟨v^n∣∥1≤2ϵn. This follows also by applying the gentle-measurement lemma to the pure state and the joint projection. Let ω=Tr⁡Bn∣v^n⟩⟨v^n∣. Its environment rank is at most en(sE+η). Since the projected vector is pure, tr⁡(ω2)=tr⁡(ωBn2). Moreover 0⪯ωBn⪯PnN(τ)⊗nPn⪯e−n(sB−η)Pn. To verify the first inequality, take the partial trace after Qn; the complementary environment projection produces another positive summand of the original receiver marginal. Hence tr⁡(ω2)≤e−n(sB−η), because its trace is at most one.

2.1F1F2F3F4F5F6F7F8F9F10F12step 1.1givenalgebraconstruct

First prove sB≤ln⁡d+sE. The one-use Stinespring output of ∣Φd⟩ is pure on A′BE, so [F5] gives sB=S(A′E). For its marginal state ωA′E, append a one-dimensional register C in a pure state and order the resulting state as A′CE. Strong subadditivity [F10] gives S(A′C)+S(CE)≥S(C)+S(A′CE), that is S(A′)+S(E)≥S(A′E); [F12] gives S(A′)=ln⁡d. Hence sB≤ln⁡d+sE, so Ic=sB−sE≤ln⁡d and 0<R<Ic implies Kn=⌊enR⌋≤dn by [F12]. For an isometry W:CKn→A⊗n, let ρREnW be the environment/reference state produced by encoding half of ∣ΦKn⟩. Coefficient matrices give exactly the normalized-compression expression for the unprojected marginal. Use the finite ensemble above with tolerance e−n. Apply its compression estimate to ω, and its averaged trace-contraction estimate to the difference between projected and unprojected marginals. Their environment marginals differ by at most 2ϵn. The triangle inequality therefore yields E∥ρREnW−IRKn⊗Nc(τ)⊗n∥1≤6ϵn+2e−n+2e−n(sB−sE−R−2η)⟶0. Order the finite generator list and its length-L words. For each n, take the first word whose displayed norm is at most twice its expectation; if that expectation is zero, take the first zero-norm word. A qualifying word exists by finite averaging. This specifies the entire encoder sequence without countable choices.

3.1F1F2F3F4F5F6F7F8F9F10step 2.1givenalgebraconstruct

The product target is purified by ∣ΦKn⟩RM⊗∣en⟩EnF, with a sufficiently large finite F. The encoded Stinespring output is another purification on reference/environment versus receiver. Root-fidelity purification characterization, after adding a pure finite ancilla to the receiver if needed, supplies an isometry on the receiver's purifying space whose overlap with that target is the root fidelity of the two marginals. The fixed-purification form follows from the purification/unitary-equivalence theorem. Fuchs–van de Graaf makes this root fidelity at least one minus half the displayed norm. Trace out the extra decoder factor F: the resulting CPTP decoder has squared entanglement fidelity at least the square of that overlap and hence tending to one. The encoder is exactly the isometry W; no generating-code/transmitting-code equivalence is assumed. Fix ordered bases throughout. In the purification characterization use the polar/SVD attaining map, extending every kernel partial isometry by the ordered basis completion; in repeated eigenspaces, project the ordered coordinate vectors and Gram–Schmidt in that order. This specifies a decoder at each block length by one formula, rather than choosing a sequence of unrelated attaining maps.

4.1F11F13givenconstructalgebra∎

If Ic(τ,N)≤0, choose a unit vector of A⊗n as the encoder for Kn=1. The decoder to C is X↦tr⁡(X), a channel by [F13] using the isometry x↦1⊗x and tracing A⊗n. Its entanglement fidelity is one and its rate is zero. For a subspace inclusion J:CD→A, the restricted channel NJ(X)=N(JXJ∗) has dilation VJ, and its flat input ID/D has coherent information Ic(JJ∗/D,N) by the fixed-dilation definition. Applying steps 1.1–3.1 to NJ and composing each encoder with J⊗n proves the stated subspace case.

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

The finite-dimensional erasure map is a quantum channel

Statement

For every integer d≥1 and ϵ∈[0,1], the map Ed,ϵ defined in Finite-dimensional quantum erasure channel is a finite-dimensional quantum channel.

Facts & Assumptions

Given: A d-dimensional complex inner-product space A, d≥1, and ϵ∈[0,1].

[F1]

Finite-dimensional quantum erasure channel: B=A⊕Ce with e⊥A, and Ed,ϵ(X)=(1−ϵ)JXJ∗+ϵtr⁡(X)∣e⟩⟨e∣.

[F2]

An isometry followed by partial trace is a channel: if V:A→B⊗E is a finite-dimensional linear isometry, then X↦Tr⁡E(VXV∗) is a quantum channel.

[F3]

Partial trace over a finite tensor factor and Ordered tensor registers, their inner product, and wire permutations: partial trace sums matching diagonal environment coordinates in the ordered product basis.

Proof

1.1givenF1constructalgebra

Let E=A⊕CeE with eE a unit vector orthogonal to the data summand, and write JB,JE for the data inclusions. Define Vϵx:=1−ϵ JBx⊗eE+ϵ e⊗JEx. The summands lie in orthogonal subspaces of B⊗E, so for all x,y∈A, ⟨Vϵx,Vϵy⟩=(1−ϵ)⟨x,y⟩+ϵ⟨x,y⟩=⟨x,y⟩. Thus Vϵ is a linear isometry, including at ϵ=0 and ϵ=1.

2.1F1F3step 1.1algebra

Expanding VϵXVϵ∗ gives two diagonal terms and two cross terms. The first diagonal term is (1−ϵ)JBXJB∗⊗∣eE⟩⟨eE∣, whose partial trace over E is (1−ϵ)JBXJB∗. The second is ϵ∣e⟩⟨e∣⊗JEXJE∗, whose partial trace is ϵtr⁡(X)∣e⟩⟨e∣. Each cross term has a partial-trace coefficient equal to the inner product of the orthogonal erasure flag with the data subspace, hence vanishes. Therefore Tr⁡E(VϵXVϵ∗)=Ed,ϵ(X) for every X.

3.1F2step 1.1step 2.1∎

By step 1.1, Vϵ is an isometry; [F2] says its partial-trace map is completely positive and trace-preserving on the full operator space. Step 2.1 identifies that map with Ed,ϵ, proving the Statement.

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

Degradable and antidegradable channels

Definition

Let N:A→B be a finite-dimensional channel and fix a complementary channel Nc:A→E coming from one finite Stinespring isometry. Relative to this chosen dilation, N is degradable if there exists a quantum channel D:B→E such that

Nc=D∘N.

It is antidegradable relative to this dilation if there exists a quantum channel A:E→B such that

N=A∘Nc.

All hypotheses and conclusions below use the same fixed complementary dilation and the corresponding degrading or antidegrading channel.

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

Coherent information equals output entropy minus environment entropy

Statement

Let N:A→B be a finite-dimensional channel, let V:A→B⊗E be a finite Stinespring isometry, let Nc(X)=Tr⁡B(VXV∗), and let ρ be a density operator on A. Then

Ic(ρ,N)=S(N(ρ))−S(Nc(ρ)).

The right-hand side is independent of the chosen Stinespring dilation, since it equals the purification-defined quantity in Complementary channels and coherent information.

Facts & Assumptions

Given: Nonzero finite-dimensional complex inner-product spaces A,B,E, a channel N:A→B, a Stinespring isometry V:A→B⊗E for N, and a density operator ρ on A.

[F1]

Complementary channels and coherent information: for a purification ∣ψ⟩∈A⊗R, Ic(ρ,N)=S(ωB)−S(ωBR), with ωBR=(N⊗id⁡R)(∣ψ⟩⟨ψ∣); the chosen complement is Nc(X)=Tr⁡B(VXV∗).

[F2]

Ensemble and purification and Purifications exist and are unitarily equivalent after padding: a purification is a unit vector ∣ψ⟩∈A⊗R with Tr⁡R∣ψ⟩⟨ψ∣=ρ, and such a finite purification exists.

[F3]

Schmidt decomposition: a finite pure bipartite vector has a Schmidt decomposition, so its two reduced density operators have the same positive eigenvalues with multiplicities.

[F4]

Every finite-dimensional channel has a finite isometric dilation: N(X)=Tr⁡E(VXV∗) for every input operator X.

[F5]

Finite-dimensional von Neumann entropy: S(τ)=−∑λj>0λjln⁡λj for the eigenvalues of a finite-dimensional density operator; zero eigenvalues contribute zero.

[F6]

Partial trace over a finite tensor factor, Partial trace over the first tensor factor, Ordered tensor registers, their inner product, and wire permutations, and Finite wire permutations are unitary basis permutations: ordered partial traces sum equal traced-factor indices; the factors of B⊗E⊗R can be reordered by a unitary wire permutation.

Proof

1.1givenF1F2F4F6construct

Choose a finite purification ∣ψ⟩∈A⊗R of ρ using [F2], and put ∣Ω⟩=(V⊗IR)∣ψ⟩∈B⊗E⊗R. Since V is an isometry, ∣Ω⟩ is a unit vector. Reorder to B⊗R⊗E using [F6]; tracing E gives ωBR because [F4] says Tr⁡E(VXV∗)=N(X). Tracing B and R gives Tr⁡B(VρV∗)=Nc(ρ): in the ordered product basis, the two finite partial-trace sums contract the R index to Tr⁡R∣ψ⟩⟨ψ∣=ρ and then contract the B index.

2.1F1F3F5step 1.1algebra∎

Regard the reordered ∣Ω⟩ as a bipartite vector across (B⊗R)∣E. By [F3], the positive eigenvalues of its BR and E marginals coincide. The entropy formula [F5] therefore gives S(ωBR)=S(Nc(ρ)). Substitute this identity into [F1] to obtain the displayed formula. As the left side of the formula is independent of both the purification and the chosen complement, the right side has the same value for every finite dilation.

Remarks

The equality is a consequence of the purity of the joint reference-output-environment state. It does not require a minimal Stinespring environment.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Private information of a finite channel ensemble

Definition

Let N:A→B be a finite-dimensional quantum channel, fix its complementary channel Nc:A→E, and let E={px,ρx}x∈X be a finite ensemble of density operators on A. Set ρˉ:=∑xpxρx. Its private information is

Ip(E,N):=χ({px,N(ρx)})−χ({px,Nc(ρx)}),

where χ is the Holevo information from Finite classical-quantum states and Holevo information; zero-probability terms are omitted. Equivalently, it is the mutual information between the classical label and the receiver output minus that between the label and the complementary output.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Finite cq wiretap achievability with strong Holevo secrecy

Statement

Fix any finite input ensemble (px,ρx) for a finite-dimensional channel N and a complement Nc. Let χB,χE be the Holevo informations of their output ensembles. Every 0<R<χB−χE admits uniform Mn-message codes with mixed input states, Bob POVMs, n−1ln⁡Mn→R, average error tending to zero, and unnormalized complementary-output Holevo leakage tending to zero. The construction has exponentially decaying average error and average trace distance to a fixed complementary product target; dimension-dependent entropy control converts the latter to strong Holevo secrecy.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Exponential averaged spectral projectors for a finite cq ensemble: Exponential averaged spectral projectors for a finite cq ensemble.

[F2]

Dimension-dependent quantum entropy continuity and Holevo control: Dimension-dependent quantum entropy continuity and Holevo control.

[F3]

Gentle measurement bound in finite dimensions: Gentle measurement bound in finite dimensions.

[F4]

Finite Hayashi–Nagaoka operator inequality: Finite Hayashi–Nagaoka operator inequality.

[F5]

Finite classical-quantum states and Holevo information: Finite classical-quantum states and Holevo information.

[F6]

Finite-dimensional quantum channel: Finite-dimensional quantum channel.

[F7]

Trace Norm Duality And Norm Properties: Trace Norm Duality And Norm Properties.

[F8]

Trace of a product of positive semidefinite matrices is nonnegative: Trace of a product of positive semidefinite matrices is nonnegative.

[F9]

Entropy bounds for a finite mixture of states: for every finite ensemble, its Holevo information is nonnegative.

[F10]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: the positive operator G has an orthonormal eigenbasis; its inverse square root on positive eigenvalues, extended by zero on the kernel, obeys G−1/2GG−1/2=Πsupp⁡G.

Proof

1.1F1F2F3F4F5F6F7F8F9givenalgebraconstruct

By [F9], χE≥0. Since R<χB−χE, choose r with χE<r and R+r<χB, and then choose η>0 so r>χE+2η and R+r<χB−2η. Take Mn=⌊enR⌋, Ln=⌈enr⌉ and draw MnLn independent words Xn(m,l) with law p⊗n. For message m, the encoder inputs the mixed state ρm,n=1Ln∑l=1Ln⨂i=1nρXi(m,l). This is a legitimate finite private randomization of the operational input state; the realized codebook is public.

2.1F1F2F3F4F5F6F7F8F10step 1.1givenalgebraconstruct

For Bob use the global and conditional spectral projectors P,Qxn from Exponential averaged spectral projectors for a finite cq ensemble, for the receiver ensemble. Put Γm,l=PQXn(m,l)P and G=∑m,lΓm,l. Each Γm,l is nonnegative and Γm,l⪯P⪯I. Using [F10], define G−1/2 spectrally on supp⁡G and as zero on ker⁡G, and set Λm,l=G−1/2Γm,lG−1/2 and Λ⊥=I−Πsupp⁡G. These are nonnegative and ∑m,lΛm,l+Λ⊥=G−1/2GG−1/2+I−Πsupp⁡G=I. Assign Λ⊥ to the pair (1,1); the resulting pair effects still sum to the identity, and coarsening them by m gives Bob's message POVM. For each pair, the Hayashi–Nagaoka inequality [F4] with S=Γm,l and T=∑(m′,l′)≠(m,l)Γm′,l′ bounds its pair-decoding error by twice its own projector failure plus four times its interference sum. The assigned failure effect only decreases the error for its designated pair. The estimate is valid without a uniform per-word projector-acceptance hypothesis: only its average is needed here. Specifically, E[1−tr⁡(Γm,lβXn(m,l))]≤εn+2εn, where εn≤Ce−cn bounds both averaged projector failures. This follows by tr⁡(QxPβxP)≥tr⁡(Qxβx)−∥PβxP−βx∥1 and the gentle-measurement bound followed by Jensen. For two different independent codewords, the spectral eigenvalue and rank bounds give Etr⁡(ΓjβXin)=tr⁡[(PEQXjnP)(Pβˉ⊗nP)]≤e−n(S(βˉ)−η)en(∑xpxS(βx)+η)=e−n(χB−2η). The equality uses the support of the first factor; the inequality uses positivity of the operator-order difference, not commutation of the two factors. Thus expected pair-error is at most 2(εn+2εn)+4MnLne−n(χB−2η), which decays exponentially. Coarsening the pair POVM to its message label cannot increase message error.

3.1F1F2F3F4F5F6F7F8step 2.1givenalgebraconstruct

For Eve let P,Qxn denote the spectral projectors for her ensemble, put sE=∑xpxS(ϵx), and define ξxn=PQxnϵxnQxnP,θ=EξXn. These operators satisfy 0⪯ξxn⪯e−n(sE−η)P, tr⁡ξxn≤1, and rank⁡P≤en(S(ϵˉ)+η). Their average truncation error obeys E∥ϵXn−ξXn∥1≤ζn:=εn+2εn. Indeed the conditional projector commutes with its state, so its trace-norm loss equals its failure probability. Its subnormalized output A satisfies 0⪯A⪯ϵxn, and the global-projection loss is at most 2tr⁡[(I−P)A]≤2tr⁡[(I−P)ϵxn]. The subnormalized gentle estimate follows by applying the normalized lemma to A/tr⁡A and multiplying back (the zero operator is immediate). Jensen gives the stated averaged bound.

4.1F1F2F3F4F5F6F7F8step 3.1givenalgebraconstruct∎

For the Ln independent words of a fixed message, centered Hilbert–Schmidt variance gives Etr⁡[(1Ln∑lξXn(m,l)−θ)2]=1Ln{Etr⁡(ξXn2)−tr⁡(θ2)}≤e−n(sE−η)Ln. All cross terms have zero expectation by independence. The difference is supported in P. Cauchy–Schwarz on singular values and Jensen imply E∥1Ln∑lξXn(m,l)−θ∥1≤en(χE+2η)Ln. Together with ∥θ−ϵˉ⊗n∥1≤ζn, this proves E∥τm,n−ϵˉ⊗n∥1≤2ζn+en(χE+2η)Ln,τm,n=(Nc)⊗n(ρm,n). The right side decays exponentially and is independent of m. Consequently the expectation of the sum of average decoding error and average half-trace distance from this target decays exponentially. The codebook sample space is finite, so order the finite word/codebook alphabet and select its first deterministic codebook whose sum is at most twice its expectation (or zero if that expectation vanishes). This defines a sequence without countable choices. For that codebook let an=Mn−1∑mT(τm,n,ϵˉ⊗n). The proved quantitative entropy estimate yields ℓn≤2annln⁡dim⁡E+2g(an)⟶0. This establishes the required unnormalized Holevo strong secrecy; a mere limit of trace distance without this dimension/error-rate estimate would not suffice. The average decoding error also tends to zero, while n−1ln⁡Mn→R. If the ensemble's private information is nonpositive it gives no positive lower bound; rate zero remains achievable with one message.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

Flat-input entanglement-assisted achievability by Weyl coding

Statement

Let τ=JJ∗/D be the flat state of a nonzero D-dimensional input subspace of a finite-dimensional channel N. With prior shared maximally entangled states on that subspace, every 0≤R<S(τ)+Ic(τ,N) is achievable for classical messages with average error tending to zero. The code consists of finite Weyl operations followed by a collective output/reference POVM; it has rate tending to R.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels: Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels.

[F2]

Complementary channels and coherent information: Complementary channels and coherent information.

[F3]

Coherent information equals output entropy minus environment entropy: Coherent information equals output entropy minus environment entropy.

[F4]

Schmidt decomposition: Schmidt decomposition.

[F5]

Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.

[F6]

Finite classical-quantum states and Holevo information: the ensemble Holevo information is S(ρˉ)−∑xpxS(ρx).

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the logarithm product law gives entropy additivity for finite product spectra and S(ID/D)=ln⁡D.

[F9]

The finite Weyl twirl is the normalized partial trace: the uniform finite Weyl conjugations on the second factor replace it by its maximally mixed state and retain the first-factor marginal, including dimension one.

Proof

1.1F1F2F3F4F5F9givenalgebraconstruct

Fix a D-dimensional subspace of the input, with embedding J and flat state τ=JJ∗/D. Share ∣ΦD⟩ between the sender's subspace and a receiver reference R. On the sender half apply the D2 Weyl unitaries, each uniformly likely, before the input embedding. The Weyl matrices in the fixed ordered basis are Uab∣j⟩=e2πibj/D∣j+a(modD)⟩. Reorder the shared state as R⊗CD using [F5]. Applying [F9] with retained factor R and twirled factor the sender's D-dimensional register gives IR/D⊗ID/D, since the retained marginal is IR/D. Reordering back gives ID/D⊗IR/D. The supplied finite root-of-unity calculation establishes the phase cancellation for every D≥1.

2.1F1F2F3F4F5F6F7F8step 1.1givenalgebraconstruct∎

Let σab be the joint output on BR of this finite cq alphabet through N. Because (Uab⊗I)∣ΦD⟩=(I⊗UabT)∣ΦD⟩ in coefficient coordinates, all σab are related by a unitary on R and have identical entropy S(Nc(τ)) by purity of the full Stinespring output and [F4]. Their average is N(τ)⊗IR/D. The spectral theorem [F8] and logarithm law [F7] give S(N(τ)⊗IR/D)=S(N(τ))+ln⁡D. Thus [F6] gives the ensemble Holevo information exactly as χ=ln⁡D+S(N(τ))−S(Nc(τ))=fN(τ). The HSW theorem applies to this fixed finite cq channel ab↦σab, with output BR. Each cq codeword is physically implemented by its sequence of Weyl operations on independent shared maximally entangled pairs. Its collective POVM is a permitted receiver measurement and its rate/error are exactly those of HSW. Therefore every nonnegative rate strictly below fN(τ) is entanglement-assisted achievable. Dimension D=1 is included: the one-letter ensemble then has Holevo information zero.

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

Finite channel information maxima are attained

Statement

Let N:A→B be a quantum channel between nonzero finite-dimensional complex inner-product spaces, and fix any finite Stinespring complement Nc:A→E. Both functions

ρ⟼Ic(ρ,N),ρ⟼S(ρ)+Ic(ρ,N)

attain a maximum on the density operators on A.

Facts & Assumptions

Given: The finite-dimensional channel and chosen complement in the Statement.

[F4]

Continuity of finite-dimensional quantum entropy: entropy is continuous in operator norm on each fixed finite-dimensional state space, including at states with zero eigenvalues.

[F5]

Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0 and For n≥1 all norms on Rn are equivalent: a linear map between finite-dimensional coordinate spaces is continuous, and the operator-norm topology agrees with the Euclidean coordinate topology.

[F7]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its maximum.

Proof

1.1F1F2F5F6givenconstructalgebra

Regard the self-adjoint endomorphisms of A as a real vector space of dimension d2, where d=dim⁡A≥1, using an orthonormal basis of A and the real diagonal and real/imaginary off-diagonal matrix coordinates. The state set is nonempty because IA/d is a state. It is closed: trace one and the self-adjoint matrix-coordinate equalities are closed conditions, and for each fixed x∈A, the quadratic form condition ⟨ρx,x⟩≥0 is closed by finite-dimensional continuity; [F1]–[F2] show their intersection is exactly the state set. It is bounded in the coordinate norm on Hermitian matrices: each eigenvalue lies in [0,1], so the operator norm is at most one; for standard basis vectors ei,ej, [F2] gives ∣⟨ρej,ei⟩∣≤1, hence all d2 real matrix coordinates are bounded. The operator and coordinate norms induce the same topology by [F5], so [F6] makes the state set compact in operator norm.

2.1F3F4F5step 1.1algebra

The channels N and Nc are finite-dimensional linear maps and hence continuous in operator norm by [F5]. Their outputs on states are states. By [F3]–[F4], ρ↦S(N(ρ))−S(Nc(ρ)) is continuous; adding the continuous function S(ρ) shows that the second displayed objective is continuous as well.

3.1F7step 1.1step 2.1∎

Apply [F7] to each of these two continuous real-valued functions on the nonempty compact state space from step 1.1. Each therefore attains its maximum, as asserted.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Complement and degradation maps of the erasure channel

Statement

For Ed,ϵ, choose the Stinespring isometry in The finite-dimensional erasure map is a quantum channel, with environment E=A⊕CeE. Its complement is

Ed,ϵc(X)=ϵJEXJE∗+(1−ϵ)tr⁡(X)∣eE⟩⟨eE∣.

The channel is degradable for 0≤ϵ≤12 and antidegradable for 12≤ϵ≤1.

Facts & Assumptions

Given: An input dimension d≥1 and erasure probability ϵ∈[0,1].

[F1]

Finite-dimensional quantum erasure channel: the receiver output space is the orthogonal sum of the data space and its erasure flag, and the data map is the isometric inclusion JB.

[F2]

Degradable and antidegradable channels: degradability means that a channel from B to E simulates the complement, and antidegradability means a channel from E to B simulates the original channel.

[F3]

The finite-dimensional erasure map is a quantum channel: Ed,ϵ is a finite-dimensional channel.

[F4]

A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.

[F5]

Trace preservation is Kraus normalization: a finite Kraus sum is trace-preserving when the sum of Kj∗Kj is the identity.

[F6]

Finite-dimensional quantum channel: a channel is complex-linear, completely positive, and trace-preserving.

Proof

1.1F1F3constructalgebra

Use the isometry Vϵx=1−ϵJBx⊗eE+ϵe⊗JEx from the proof of The finite-dimensional erasure map is a quantum channel. Tracing the first factor B leaves the data block ϵJEXJE∗ and the flag block (1−ϵ)tr⁡(X)∣eE⟩⟨eE∣; the cross terms vanish because the data and erasure subspaces are orthogonal. The data block precedes the flag block because E=A⊕CeE.

2.1F1F2F3F4F5F6step 1.1algebraconstructchoose

Suppose 0≤ϵ≤12 and set α=ϵ/(1−ϵ)∈[0,1]. Choose an orthonormal basis (uj)j<d of the data summand of B, and define the finite Kraus family from B to E by Kdata=αJEJB∗, Kj=1−α∣eE⟩⟨uj∣ for j<d, and Ke=∣eE⟩⟨eB∣. The sum of adjoint products is αΠA+(1−α)ΠA+∣eB⟩⟨eB∣=IB, so the induced map Dϵ(X)=∑KXK∗ is a channel by [F4]–[F6]. On an erasure-channel output, its data block has weight α(1−ϵ)X=ϵX and its flag block has weight [(1−α)(1−ϵ)+ϵ]tr⁡(X)=(1−ϵ)tr⁡(X). Thus DϵEd,ϵ=Ed,ϵc, proving degradability.

3.1F1F2F3F4F5F6step 1.1algebraconstructchoose∎

Suppose 12≤ϵ≤1 and set β=(1−ϵ)/ϵ∈[0,1]. Choose an orthonormal basis (ujE)j<d of the data summand of E and define a finite Kraus family from E to B by Ldata=βJBJE∗, Lj=1−β∣eB⟩⟨ujE∣ for j<d, and Le=∣eB⟩⟨eE∣. Its adjoint products sum to IE, so its Kraus map Aϵ is a channel by [F4]–[F6]. Applying it to the complement in step 1.1 gives data weight βϵX=(1−ϵ)X and erasure-flag weight [(1−β)ϵ+(1−ϵ)]tr⁡(X)=ϵtr⁡(X). Hence AϵEd,ϵc=Ed,ϵ, proving antidegradability. At ϵ=12 both parameters equal one and both relations hold.

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

Private information is an average coherent-information difference

Statement

Let N:A→B be a finite-dimensional channel with chosen complement Nc:A→E, and let E={px,ρx}x∈X be a finite ensemble on A with ρˉ=∑xpxρx. Then

Ip(E,N)=Ic(ρˉ,N)−∑x:px>0pxIc(ρx,N).

Facts & Assumptions

Given: The channel, chosen complementary channel, and finite ensemble in the Statement.

[F1]

Private information of a finite channel ensemble: Ip(E,N)=χ({px,N(ρx)})−χ({px,Nc(ρx)}).

[F2]

Finite classical-quantum states and Holevo information: χ({px,σx})=S(∑xpxσx)−∑x:px>0pxS(σx).

[F3]

Coherent information equals output entropy minus environment entropy: Ic(ρ,N)=S(N(ρ))−S(Nc(ρ)) for every finite input state and the chosen dilation.

Proof

1.1F1F3givenalgebra

Apply [F3] to ρˉ and to every ρx with px>0. Write Bx=N(ρx), Ex=Nc(ρx), Bˉ=∑xpxBx, and Eˉ=∑xpxEx. The difference of coherent informations becomes S(Bˉ)−S(Eˉ)−∑xpx(S(Bx)−S(Ex)).

2.1F1F2step 1.1algebra∎

Regrouping the finite sums in step 1.1 gives [S(Bˉ)−∑xpxS(Bx)]−[S(Eˉ)−∑xpxS(Ex)]. Each bracket is the corresponding Holevo information by [F2], so their difference is Ip(E,N) by [F1]. Terms with px=0 are absent in both sums.

Remarks

For a pure-state ensemble every branch has zero coherent information, because a Stinespring isometry maps each pure input to a pure output-environment vector. Thus its private information equals the coherent information of its average input.

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

Product additivity of coherent and private information

Statement

Let Ni:Ai→Bi be finite-dimensional channels. For input states ρi,

Ic(ρ1⊗ρ2,N1⊗N2)=Ic(ρ1,N1)+Ic(ρ2,N2).

For finite ensembles Ei={pxi(i),ρxi(i)}, their product ensemble satisfies

Ip(E1⊗E2,N1⊗N2)=Ip(E1,N1)+Ip(E2,N2).

Facts & Assumptions

Given: The two finite-dimensional channels, input states, and finite ensembles in the Statement.

[F1]

Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: coherent information for a fixed complement is S(B)−S(E).

[F2]

Private information of a finite channel ensemble: private information is the receiver Holevo quantity minus the complementary-output Holevo quantity.

Proof

1.1F3F4givenalgebra

Let τ and σ be density operators with positive eigenvalues (λi)i and (μj)j, respectively. By [F3], the product eigenvectors form an orthonormal eigenbasis of τ⊗σ with eigenvalues λiμj; zero eigenvalues contribute zero. Expanding the entropy sum and using [F4], ln⁡(λiμj)=ln⁡λi+ln⁡μj, gives S(τ⊗σ)=S(τ)+S(σ).

2.1F1step 1.1constructalgebra

Choose purifications ∣ψi⟩∈Ai⊗Ri of ρi. Their product purifies ρ1⊗ρ2. The joint output-reference states under the tensor-product channels and the complementary outputs under the product dilations are products. Applying step 1.1 to both entropy terms in [F1] proves the coherent-information equality.

3.1F2F3F4step 1.1algebra∎

The product ensemble has probabilities px1(1)px2(2) and product receiver and environment output states. Its average receiver and environment states are the corresponding products of the two ensemble averages. Apply step 1.1 to each average and each positive-probability conditional state. Substitution into the two Holevo differences in [F2] separates the finite double sums into the two one-ensemble private-information terms, proving the second equality.

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

Additivity of optimized entanglement-assisted information

Statement

For a finite-dimensional channel N:A→B, define

fN(ρ):=S(ρ)+Ic(ρ,N),F(N):=sup⁡ρ∈D(A)fN(ρ).

For any two finite-dimensional channels Ni:Ai→Bi,

F(N1⊗N2)=F(N1)+F(N2).

Facts & Assumptions

Given: The channels, finite input spaces, and coherent-information convention in the Statement.

[F1]

Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for a fixed dilation Ai→Bi⊗Ei, Ic(ρ,Ni)=S(Bi)−S(Ei).

[F2]

Finite quantum mutual, conditional, and conditional mutual information: I(X:Y)=S(X)+S(Y)−S(XY) for finite bipartite states.

[F3]

Data processing for finite quantum mutual information: applying local channels to two registers cannot increase their quantum mutual information.

[F4]

Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state, S(XY)+S(YZ)≥S(Y)+S(XYZ).

[F6]

The maximally mixed state maximizes finite quantum entropy: a density operator on a register of dimension d has entropy at most ln⁡d.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is increasing, ln⁡1=0, and ln⁡(xy)=ln⁡x+ln⁡y for positive x,y.

[F8]

Density operator and Finite-dimensional von Neumann entropy: a density operator is non-negative with trace one, and its entropy is −∑j:λj>0λjln⁡λj in an orthonormal eigenbasis.

Proof

1.1F2F4F7givenalgebra

Strong subadditivity [F4] with the middle register one-dimensional gives subadditivity S(XY)≤S(X)+S(Y) for every bipartite state: tensoring with the unique one-dimensional state leaves all nontrivial spectra unchanged. The proof of this consequence uses the natural-log entropy convention and its product-spectrum calculation, with [F7] supplying the logarithm product law. Thus I(X:Y)≥0 by [F2].

2.1F1F2F3step 1.1algebra

Fix an arbitrary state ρA1A2, and set ρi to its marginals, ωB1B2=(N1⊗N2)(ρ), and ηE1E2=(N1c⊗N2c)(ρ) using product Stinespring dilations. Expanding each entropy by [F1] and each mutual information by [F2] yields fN1⊗N2(ρ)−fN1(ρ1)−fN2(ρ2)=−I(A1:A2)ρ−I(B1:B2)ω+I(E1:E2)η. By [F3] applied to the local complementary channels, I(E1:E2)η≤I(A1:A2)ρ. Step 1.1 gives I(B1:B2)ω≥0, so the displayed difference is nonpositive. Therefore F(N1⊗N2)≤F(N1)+F(N2).

3.1F1F5F6F7F8step 2.1algebrachoose∎

For product inputs ρ1⊗ρ2, diagonalize each density operator using [F5]. The positive eigenvalues of the product are λiμj, so expanding −∑i,jλiμjln⁡(λiμj) and applying [F7] proves entropy additivity and hence fN1⊗N2(ρ1⊗ρ2)=fN1(ρ1)+fN2(ρ2). For any density operator, [F5] and [F8] give nonnegative eigenvalues summing to one, so every positive eigenvalue lies in (0,1]. Monotonicity and ln⁡1=0 in [F7] therefore make each term −λjln⁡λj nonnegative. Together with [F6], this bounds each of S(ρi), S(Ni(ρi)), and S(Nic(ρi)) between zero and the logarithm of its fixed register dimension, so fNi is bounded above and below and its supremum is finite. For any δ>0, choose ρi with fNi(ρi)>F(Ni)−δ. The product input gives F(N1⊗N2)≥F(N1)+F(N2)−2δ. Letting δ↓0 proves the reverse inequality.

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

Coherent information of a qudit erasure channel

Statement

Let Ed,ϵ be the finite-dimensional erasure channel with data dimension d≥1 and erasure probability ϵ∈[0,1], with the complementary dilation in Complement and degradation maps of the erasure channel. For every input state ρ,

Ic(ρ,Ed,ϵ)=(1−2ϵ)S(ρ).

Facts & Assumptions

Given: d≥1, ϵ∈[0,1], and the input state ρ in the Statement.

[F1]

Finite-dimensional quantum erasure channel and Complement and degradation maps of the erasure channel: respectively, the receiver state is (1−ϵ)ρ⊕ϵ∣eB⟩⟨eB∣ and the complementary state is ϵρ⊕(1−ϵ)∣eE⟩⟨eE∣ under the declared data-flag identifications.

[F2]

Coherent information equals output entropy minus environment entropy: Ic(ρ,E)=S(E(ρ))−S(Ec(ρ)).

[F3]

Entropy of a finite flagged state: S(pρ⊕(1−p)∣e⟩⟨e∣)=h(p)+pS(ρ), including p=0,1.

Proof

1.1F1F3givenalgebra

Apply [F3] to the two states in [F1]. Their entropies are h(ϵ)+(1−ϵ)S(ρ) and h(1−ϵ)+ϵS(ρ), respectively. By the definition of h and the logarithm product and reciprocal laws in Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, h(1−ϵ)=h(ϵ), including the endpoint convention 0ln⁡0=0.

2.1F2F3step 1.1algebracases∎

Subtract the complementary-output entropy from the receiver-output entropy as in [F2]. The equal binary-entropy terms from step 1.1 cancel, leaving (1−2ϵ)S(ρ). The derivation is valid at ϵ=0,1 by [F3], so no open-interval restriction is needed.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Operational quantum, private, and entanglement-assisted capacities

Definition

Let N:A→B be a finite-dimensional quantum channel and use its memoryless extension N⊗n:A⊗n→B⊗n. Rates use natural logarithms, so they are in nats per channel use. For code sizes Kn≥1, a rate R≥0 is achievable when lim inf⁡n→∞n−1ln⁡Kn≥R and the relevant error terms below tend to zero; each capacity is the supremum of its achievable rates.

For quantum transmission, a block code consists of an isometric encoder Wn:Mn→A⊗n and a quantum-channel decoder Dn:B⊗n→Mn, where dim⁡Mn=Kn. Let Rn≅Mn and let ∣ΦKn⟩∈Rn⊗Mn be a normalized maximally entangled vector. Its entanglement fidelity is

Fn:=⟨ΦKn∣(id⁡Rn⊗DnN⊗nWn)(∣ΦKn⟩⟨ΦKn∣)∣ΦKn⟩,

where Wn(X)=WnXWn∗. A rate is quantum-achievable if Fn→1; the resulting capacity is Q(N). This is the subspace entanglement-transmission convention.

For private classical transmission, a block code uses equiprobable messages m∈[Kn], input states ρm,n on A⊗n, and a decoding POVM {Λm,n}m=1Kn on B⊗n. Its average error is

en:=1−1Kn∑m=1Kntr⁡(Λm,nN⊗n(ρm,n)).

Fix a complementary channel Nc as in Complementary channels and coherent information. Eve's average state is τˉn=Kn−1∑m(Nc)⊗n(ρm,n). Define leakage by its Holevo information

ℓn:=S(τˉn)−1Kn∑m=1KnS((Nc)⊗n(ρm,n)).

A rate is privately achievable when en→0 and ℓn→0; this is strong secrecy in mutual-information form. The corresponding capacity is P(N). The value is independent of the chosen complementary dilation, as follows from Private information is an average coherent-information difference.

For classical transmission with prior shared entanglement, for each block length n the sender and receiver begin with a finite-dimensional shared state σSASB independent of the equiprobable message. For each m∈[Kn], the sender applies a quantum channel Em,n:L(SA)→L(A⊗n). The receiver measures B⊗n⊗SB with a POVM {Γm,n}m=1Kn. Its average error is

enEA:=1−1Kn∑m=1Kntr⁡ ⁣[Γm,n((N⊗n∘Em,n)⊗id⁡SB)(σSASB)]. A rate is achievable when this error tends to zero; there is no constraint on the dimension or consumption of the shared entanglement. The resulting capacity is CE(N).

The input, output, and reference registers are finite-dimensional in each block. No single-letter formula is included in these operational definitions.

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

Coherent-information concavity and subadditivity for degradable channels

Statement

Let Ni:Ai→Bi for i=1,2 be finite-dimensional degradable channels with complements Nic=Di∘Ni. Then ρ↦Ic(ρ,Ni) is concave and nonnegative. For every joint input state ρA1A2,

Ic(ρA1A2,N1⊗N2)≤Ic(ρA1,N1)+Ic(ρA2,N2).

Consequently the supremum coherent information of N1⊗N2 is the sum of the two single-channel suprema.

Facts & Assumptions

Given: The finite-dimensional degradable channels and joint input state in the Statement.

[F1]

Degradable and antidegradable channels: Nic=Di∘Ni for a finite-dimensional channel Di.

[F2]

Private information is an average coherent-information difference: Ip(E,N)=Ic(ρˉ,N)−∑xpxIc(ρx,N).

[F3]

Finite quantum mutual information identities and the Holevo identity: for a finite classical-quantum state, its mutual information equals its Holevo information.

[F4]

Data processing for finite quantum mutual information: local channels on either register cannot increase finite quantum mutual information.

[F5]

Coherent information equals output entropy minus environment entropy: Ic(ρ,N)=S(N(ρ))−S(Nc(ρ)).

[F6]

Finite quantum mutual, conditional, and conditional mutual information: quantum mutual information is defined by I(X:Y)=S(X)+S(Y)−S(XY).

[F8]

Product additivity of coherent and private information: coherent information is additive on product input states for product channels.

[F9]

Schmidt decomposition: the receiver and environment marginals of the pure Stinespring output of a pure input have the same positive eigenvalues.

[F10]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡(xy)=ln⁡x+ln⁡y for positive x,y; it supports the cq entropy identity stated in [F3].

Proof

1.1F1F2F3F4F10givenalgebra

Fix a finite input ensemble E={px,ρx} with average ρˉ. By [F2] and [F3], Ip(E,Ni)=I(X;Bi)−I(X;Ei), where Bi and Ei denote the receiver and complementary output registers for the ensemble. The finite cq entropy calculation uses the block eigenvalues pxλxj and the logarithm product law [F10]. Since Ei is obtained from Bi by Di in [F1], [F4] gives I(X;Ei)≤I(X;Bi). Thus Ip(E,Ni)≥0.

1.2F1F2F4F5F6algebra

For a joint state ρA1A2, write ρi for its marginals, ωB1B2=(N1⊗N2)(ρ), and ηE1E2=(N1c⊗N2c)(ρ). Expanding the entropies in [F5] and using [F2], [F6] gives Ic(ρ,N1⊗N2)−Ic(ρ1,N1)−Ic(ρ2,N2)=−I(B1:B2)ω+I(E1:E2)η. The tensor product D1⊗D2 maps ω to η, so [F4] gives I(E1:E2)η≤I(B1:B2)ω. The right side is therefore nonpositive, proving the claimed inequality.

2.1F2step 1.1algebra

Rewrite the inequality Ip(E,Ni)≥0 using [F2]. For every finite ensemble with average ρˉ, this yields Ic(ρˉ,Ni)≥∑xpxIc(ρx,Ni), which is exactly concavity of coherent information on the finite-dimensional state space.

3.1F5F7F9step 2.1algebraconstruct

Let ρ=∑jλj∣uj⟩⟨uj∣ be a spectral decomposition from [F7]. For each pure ∣uj⟩, an isometric Stinespring dilation produces a pure receiver-environment vector, so the two marginal entropies agree by [F9] and [F5] gives Ic(∣uj⟩⟨uj∣,Ni)=0. Concavity from step 2.1 therefore implies Ic(ρ,Ni)≥∑jλj⋅0=0.

4.1F8step 1.2algebrachoose∎

The inequality in step 1.2 gives the upper bound on the optimized coherent information. Product inputs give equality by [F8]; choosing inputs within arbitrary δ>0 of each finite supremum and letting δ↓0 proves additivity of the supremum.

The proof uses the finite entropy-identity and strong-subadditivity interfaces listed above. Their source status does not alter the stated mathematical hypotheses.

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

Regularized coherent-information formula for quantum capacity


Statement

Let N:A→B be a finite-dimensional memoryless quantum channel. For n≥1, put

qn(N):=sup⁡ρ∈D(A⊗n)Ic(ρ,N⊗n).

Under the subspace entanglement-transmission convention in Operational quantum, private, and entanglement-assisted capacities,

Q(N)=lim⁡n→∞qn(N)n=sup⁡n≥1qn(N)n.

No general single-letter or additivity assertion is made.

Facts & Assumptions

Given: The finite-dimensional memoryless channel and quantum-capacity convention in the Statement.

[F7]

Density operator: a rank-one projection onto a unit vector is a density operator.

[F1]

Complementary channels and coherent information: Ic(ρ,N)=S(B)−S(RB) for a finite purification.

[F2]

Product additivity of coherent and private information: coherent information is additive on product input states for product channels.

[F3]

The maximally mixed state maximizes finite quantum entropy and Finite-dimensional von Neumann entropy: every state has S≥0 by the eigenvalue formula and S≤ln⁡D on a D-dimensional register.

[F4]

Limit formula for linearly bounded superadditive sequences: a linearly bounded superadditive sequence has normalized limit equal to its supremum.

[F5]

Coherent information equals output entropy minus environment entropy and Schmidt decomposition: a pure input has zero coherent information because its receiver and environment outputs are the two marginals of a pure Stinespring output.

[F6]

The product basis is orthonormal and tensor dimensions multiply and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: dim⁡(B⊗n)=(dim⁡B)n and ln⁡(dim⁡(B⊗n))=nln⁡(dim⁡B).

[F8]

Exact flat spectral-type reduction of channel information: Exact flat spectral-type reduction of channel information.

[F9]

Flat-input coherent information is achievable by subspace codes: Flat-input coherent information is achievable by subspace codes.

[F10]

Dimension-dependent quantum entropy continuity and Holevo control: Dimension-dependent quantum entropy continuity and Holevo control.

[F11]

Fuchs Van De Graaf: Fuchs Van De Graaf.

[F12]

Partial trace contracts the trace norm on Hermitian operators: Partial trace contracts the trace norm on Hermitian operators.

[F13]

Data processing for finite quantum mutual information: Data processing for finite quantum mutual information.

[F14]

Finite quantum mutual, conditional, and conditional mutual information: I(R:B)=S(R)+S(B)−S(RB).

[F15]

The logarithm grows more slowly than every positive real power: ln⁡x/x→0 as x→∞.

Proof

First establish the information-sequence limit, then prove the operational direct and converse bounds.

1.1F1F3F5F6F7givenalgebra

Set q0=0. A unit vector in the nonzero space A⊗n defines a pure input state by [F7]. Its Stinespring output on receiver and environment is pure; its two marginals have equal entropy by the Schmidt decomposition in [F5], so the coherent-information/complement identity in [F5] gives zero. For every input state, [F1] gives Ic=S(Bn)−S(RBn)≤S(Bn) because entropy is nonnegative by [F3]. The state Bn lies on a space of dimension (dim⁡B)n by [F6], so [F3] gives S(Bn)≤nln⁡dim⁡B. Thus 0≤qn≤nln⁡dim⁡B.

2.1F2F4step 1.1algebrachoose

For positive m,n, choose states within δ>0 of the respective suprema qm and qn. Their product is an admissible input for N⊗(m+n), and [F2] makes its coherent information the sum of the two values. Letting δ↓0 gives qm+n≥qm+qn. The linear bound in step 1.1 and [F4] show that qn/n converges to sup⁡n≥1qn/n.

3.1F8F9F10F11F12F13F15step 2.1givenalgebraconstruct

For any state ρ, apply the exact type reduction to ρ⊗m and choose a type with Ic(τt,N⊗m)≥mIc(ρ,N)−dln⁡(m+1). Restrict the input of the m-use channel to that type subspace and apply the flat-input direct construction. Concatenating the type embedding with its isometric code preserves the operational encoder condition. Thus Q(N)≥Ic(ρ,N)−dln⁡(m+1)m. Here and below a negative right side is covered by rate zero. To pass from codes of length divisible by m to all lengths n, take k=⌊n/m⌋, use the k-block code, and pad the remaining fewer than m inputs with a fixed pure state; the decoder discards their outputs. Fidelity is unchanged and the rate loss tends to zero. Since ln⁡(m+1)/m=((m+1)/m) ln⁡(m+1)/(m+1)→0 by [F15], letting m→∞ gives Q(N)≥Ic(ρ,N). Applying this result to any fixed block channel N⊗j and padding again gives Q(N)≥qj/j for every j, and therefore the full regularized direct bound.

4.1F1F8F9F10F11F12F13F14step 3.1givenalgebraconstruct∎

For a length-n isometric code of dimension K, let ρ=W(IK/K)W∗, let ζRM be its decoded entangled state, and put t=T(ζ,ΦK). Write g(t)=(1+t)ln⁡(1+t)−tln⁡t, with g(0)=0. Fuchs–van de Graaf gives t≤1−Fn, because Fn is the squared overlap with the pure target. Partial-trace contraction gives T(ζM,IK/K)≤t. Quantitative continuity on dimensions K and K2 yields S(M)ζ≥ln⁡K−tln⁡K−g(t),S(RM)ζ≤2tln⁡K+g(t). Thus decoded coherent information is at least (1−3t)ln⁡K−2g(t). By [F14] and [F1], I(R:B)=S(R)+Ic for the pre-decoding purification and analogously after decoding. The reference entropy is unchanged, and data processing [F13] applied to I(R;B) gives S(B)−S(RB)≥S(M)−S(RM). Before decoding, the purification is the encoded half-maximally-entangled state, so its coherent information equals Ic(ρ,N⊗n)≤qn. Consequently qn≥(1−3t)ln⁡K−2g(t). For a reliable code sequence t→0, and K≤(dim⁡A)n because the encoder is isometric. Divide by n and use this uniform dimension bound to conclude that the limsup code rate is at most lim⁡qn/n. Dimension-one codes need no continuity estimate. Combining the converse, the direct bound for every fixed block, and the stated proved superadditive limit gives exactly the retained full quantum-capacity statement.

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

Regularized private-information formula for quantum channel capacity


Statement

Let N:A→B be a finite-dimensional memoryless quantum channel. For each n≥1, let

pn(N):=sup⁡EnIp(En,N⊗n),

where the supremum ranges over all finite ensembles of input states on A⊗n. Under the strong-secrecy, average-error convention in Operational quantum, private, and entanglement-assisted capacities,

P(N)=lim⁡n→∞pn(N)n=sup⁡n≥1pn(N)n.

This statement is regularized and asserts no general single-letter formula.

Facts & Assumptions

Given: The finite-dimensional memoryless channel and private-capacity convention in the Statement.

[F1]

Private information of a finite channel ensemble and Private information is an average coherent-information difference: for a finite ensemble, Ip=χ(X;B)−χ(X;E), where E is the complementary output.

[F3]

Strong subadditivity of finite-dimensional quantum entropy: strong subadditivity with a one-dimensional middle register implies I(X;E)≥0.

[F4]

Product additivity of coherent and private information: product ensembles on tensor-product channels have additive private information.

[F5]

Limit formula for linearly bounded superadditive sequences: a linearly bounded superadditive sequence an with a0=0 satisfies lim⁡an/n=sup⁡n≥1an/n.

[F6]

The maximally mixed state maximizes finite quantum entropy and Finite-dimensional von Neumann entropy: on a state space of dimension D, S(ρ)≤ln⁡D, and the eigenvalue formula gives S(ρ)≥0.

[F7]

Finite classical-quantum states and Holevo information: χ({px,σx})=S(∑xpxσx)−∑xpxS(σx).

[F8]

The product basis is orthonormal and tensor dimensions multiply and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: dim⁡(B⊗n)=(dim⁡B)n and ln⁡(dim⁡(B⊗n))=nln⁡(dim⁡B).

[F9]

Finite cq wiretap achievability with strong Holevo secrecy: Finite cq wiretap achievability with strong Holevo secrecy.

[F10]

Finite-alphabet Fano inequality: Finite-alphabet Fano inequality.

[F11]

The finite Holevo measurement bound: The finite Holevo measurement bound.

[F12]

Finite entropy and mutual-information chain rules: I(M;M^)=H(M)−H(M∣M^) for finite classical variables.

[F13]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the logarithm product law used in the cq entropy identity supplied by [F2].

Proof

First establish the information-sequence limit, then prove strong-secrecy achievability and the operational converse.

1.1F1F2F3F6F7F8F13givenalgebra

Write pn=pn(N). The one-state ensemble has private information zero, so pn≥0. For any finite ensemble, [F1]–[F3] give Ip=I(X;Bn)−I(X;En)≤I(X;Bn), since [F3] implies I(X;En)≥0. By [F2], [F7], and the logarithm law [F13], I(X;Bn)=S(Bn)−∑xpxS(Bx)≤S(Bn) because each conditional output entropy is nonnegative by [F6]. The output dimension and logarithm identity in [F8], together with [F6], give S(Bn)≤nln⁡dim⁡B. Therefore 0≤pn≤nln⁡dim⁡B.

2.1F4F5step 1.1algebrachoose

For positive integers m,n, choose finite ensembles whose private informations are within an arbitrary δ>0 of pm and pn. Their product ensemble is finite and, by [F4], has private information equal to the sum. Thus pm+n≥pm+pn−2δ. Letting δ↓0 proves superadditivity; define p0=0. The linear bound in step 1.1 and [F5] now prove that pn/n converges to its supremum.

3.1F8F9F10F11step 2.1givenalgebraconstruct

Apply the construction to any finite ensemble of inputs for a fixed block channel N⊗j. Each code uses a finite average of tensor products of those possibly mixed block inputs, permitted by the operational model. Group its blocks and pad fewer than j leftover original-channel uses with a fixed state. The extra complementary state is independent of the message; product spectral eigenvalues and the logarithm law [F8] show that its entropy adds the same constant to the average and every conditional output entropy, so leakage is unchanged. The decoder discards the extra receiver output. Hence P(N)≥pj/j for every j: approximate the finite-ensemble supremum first, then take an arbitrary rate strictly below its private information. The stated Fekete argument gives the entire regularized direct bound.

4.1F9F10F11F12F13step 3.1givenalgebraconstruct∎

For any uniform M-message code, let M^ be Bob's decoded message and e its average error. Write h(u)=−uln⁡u−(1−u)ln⁡(1−u), with continuous endpoint values. The finite Fano inequality gives H(M∣M^)≤h(e)+eln⁡(M−1)≤h(e)+eln⁡M for M≥2. By [F12], I(M;M^)=H(M)−H(M∣M^), and H(M)=ln⁡M for the uniform message. The logarithm law used in the finite chain-rule proof is also supplied by [F13]. The Holevo measurement bound [F11], applied to the finite receiver ensemble, gives I(M;M^)≤χB. Therefore (1−e)ln⁡M≤χB+h(e). The uniform input ensemble {M−1,ρm,n} is among those defining pn, and its private information is χB−ℓn. Thus (1−e)ln⁡M≤pn+ℓn+h(e). For M=1, the desired asymptotic bound is trivial. For a reliable strongly secret sequence, divide by n; since pn/n is bounded and en→0, the displayed inequality itself bounds ln⁡Mn/n, even though no dimension-based bound on the number of repeated classical messages was assumed. The terms ℓn/n and h(en)/n vanish. This proves the converse for the stated liminf-achievable rate convention and the retained full equality P=lim⁡npn/n=sup⁡npn/n.

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

Additive entanglement-assisted classical capacity formula


Statement

Let N:A→B be a finite-dimensional quantum channel. Under the shared-entanglement coding convention in Operational quantum, private, and entanglement-assisted capacities,

CE(N)=max⁡ρ∈D(A)(S(ρ)+Ic(ρ,N))=max⁡ρ∈D(A)I(R;B)(id⁡R⊗N)(ψρ),

where ψρ is any finite purification of ρ on R⊗A. The value is additive: CE(N1⊗N2)=CE(N1)+CE(N2) for finite-dimensional channels.

Facts & Assumptions

Given: The finite-dimensional channels, prior shared entanglement, and purification convention in the Statement.

[F1]

Complementary channels and coherent information, Finite-dimensional von Neumann entropy, and Schmidt decomposition: for a purification ψRA, Ic(ρ,N)=S(B)−S(RB) and S(R)=S(ρ).

[F2]

Finite quantum mutual, conditional, and conditional mutual information: I(R;B)=S(R)+S(B)−S(RB).

[F3]

Finite channel information maxima are attained: the finite-dimensional maximum of S(ρ)+Ic(ρ,N) exists.

[F4]

Additivity of optimized entanglement-assisted information: F(N):=sup⁡ρ[S(ρ)+Ic(ρ,N)] is additive for tensor-product channels.

[F5]

Flat-input entanglement-assisted achievability by Weyl coding: Flat-input entanglement-assisted achievability by Weyl coding.

[F6]

Exact flat spectral-type reduction of channel information: Exact flat spectral-type reduction of channel information.

[F7]

Every finite extension is obtained from a purification by a channel: Every finite extension is obtained from a purification by a channel.

[F8]

Data processing for finite quantum mutual information: Data processing for finite quantum mutual information.

[F9]

Finite-alphabet Fano inequality: Finite-alphabet Fano inequality.

[F10]

The finite Holevo measurement bound: The finite Holevo measurement bound.

[F11]

Finite entropy and mutual-information chain rules: for finite classical messages, I(M;M^)=H(M)−H(M∣M^).

[F12]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm product law used by the finite entropy chain rule and type entropy calculation.

[F13]

The logarithm grows more slowly than every positive real power: ln⁡x/x→0 as x→∞.

[F14]

Strong subadditivity of finite-dimensional quantum entropy: with a one-dimensional middle register, strong subadditivity gives S(SB)≤S(S)+S(B) and hence I(S:B)≥0.

[F15]

Finite quantum mutual information identities and the Holevo identity: for the finite cq output ensemble, I(M:BnS) is its Holevo information; the required logarithm product law is included in [F12].

Proof

1.1F1F2F3givenalgebra

For any purification ψRA, its reference marginal is ρR with the same positive eigenvalues as ρA, so S(R)=S(ρ) by [F1]. Substituting [F1] into [F2] gives I(R;B)=S(ρ)+Ic(ρ,N). Thus the two maximized information expressions in the Statement agree, and [F3] supplies their maximizers.

1.2F4algebra

By [F4], the optimized one-use information is additive across every finite tensor power; hence its regularized information value is the same one-use maximum. This proves additivity for the information expression itself.

2.1F5F6F7F8F9F10F13step 1.2givenalgebraconstruct

For any input state ρ and positive integer m, exact spectral type reduction gives a flat state τt on an m-use input subspace such that fN⊗m(τt)≥mfN(ρ)−2dln⁡(m+1),d=dim⁡A. Apply the flat-state construction to that fixed block channel. For fixed m, both its Weyl alphabet and its receiver output dimension are finite, so the HSW theorem applies before any limit in m is taken. The shared resource is the flat type-subspace maximally entangled state for each outer block. Padding fewer than m unused original-channel inputs with a fixed state gives codes for all sufficiently large lengths and no asymptotic rate loss. Therefore CE(N)≥fN(ρ)−2dln⁡(m+1)m. Since ln⁡(m+1)/m→0 by [F13], letting m→∞ and maximizing over ρ proves the general direct bound with precisely the stated unlimited finite-shared-entanglement model. No unrestricted quantum-input HSW single-letter theorem and no inference from Schumacher compression alone is used.

3.1F5F6F7F8F9F10F11F12F14F15step 2.1givenalgebraconstruct∎

Consider any length-n stated EA code with uniform message register M, receiver's prior share S, channel input An, and receiver output BnS. Before transmission its joint state is ωMAnS=1K∑m∣m⟩⟨m∣⊗(Em⊗id⁡S)(σ). The marginal MS is the product of the uniform message and the original share: each encoder is trace-preserving and hence cannot change S. In particular I(M:S)=0. Let ρˉAn be its average input. By the extension lemma, the MSAn state is obtained by a channel on the reference of a purification of ρˉAn. After transmission, quantum-mutual-information data processing gives I(MS:Bn)≤I(R:Bn)(id⁡⊗N⊗n)(ψρˉ). Expanding the entropy definitions gives the exact identity I(M:BnS)=I(MS:Bn)−I(S:Bn)+I(M:S). The last term is zero, and [F14] gives I(S:Bn)≥0. Therefore I(M:BnS)≤I(R:Bn)≤F(N⊗n)=nF(N). The equality uses the stated optimized-information additivity lemma, whose proof follows local-channel mutual-information data processing and product-state entropy additivity. Write h(u)=−uln⁡u−(1−u)ln⁡(1−u) with continuous endpoint values. By [F11], I(M;M^)=H(M)−H(M∣M^); [F15] identifies I(M:BnS) with the Holevo quantity of the cq output state, and the Holevo measurement bound [F10] gives I(M;M^)≤I(M:BnS). Fano then gives (1−en)ln⁡Kn≤nF(N)+h(en). Singleton message sets are trivial. Divide by n and let average error tend to zero to bound every achievable rate by F(N), without restricting the shared state, its dimension, or the message-dependent CPTP encoders. Together with the general direct bound, purification identity and attained maximum, this proves the entire retained operational formula. Finally applying the identity CE=F to both channels and their product, and using the stated proved additivity of F, proves the capacity additivity assertion as well.

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

Single-letter quantum and private capacities of degradable channels

Statement

Let N:A→B be a finite-dimensional degradable channel with a fixed complement Nc. Then

Q(N)=P(N)=max⁡ρ∈D(A)Ic(ρ,N),

and both regularizations in the quantum and private capacity formulas collapse to this one-use maximum.

Facts & Assumptions

Given: The finite-dimensional degradable channel and chosen complement in the Statement.

[F1]

Degradable and antidegradable channels: a degrading channel D:B→E satisfies Nc=D∘N.

[F2]

Coherent-information concavity and subadditivity for degradable channels: for a degradable channel, coherent information is concave and nonnegative; for product degradable channels it is subadditive on joint inputs and its optimized value is additive.

[F3]

Finite channel information maxima are attained: the finite-dimensional coherent information maximum is attained.

[F4]

Regularized coherent-information formula for quantum capacity and Regularized private-information formula for quantum channel capacity: the general capacities equal their regularized coherent-information and private-information sequences, respectively.

[F5]

Private information is an average coherent-information difference: for an ensemble {px,ρx}, Ip=Ic(ρˉ,N)−∑xpxIc(ρx,N).

Proof

1.1F1F2F3F4givenalgebra

The tensor power of a degradable channel is degradable: the product degrading map D⊗n is a channel by Finite-dimensional channels compose and tensor, and it maps (N⊗n)(ρ) to (Nc)⊗n(ρ). Therefore [F2] gives sup⁡ρIc(ρ,N⊗n)=nmax⁡ρIc(ρ,N). Substituting in the regularized quantum formula [F4] yields Q(N)=max⁡ρIc(ρ,N).

2.1F2F5step 1.1algebra

For any n-use input ensemble {px,ρx}, its tensor-power channel is degradable by step 1.1. By [F5], its private information is the coherent information of the average minus the average branch coherent information. Each branch term is nonnegative by [F2], so this private information is at most Ic(ρˉ,N⊗n)≤nmax⁡ρIc(ρ,N). Hence the n-use private-information supremum has the same upper bound.

3.1F2F3F4F5F6step 2.1algebraconstruct

Choose a maximizing state ρ∗ using [F3], and decompose it spectrally as ρ∗=∑jpj∣uj⟩⟨uj∣ using [F6]. For a pure input ∣uj⟩⟨uj∣, choose a one-dimensional purification reference; the joint output-reference state has the same nonzero eigenvalues as N(∣uj⟩⟨uj∣), so the defining formula in Complementary channels and coherent information gives Ic(∣uj⟩⟨uj∣,N)=0. Therefore the pure-state ensemble has private information Ic(ρ∗,N) by [F5]. Thus p1≥max⁡ρIc(ρ,N); step 2.1 with n=1 gives the reverse inequality, and step 2.1 for all n gives pn/n≤max⁡ρIc(ρ,N). The regularized formula [F4] therefore yields P(N)=max⁡ρIc(ρ,N).

4.1step 1.1step 3.1algebra∎

The identities in steps 1.1 and 3.1 prove the stated equality and remove both regularizations.

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

Exact quantum, private, and entanglement-assisted erasure capacities

Statement

For the finite-dimensional flagged erasure channel Ed,ϵ with input dimension d≥1 and erasure probability ϵ∈[0,1],

Q(Ed,ϵ)=P(Ed,ϵ)=max⁡{1−2ϵ,0}ln⁡d,CE(Ed,ϵ)=2(1−ϵ)ln⁡d.

All capacities are in nats per channel use. The unassisted quantum and private formulas are zero in the antidegradable regime ϵ≥1/2.

Facts & Assumptions

Given: A data dimension d≥1, erasure probability ϵ∈[0,1], and the capacity conventions in the Statement.

[F1]

Coherent information of a qudit erasure channel: Ic(ρ,Ed,ϵ)=(1−2ϵ)S(ρ).

[F2]

Complement and degradation maps of the erasure channel: the channel is degradable for ϵ≤1/2 and antidegradable for ϵ≥1/2.

[F3]

Single-letter quantum and private capacities of degradable channels: for a degradable channel, Q=P=max⁡ρIc(ρ,N).

[F5]

Data processing for finite quantum mutual information: applying a channel to one register cannot increase finite quantum mutual information.

[F6]

Finite quantum mutual, conditional, and conditional mutual information: I(R;B)=S(R)+S(B)−S(RB) for finite bipartite states.

[F7]

Private information is an average coherent-information difference: private information is I(X;B)−I(X;E) for a finite input ensemble and its complementary output.

[F8]

The maximally mixed state maximizes finite quantum entropy: S(ρ)≤ln⁡d, with equality at I/d.

[F9]

Finite-dimensional channels compose and tensor: tensor products of finite-dimensional channels are channels and tensor products of complements implement the product dilation.

[F10]

Coherent information equals output entropy minus environment entropy: coherent information equals receiver-output entropy minus complementary-output entropy for every finite channel and fixed dilation.

Proof

1.1F1F8givenalgebra

By [F1] and [F8], the coherent information of an input state is (1−2ϵ)S(ρ), with S(ρ)≤ln⁡d and S(ρ)≥0. If ϵ≤1/2, its maximum is (1−2ϵ)ln⁡d, attained at I/d.

1.2F2F4F5F6F9F10givenalgebra

Now suppose ϵ≥1/2. By [F2], there is an antidegrading channel A:E→B with E=A∘Ec. Its tensor powers are channels by [F9]. For any n-use input state and purification reference R, [F5] gives I(R;Bn)≤I(R;En). The joint state RBnEn from a product Stinespring isometry is pure, so Schmidt decomposition gives S(RBn)=S(En) and S(REn)=S(Bn). By the mutual-information definition [F6], I(R;Bn)−I(R;En)=S(Bn)−S(En)−S(RBn)+S(REn)=2[S(Bn)−S(En)]=2Ic(ρ,E⊗n), where the last equality is [F10]. Hence the data-processing inequality forces Ic(ρ,E⊗n)≤0. A pure input attains zero, so the n-use coherent-information supremum is zero and [F4] gives Q=0.

2.1F2F3step 1.1algebra

For ϵ≤1/2, [F2] says the channel is degradable; applying [F3] to step 1.1 gives Q=P=(1−2ϵ)ln⁡d. This includes ϵ=1/2, where the value is zero.

2.2F4F5F6F7step 1.2algebra

For any finite n-use ensemble, [F7] and [F6] express private information as I(X;Bn)−I(X;En). The antidegrading channel on En and [F5] make this difference nonpositive. The singleton ensemble has private information zero, so each n-use private-information supremum is zero; [F4] gives P=0.

3.1F1F4F8algebra∎

By [F1] and [F4], the entanglement-assisted objective is S(ρ)+Ic(ρ,Ed,ϵ)=2(1−ϵ)S(ρ). Since 2(1−ϵ)≥0, [F8] makes its maximum 2(1−ϵ)ln⁡d, proving the final formula.

5 · Examples, counterexamples and false statements

None yet.

Sources