How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Quantum Channel Capacities and Entanglement Assistance
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Channels, Kraus, Choi, and Stinespring Representations
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite basis projector energies and variational electronic structure
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Finite-Alphabet Entropy and Divergence
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- IID Lossless Source Coding and the AEP
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Knill–Laflamme Recovery and Subsystem Codes
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Combinations of Unitaries and Taylor Simulation
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measurements, POVMs, and Instruments
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Quantum Communication and Fingerprinting
- Quantum Information Measures
- Quantum Optimization, Semidefinite Programs, and Variational Algorithms
- Quantum Relative Entropy, Data Processing, and Strong Subadditivity
- Quantum Source Compression and Classical Communication over Quantum Channels
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trace Distance, Fidelity, and Information Limits
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Trust region and cubic regularization methods
- Uniform Spaces: the Three Definitions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
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 and channel input , coherent information is . A Stinespring dilation gives , 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 , 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 : for it is degradable, for it is antidegradable, and at 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
Entropy bounds for a finite mixture of states
Statement
For states and finite probabilities , put . Then
Facts & Assumptions
Given: A common nonzero finite-dimensional space , a finite probability vector , and density operators on . The Shannon entropy is in nats: , with .
Finite-dimensional von Neumann entropy: Finite-dimensional von Neumann entropy.
Nonnegativity and equality for finite quantum relative entropy: Nonnegativity and equality for finite quantum relative entropy.
Schmidt decomposition: Schmidt decomposition.
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'.
Finite-dimensional quantum relative entropy and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: on support inclusion, , and for positive .
Proof
Omit zero weights. For each with , is non-negative. If , then . All terms are nonnegative, so implies and [F5] gives . Hence and every is finite. The trace formula [F6], linearity of trace [F4], and give by [F2].
For the upper bound, diagonalize each , omitting zero weights and eigenvalues, and purify the mixture as . Its label marginal is a state with diagonal and has the same nonzero eigenvalues as by Schmidt decomposition. The logarithm product law in [F6] gives .
For , its kernel is spanned by coordinate labels with . Each such basis vector has , so [F5] gives . Hence annihilates and . The formula [F6] now gives This proves both bounds, including singleton/zero-weight cases.
Exponential averaged spectral projectors for a finite cq ensemble
Statement
For every fixed finite ensemble and fixed , there are constants (depending on this ensemble and , not ) and projectors such that, writing and , and 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.
Finite-dimensional von Neumann entropy: Finite-dimensional von Neumann entropy.
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.
Finite classical-quantum states and Holevo information: Finite classical-quantum states and Holevo information.
Taylor's Schlömilch–Roche remainder formula: Taylor's Schlömilch–Roche remainder formula.
The exponential function is smooth and : The exponential function is smooth and .
Markov's inequality for random variables: Markov's inequality for random variables.
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
For , retain product eigenvectors of whose positive eigenvalue has negative logarithm in . For , use product eigenvectors of whose eigenvalue has negative logarithm in . The upper eigenvalue bounds are immediate. The lower retained eigenvalue and trace at most one imply each rank bound. Under the joint law , with zero-probability eigenvalues omitted, the random variable has finite support and mean . 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 .
For completeness, a finite supported centered variable with obeys , by the Taylor remainder and . For small fixed , . Markov's inequality and independence then bound ; the logarithm product law [F7] gives the factor when taking the log of the product moment generating function. Apply the same argument to 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.
Finite unitary averaging and a decoupling second-moment bound
Statement
Let , , and with , , and . For every there is an explicitly specified finite probability ensemble of isometries such that, for one has At the same time the ensemble can be required to satisfy, for every Hermitian , 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.
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.
Trace Norm Duality And Norm Properties: Trace Norm Duality And Norm Properties.
Cauchy–Schwarz: , with equality exactly for linearly dependent vectors: Cauchy–Schwarz: , with equality exactly for linearly dependent vectors.
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'.
Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: for a positive operator, zero quadratic form implies that the vector lies in its kernel.
Trace Norm Unitary Invariance And Positive Formula: the trace norm of a positive operator is its trace.
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.
Complex de Moivre formula for every integer exponent, , and exactly when , and , , and : has modulus one and exactly when divides the integer .
Proof
Set . The three finite complex-exponential premises in [F9] show and exactly when divides . Let be the finite group of monomial unitaries whose nonzero entries belong to . Let be the real rotation by in coordinates 1 and 2, acting identically elsewhere. Use the symmetric finite list , retaining multiplicities if any. At each walk step choose the identity with probability and an element of this list uniformly with the remaining probability. For , the moment operator on matrices is These are self-adjoint contractions for the Hilbert–Schmidt inner product, because the list is inverse-symmetric; laziness makes every eigenvalue nonnegative. Moreover Thus their fixed spaces are exactly the simultaneous commutants of the displayed finite unitaries.
For , the independent diagonal fifth-root phases force a commuting matrix to be diagonal; permutations force all its diagonal entries equal. For , a matrix coefficient from to can survive the diagonal phases only when the unordered multisets and 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: on , on for , and on . Commutation with applied to , whose rotated vector has nonzero coefficients on both and , forces . Conversely and the swap commute with every tensor-square unitary. The fixed space is therefore precisely , also when .
Finite-dimensional spectral decomposition now gives orthogonal projections onto these fixed spaces and a number such that If the orthogonal complement is zero, take its spectral radius as zero. Every is the moment of an finite distribution of length- unitary words; the limit is only a finite-matrix spectral calculation, not an assumed Haar integral. The first projection is . For any rank- projection , invariance of trace and swap trace gives The coefficients solve and .
Choose a coordinate isometry and let , where is a finite walk word. Complex conjugation preserves the same limiting first and second moment projections and their norm bounds, so they apply to as well. The swap identity on matrix units gives the following limiting second moment, with : In detail, the squared-state term is , and the limiting mean is , so subtract .
The finite moment error has a quantitative bound. Put and . The first-moment error in each matrix unit of the compressed reference is at most in Hilbert–Schmidt norm; contracting it with shows . For the squared-state term, the second-moment error on has Hilbert–Schmidt norm at most . In its trace pairing with , the partial trace over the two environment copies has Hilbert–Schmidt norm at most (Cauchy–Schwarz for each diagonal block). Consequently that squared-state error is at most . The cross term with , whose Hilbert–Schmidt norm is at most , has error at most . Hence, with , Positivity implies : if , 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 , so both and are supported in ; each difference therefore has rank at most . Cauchy–Schwarz on singular values and Jensen give the trace-norm bound at most .
Finally write a Hermitian as using [F8]. Each compression of or 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 gives Choose a finite with both and . Such an integer exists by ; the least such integer is a specified choice. If , 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.
Every finite extension is obtained from a purification by a channel
Statement
Let be any finite-dimensional state with , and let purify with a copy of . There is a CPTP map with .
Facts & Assumptions
Given: Nonzero finite-dimensional spaces , states and with , and a purification where is a copy of .
Purifications exist and are unitarily equivalent after padding: Purifications exist and are unitarily equivalent after padding.
Partial trace over a finite tensor factor, Ordered tensor registers, their inner product, and wire permutations, and The product basis is orthonormal and tensor dimensions multiply: partial traces and ordered tensor product bases have their stated coordinate formulas.
Finite-dimensional quantum channel: Finite-dimensional quantum channel.
An isometry followed by partial trace is a channel: An isometry followed by partial trace is a channel.
Every finite-dimensional real or complex inner product space has an orthonormal basis, For a subspace of a finite-dimensional inner product space, , and If with every finite-dimensional, then is finite-dimensional and ; in particular : finite orthonormal families can be extended by choosing orthonormal bases of their finite-dimensional orthogonal complements, whose dimensions equal the ambient dimension minus the size of the family.
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 gives the corresponding marginal on .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a positive state has an orthonormal eigenbasis, with nonnegative eigenvalues summing to one.
Proof
Choose a finite purification of by [F1] and reorder its factors as . Let be a spectral decomposition on its positive support, obtained from [F7]. Expand each purification in the product basis using this same eigenbasis on : The partial-trace coordinate formula [F2] and the fact that both marginals equal show that the coefficient vectors have Gram matrices and . Thus and are orthonormal and This coefficient argument also handles repeated positive eigenvalues because the chosen basis is fixed before either expansion.
Let . In every case set , fix its first coordinate unit vector , and append it to . Since and the purifying space are nonzero, . Denote the resulting orthonormal Schmidt partners by . The map given by is an isometry. Extend to an orthonormal basis of and choose the same number of additional orthonormal vectors in the orthogonal complement of the in ; [F5] and the target dimension bound ensure this is possible. Sending the added basis vectors to those target vectors extends to a linear isometry on all of . By construction, is exactly the padded purification , after reordering to . This construction includes the singular case , since it extends on all zero-Schmidt directions of .
Define from to . Since is an isometry, [F4] makes completely positive and trace-preserving on the full operator space. Applying it to the reference factor of traces from the pure state , leaving its marginal, which is by construction and is unchanged by the appended pure register [F6]. Thus , as required.
Finite-dimensional quantum erasure channel
Definition
Let be a -dimensional complex inner-product space with . Form the orthogonal direct sum , where is a unit erasure vector orthogonal to every vector in ; the inner product on pairs is . Thus by If with every finite-dimensional, then is finite-dimensional and ; in particular . Let be the isometric inclusion into the data summand.
For an erasure probability , the -dimensional quantum erasure channel is the linear map
For a density operator , this outputs the data state with probability 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 ↗.
Limit formula for linearly bounded superadditive sequences
Statement
Let be a real sequence with , for all , and for some finite constant . Then
Facts & Assumptions
Given: The real sequence and superadditivity and linear boundedness assumptions in the Statement.
for all nonnegative integers , and .
Proof
Set . The bound in [A1] makes finite, and the definition of supremum gives for every . Hence .
Fix . For each , write with integers and . Repeated use of superadditivity in [A1] gives . The finitely many values have a finite minimum , so . As , and , yielding .
Since step 1.2 holds for every , taking the supremum gives . Combining with step 1.1 proves the asserted limit and its value.
Complementary channels and coherent information
Definition
Let and be nonzero finite-dimensional complex inner-product spaces and let be a quantum channel as in Finite-dimensional quantum channel. Choose a finite-dimensional environment and a linear isometry such that
for every ; such a dilation exists by Every finite-dimensional channel has a finite isometric dilation. The channel
is the complementary channel associated with this chosen dilation. The partial trace contracts the first factor of the ordered product (Partial trace over the first tensor factor).
It is a quantum channel: reorder to by the finite wire-permutation unitary (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations); the reordered is still an isometry, so tracing its second factor gives a channel by An isometry followed by partial trace is a channel.
For a density operator on , choose a finite purification with (Ensemble and purification), and define . Its coherent information from to is
where 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 (Purifications exist and are unitarily equivalent after padding); applying 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 : applying to the first tensor factor of the purifying vector gives a pure state on . After reordering the factors, its complementary and marginals have the same positive eigenvalues. The corresponding entropy identity is proved in Coherent information equals output entropy minus environment entropy.
Entropy of a finite flagged state
Statement
Let be a nonzero finite-dimensional complex inner-product space, let be a density operator on , let be a unit vector orthogonal to the data summand in , and let . With and , the block-diagonal state
satisfies .
Facts & Assumptions
Given: The finite-dimensional state, orthogonal flag, and probability in the Statement.
Finite-dimensional von Neumann entropy: entropy is , and zero-eigenvalue terms contribute zero.
Density operator and Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: has nonnegative eigenvalues summing to one, with an orthonormal eigenbasis.
Proof
The orthogonal summands reduce , so its eigenvalues, including multiplicities, are on and on the flag. For , [F1]–[F3] give , because .
At , is the pure flag state and both sides equal zero. At , and both sides equal . Thus the formula holds on the closed interval, including its endpoints.
Data processing for finite quantum mutual information
Statement
Let be nonzero finite-dimensional complex inner-product spaces, let be a density operator on , and let and be quantum channels. Then
where quantum mutual information is as in Finite quantum mutual, conditional, and conditional mutual information.
Facts & Assumptions
Given: The spaces, state, and channels in the Statement.
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state , .
Every finite-dimensional channel has a finite isometric dilation: each finite-dimensional channel has an isometric dilation with output obtained by tracing its finite environment.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: positive operators have finite orthonormal spectral decompositions.
Partial traces of a finite bipartite state are states: partial traces of finite-dimensional density operators are density operators.
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.
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
First apply to . Choose a Stinespring isometry from [F3], and form . This is a state: a spectral decomposition of in [F4] shows that its nonzero eigenvalues remain the same under the isometric embedding. Its marginal is and has the same positive eigenvalues as , while its joint state has the same positive eigenvalues as . Thus [F1] gives .
Reorder to by the unitary permutation in [F6]. Apply [F2] to the ordered tripartite state , with , to obtain . Rearranging by [F1] gives . The entropy identities and their logarithm product law are supplied by [F7]. The marginal is by [F3] and the partial-trace convention; hence applying cannot increase mutual information.
Repeat step 1.1–2.1 with acting on the second register, now taking the first register to be . This gives . Combine this with step 2.1 to obtain the claimed inequality. The entropy-law prerequisite remains [F7].
The maximally mixed state maximizes finite quantum entropy
Statement
Let be a nonzero finite-dimensional complex inner-product space of dimension , and let be a density operator on . Then
with equality if and only if .
Facts & Assumptions
Given: The finite-dimensional state and nonzero space in the Statement.
Finite-dimensional von Neumann entropy: , with zero-eigenvalue terms omitted.
Finite-dimensional quantum relative entropy: on support inclusion, .
Nonnegativity and equality for finite quantum relative entropy: for finite-dimensional density operators , , with equality exactly when .
Density operator and Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: states are nonnegative trace-one operators and have finite orthonormal eigenbases.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: the trace of is and the trace is linear.
Proof
The operator is a density operator: it is nonnegative and has trace by [F4]–[F5]. Its support is all of , so and the finite formula in [F2] applies.
Spectral calculus gives by [F4], [F6]. Hence [F1]–[F2] yield , using by [F4]. By [F3], this is nonnegative, so .
Equality is equivalent by step 2.1 to . The equality case of [F3] then gives . Conversely, substituting into [F1] gives .
Dimension-dependent quantum entropy continuity and Holevo control
Statement
Write with continuous endpoints. Let for , with . For states on dimension and , Moreover, if are states on that space and , their uniform Holevo information is at most . In particular on dimension , exponential decay of makes unnormalized Holevo information tend to zero.
Facts & Assumptions
Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.
Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.
The maximally mixed state maximizes finite quantum entropy: The maximally mixed state maximizes finite quantum entropy.
Trace Distance: Trace Distance.
Trace Norm Unitary Invariance And Positive Formula: Trace Norm Unitary Invariance And Positive Formula.
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.
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.
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm and The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: the natural logarithm product law and derivative formula.
Finite Jensen inequality for a convex function and nonnegative weights summing to one and Finite classical-quantum states and Holevo information: finite Jensen for convex functions and the entropy formula for Holevo information.
The exponential dominates every fixed nonnegative integer power at : a polynomial factor times tends to zero for each fixed .
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.
Finite-dimensional von Neumann entropy: , so a density operator has nonnegative entropy.
Proof
The trace norm is nonnegative and, by [F6], ; hence . If , equality of the states settles the claim. Otherwise [F11] says the positive and negative parts of have trace . Normalize them to states . Then Apply the lower mixture-entropy bound to the first representation and upper bound to the second. After multiplication by this gives Here by [F2], while by [F12]. Interchanging the states gives the absolute-value bound. Dimension one causes no exception. For , [F7] gives and . Moreover as by [F9], so is continuous on with the stated endpoint value. Jensen for follows from [F8] applied to the convex function , including the endpoint.
For each , let . By step 1.1, , so . The average state satisfies by the trace-norm triangle inequality [F6]. Applying step 1.1 to gives a bound with its actual distance ; since is increasing and , its right side is at most . Applying step 1.1 to each , averaging, and using finite Jensen [F8] for concave gives the other . The Holevo formula [F8] therefore yields When and , the first term tends to zero by [F10], and the second tends to zero by continuity of at zero from step 1.1.
Exact flat spectral-type reduction of channel information
Statement
Let be a finite-dimensional channel, let , and let be a state on . Fix a finite Stinespring dilation of and its complementary channel. For each integer there is an exact decomposition into mutually orthogonal flat spectral-type states, with at most positive-weight types and . For the fixed complement and its tensor powers, Thus in each inequality some flat type state attains at least the displayed lower bound.
Facts & Assumptions
Given: The channel , its fixed finite Stinespring dilation and complementary channel, and the state on its input space . The finite type variable has probabilities and natural-log Shannon entropy .
Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.
Complementary channels and coherent information: Complementary channels and coherent information.
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.
Coherent information equals output entropy minus environment entropy: for the fixed dilation.
Finite distributions, entropy, divergence, and stochastic matrices and Nonnegativity and equality for finite classical relative entropy: , and for finite probability vectors.
Proof
Write , including zero eigenvalues. For each count vector with , let be the number of product basis words of that type, (zero if any such ), and omit types with . Let project onto the span of the words of type and set . These states are flat, their supports are mutually orthogonal, and There are at most types. If is their number and is the uniform law on them, [F6] gives , so . Since , the logarithm product law [F5] and yield
Let and , with averages and . By [F4], the receiver-minus-environment entropy identity applies to each type. The upper entropy-excess bound [F1] gives , while its lower entropy-excess bound gives . Product spectral decompositions and [F5] give . Hence Adding from step 1.1 gives the second inequality.
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- estimates; no replacement of fixed-dimensional continuity by a uniform bound is involved.
Flat-input coherent information is achievable by subspace codes
Statement
Let be a finite-dimensional channel with . Fix a Stinespring isometry satisfying for every , and set and . Every is achievable by isometric subspace entanglement transmission; if , rate zero is achieved by a one-dimensional code. An -use code has an isometry and a CPTP decoder to ; its squared overlap with the maximally entangled target tends to one and . More generally, for any isometric inclusion with , the same conclusion holds for the flat state by applying the result to and composing encoders with .
Facts & Assumptions
Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.
Finite unitary averaging and a decoupling second-moment bound: Finite unitary averaging and a decoupling second-moment bound.
Exponential averaged spectral projectors for a finite cq ensemble: Exponential averaged spectral projectors for a finite cq ensemble.
Gentle measurement bound in finite dimensions: Gentle measurement bound in finite dimensions.
Every finite-dimensional channel has a finite isometric dilation: Every finite-dimensional channel has a finite isometric dilation.
Schmidt decomposition: Schmidt decomposition.
Fidelity Purification Characterization: Fidelity Purification Characterization.
Purifications exist and are unitarily equivalent after padding: Purifications exist and are unitarily equivalent after padding.
Fuchs Van De Graaf: Fuchs Van De Graaf.
Partial trace contracts the trace norm on Hermitian operators: Partial trace contracts the trace norm on Hermitian operators.
Strong subadditivity of finite-dimensional quantum entropy: Strong subadditivity of finite-dimensional quantum entropy.
Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for the fixed dilation, .
An isometry followed by partial trace is a channel: an isometry followed by a finite partial trace is a CPTP map.
Proof
Put and . By [F11], ; choose with . On uses, let in factor order . Let be the spectral projectors for the IID receiver and environment states from Exponential averaged spectral projectors for a finite cq ensemble, and let bound the sum of their failure probabilities. The commuting joint projection has acceptance at least . For the rank-two pure-vector calculation used in gentle measurement gives This follows also by applying the gentle-measurement lemma to the pure state and the joint projection. Let . Its environment rank is at most . Since the projected vector is pure, Moreover To verify the first inequality, take the partial trace after ; the complementary environment projection produces another positive summand of the original receiver marginal. Hence , because its trace is at most one.
First prove . The one-use Stinespring output of is pure on , so [F5] gives . For its marginal state , append a one-dimensional register in a pure state and order the resulting state as . Strong subadditivity [F10] gives , that is ; [F12] gives . Hence , so and implies by [F12]. For an isometry , let be the environment/reference state produced by encoding half of . Coefficient matrices give exactly the normalized-compression expression for the unprojected marginal. Use the finite ensemble above with tolerance . 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 . The triangle inequality therefore yields Order the finite generator list and its length- words. For each , 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.
The product target is purified by , with a sufficiently large finite . 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 : 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 ; 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.
If , choose a unit vector of as the encoder for . The decoder to is , a channel by [F13] using the isometry and tracing . Its entanglement fidelity is one and its rate is zero. For a subspace inclusion , the restricted channel has dilation , and its flat input has coherent information by the fixed-dilation definition. Applying steps 1.1–3.1 to and composing each encoder with proves the stated subspace case.
The finite-dimensional erasure map is a quantum channel
Statement
For every integer and , the map defined in Finite-dimensional quantum erasure channel is a finite-dimensional quantum channel.
Facts & Assumptions
Given: A -dimensional complex inner-product space , , and .
Finite-dimensional quantum erasure channel: with , and .
An isometry followed by partial trace is a channel: if is a finite-dimensional linear isometry, then is a quantum channel.
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
Let with a unit vector orthogonal to the data summand, and write for the data inclusions. Define . The summands lie in orthogonal subspaces of , so for all , . Thus is a linear isometry, including at and .
Expanding gives two diagonal terms and two cross terms. The first diagonal term is , whose partial trace over is . The second is , whose partial trace is . 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 for every .
By step 1.1, 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 , proving the Statement.
Degradable and antidegradable channels
Definition
Let be a finite-dimensional channel and fix a complementary channel coming from one finite Stinespring isometry. Relative to this chosen dilation, is degradable if there exists a quantum channel such that
It is antidegradable relative to this dilation if there exists a quantum channel such that
All hypotheses and conclusions below use the same fixed complementary dilation and the corresponding degrading or antidegrading channel.
Coherent information equals output entropy minus environment entropy
Statement
Let be a finite-dimensional channel, let be a finite Stinespring isometry, let , and let be a density operator on . Then
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 channel , a Stinespring isometry for , and a density operator on .
Complementary channels and coherent information: for a purification , , with ; the chosen complement is .
Ensemble and purification and Purifications exist and are unitarily equivalent after padding: a purification is a unit vector with , and such a finite purification exists.
Schmidt decomposition: a finite pure bipartite vector has a Schmidt decomposition, so its two reduced density operators have the same positive eigenvalues with multiplicities.
Every finite-dimensional channel has a finite isometric dilation: for every input operator .
Finite-dimensional von Neumann entropy: for the eigenvalues of a finite-dimensional density operator; zero eigenvalues contribute zero.
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 can be reordered by a unitary wire permutation.
Proof
Choose a finite purification of using [F2], and put . Since is an isometry, is a unit vector. Reorder to using [F6]; tracing gives because [F4] says . Tracing and gives : in the ordered product basis, the two finite partial-trace sums contract the index to and then contract the index.
Regard the reordered as a bipartite vector across . By [F3], the positive eigenvalues of its and marginals coincide. The entropy formula [F5] therefore gives . 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.
Private information of a finite channel ensemble
Definition
Let be a finite-dimensional quantum channel, fix its complementary channel , and let be a finite ensemble of density operators on . Set . Its private information is
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.
Finite cq wiretap achievability with strong Holevo secrecy
Statement
Fix any finite input ensemble for a finite-dimensional channel and a complement . Let be the Holevo informations of their output ensembles. Every admits uniform -message codes with mixed input states, Bob POVMs, , 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.
Exponential averaged spectral projectors for a finite cq ensemble: Exponential averaged spectral projectors for a finite cq ensemble.
Dimension-dependent quantum entropy continuity and Holevo control: Dimension-dependent quantum entropy continuity and Holevo control.
Gentle measurement bound in finite dimensions: Gentle measurement bound in finite dimensions.
Finite Hayashi–Nagaoka operator inequality: Finite Hayashi–Nagaoka operator inequality.
Finite classical-quantum states and Holevo information: Finite classical-quantum states and Holevo information.
Finite-dimensional quantum channel: Finite-dimensional quantum channel.
Trace Norm Duality And Norm Properties: Trace Norm Duality And Norm Properties.
Trace of a product of positive semidefinite matrices is nonnegative: Trace of a product of positive semidefinite matrices is nonnegative.
Entropy bounds for a finite mixture of states: for every finite ensemble, its Holevo information is nonnegative.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: the positive operator has an orthonormal eigenbasis; its inverse square root on positive eigenvalues, extended by zero on the kernel, obeys .
Proof
By [F9], . Since , choose with and , and then choose so and . Take , and draw independent words with law . For message , the encoder inputs the mixed state This is a legitimate finite private randomization of the operational input state; the realized codebook is public.
For Bob use the global and conditional spectral projectors from Exponential averaged spectral projectors for a finite cq ensemble, for the receiver ensemble. Put and . Each is nonnegative and . Using [F10], define spectrally on and as zero on , and set and . These are nonnegative and Assign to the pair ; the resulting pair effects still sum to the identity, and coarsening them by gives Bob's message POVM. For each pair, the Hayashi–Nagaoka inequality [F4] with and 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, where bounds both averaged projector failures. This follows by and the gentle-measurement bound followed by Jensen. For two different independent codewords, the spectral eigenvalue and rank bounds give 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 which decays exponentially. Coarsening the pair POVM to its message label cannot increase message error.
For Eve let denote the spectral projectors for her ensemble, put , and define These operators satisfy , , and . Their average truncation error obeys Indeed the conditional projector commutes with its state, so its trace-norm loss equals its failure probability. Its subnormalized output satisfies , and the global-projection loss is at most . The subnormalized gentle estimate follows by applying the normalized lemma to and multiplying back (the zero operator is immediate). Jensen gives the stated averaged bound.
For the independent words of a fixed message, centered Hilbert–Schmidt variance gives All cross terms have zero expectation by independence. The difference is supported in . Cauchy–Schwarz on singular values and Jensen imply Together with , this proves The right side decays exponentially and is independent of . 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 . The proved quantitative entropy estimate yields 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 . If the ensemble's private information is nonpositive it gives no positive lower bound; rate zero remains achievable with one message.
Flat-input entanglement-assisted achievability by Weyl coding
Statement
Let be the flat state of a nonzero -dimensional input subspace of a finite-dimensional channel . With prior shared maximally entangled states on that subspace, every 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 .
Facts & Assumptions
Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.
Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels: Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels.
Complementary channels and coherent information: Complementary channels and coherent information.
Coherent information equals output entropy minus environment entropy: Coherent information equals output entropy minus environment entropy.
Schmidt decomposition: Schmidt decomposition.
Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.
Finite classical-quantum states and Holevo information: the ensemble Holevo information is .
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 .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: finite-dimensional output states have orthonormal eigenbases.
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
Fix a -dimensional subspace of the input, with embedding and flat state . Share between the sender's subspace and a receiver reference . On the sender half apply the Weyl unitaries, each uniformly likely, before the input embedding. The Weyl matrices in the fixed ordered basis are . Reorder the shared state as using [F5]. Applying [F9] with retained factor and twirled factor the sender's -dimensional register gives , since the retained marginal is . Reordering back gives . The supplied finite root-of-unity calculation establishes the phase cancellation for every .
Let be the joint output on of this finite cq alphabet through . Because in coefficient coordinates, all are related by a unitary on and have identical entropy by purity of the full Stinespring output and [F4]. Their average is . The spectral theorem [F8] and logarithm law [F7] give . Thus [F6] gives the ensemble Holevo information exactly as The HSW theorem applies to this fixed finite cq channel , with output . 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 is entanglement-assisted achievable. Dimension is included: the one-letter ensemble then has Holevo information zero.
Finite channel information maxima are attained
Statement
Let be a quantum channel between nonzero finite-dimensional complex inner-product spaces, and fix any finite Stinespring complement . Both functions
attain a maximum on the density operators on .
Facts & Assumptions
Given: The finite-dimensional channel and chosen complement in the Statement.
Density operator, Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely, and Every finite-dimensional real or complex inner product space has an orthonormal basis: a state is a nonnegative trace-one self-adjoint operator with a finite orthonormal eigenbasis and nonnegative eigenvalues summing to one.
Non-negative and positive operators, The adjoint is characterised by , The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, and Cauchy–Schwarz: , with equality exactly for linearly dependent vectors: nonnegativity is equivalent to self-adjointness and for every vector; .
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.
Every Euclidean linear map has a unique matrix and satisfies for some and For all norms on are equivalent: a linear map between finite-dimensional coordinate spaces is continuous, and the operator-norm topology agrees with the Euclidean coordinate topology.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: a closed bounded subset of a positive-dimensional real Euclidean space is compact.
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
Regard the self-adjoint endomorphisms of as a real vector space of dimension , where , using an orthonormal basis of and the real diagonal and real/imaginary off-diagonal matrix coordinates. The state set is nonempty because is a state. It is closed: trace one and the self-adjoint matrix-coordinate equalities are closed conditions, and for each fixed , the quadratic form condition 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 , so the operator norm is at most one; for standard basis vectors , [F2] gives , hence all 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.
The channels and are finite-dimensional linear maps and hence continuous in operator norm by [F5]. Their outputs on states are states. By [F3]–[F4], is continuous; adding the continuous function shows that the second displayed objective is continuous as well.
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.
Complement and degradation maps of the erasure channel
Statement
For , choose the Stinespring isometry in The finite-dimensional erasure map is a quantum channel, with environment . Its complement is
The channel is degradable for and antidegradable for .
Facts & Assumptions
Given: An input dimension and erasure probability .
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 .
Degradable and antidegradable channels: degradability means that a channel from to simulates the complement, and antidegradability means a channel from to simulates the original channel.
The finite-dimensional erasure map is a quantum channel: is a finite-dimensional channel.
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
Trace preservation is Kraus normalization: a finite Kraus sum is trace-preserving when the sum of is the identity.
Finite-dimensional quantum channel: a channel is complex-linear, completely positive, and trace-preserving.
Proof
Use the isometry from the proof of The finite-dimensional erasure map is a quantum channel. Tracing the first factor leaves the data block and the flag block ; the cross terms vanish because the data and erasure subspaces are orthogonal. The data block precedes the flag block because .
Suppose and set . Choose an orthonormal basis of the data summand of , and define the finite Kraus family from to by , for , and . The sum of adjoint products is , so the induced map is a channel by [F4]–[F6]. On an erasure-channel output, its data block has weight and its flag block has weight . Thus , proving degradability.
Suppose and set . Choose an orthonormal basis of the data summand of and define a finite Kraus family from to by , for , and . Its adjoint products sum to , so its Kraus map is a channel by [F4]–[F6]. Applying it to the complement in step 1.1 gives data weight and erasure-flag weight . Hence , proving antidegradability. At both parameters equal one and both relations hold.
Private information is an average coherent-information difference
Statement
Let be a finite-dimensional channel with chosen complement , and let be a finite ensemble on with . Then
Facts & Assumptions
Given: The channel, chosen complementary channel, and finite ensemble in the Statement.
Coherent information equals output entropy minus environment entropy: for every finite input state and the chosen dilation.
Proof
Apply [F3] to and to every with . Write , , , and . The difference of coherent informations becomes .
Regrouping the finite sums in step 1.1 gives . Each bracket is the corresponding Holevo information by [F2], so their difference is by [F1]. Terms with 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.
Product additivity of coherent and private information
Statement
Let be finite-dimensional channels. For input states ,
For finite ensembles , their product ensemble satisfies
Facts & Assumptions
Given: The two finite-dimensional channels, input states, and finite ensembles in the Statement.
Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: coherent information for a fixed complement is .
Private information of a finite channel ensemble: private information is the receiver Holevo quantity minus the complementary-output Holevo quantity.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: every finite-dimensional density operator has a finite orthonormal eigenbasis.
Proof
Let and be density operators with positive eigenvalues and , respectively. By [F3], the product eigenvectors form an orthonormal eigenbasis of with eigenvalues ; zero eigenvalues contribute zero. Expanding the entropy sum and using [F4], , gives .
Choose purifications of . Their product purifies . 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.
The product ensemble has probabilities 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.
Additivity of optimized entanglement-assisted information
Statement
For a finite-dimensional channel , define
For any two finite-dimensional channels ,
Facts & Assumptions
Given: The channels, finite input spaces, and coherent-information convention in the Statement.
Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for a fixed dilation , .
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Data processing for finite quantum mutual information: applying local channels to two registers cannot increase their quantum mutual information.
Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state, .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: finite-dimensional density operators have finite orthonormal eigenbases.
The maximally mixed state maximizes finite quantum entropy: a density operator on a register of dimension has entropy at most .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is increasing, , and for positive .
Density operator and Finite-dimensional von Neumann entropy: a density operator is non-negative with trace one, and its entropy is in an orthonormal eigenbasis.
Proof
Strong subadditivity [F4] with the middle register one-dimensional gives subadditivity 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 by [F2].
Fix an arbitrary state , and set to its marginals, , and using product Stinespring dilations. Expanding each entropy by [F1] and each mutual information by [F2] yields . By [F3] applied to the local complementary channels, . Step 1.1 gives , so the displayed difference is nonpositive. Therefore .
For product inputs , diagonalize each density operator using [F5]. The positive eigenvalues of the product are , so expanding and applying [F7] proves entropy additivity and hence . For any density operator, [F5] and [F8] give nonnegative eigenvalues summing to one, so every positive eigenvalue lies in . Monotonicity and in [F7] therefore make each term nonnegative. Together with [F6], this bounds each of , , and between zero and the logarithm of its fixed register dimension, so is bounded above and below and its supremum is finite. For any , choose with . The product input gives . Letting proves the reverse inequality.
Coherent information of a qudit erasure channel
Statement
Let be the finite-dimensional erasure channel with data dimension and erasure probability , with the complementary dilation in Complement and degradation maps of the erasure channel. For every input state ,
Facts & Assumptions
Given: , , and the input state in the Statement.
Finite-dimensional quantum erasure channel and Complement and degradation maps of the erasure channel: respectively, the receiver state is and the complementary state is under the declared data-flag identifications.
Entropy of a finite flagged state: , including .
Proof
Apply [F3] to the two states in [F1]. Their entropies are and , respectively. By the definition of and the logarithm product and reciprocal laws in Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, , including the endpoint convention .
Subtract the complementary-output entropy from the receiver-output entropy as in [F2]. The equal binary-entropy terms from step 1.1 cancel, leaving . The derivation is valid at by [F3], so no open-interval restriction is needed.
Operational quantum, private, and entanglement-assisted capacities
Definition
Let be a finite-dimensional quantum channel and use its memoryless extension . Rates use natural logarithms, so they are in nats per channel use. For code sizes , a rate is achievable when 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 and a quantum-channel decoder , where . Let and let be a normalized maximally entangled vector. Its entanglement fidelity is
where . A rate is quantum-achievable if ; the resulting capacity is . This is the subspace entanglement-transmission convention.
For private classical transmission, a block code uses equiprobable messages , input states on , and a decoding POVM on . Its average error is
Fix a complementary channel as in Complementary channels and coherent information. Eve's average state is . Define leakage by its Holevo information
A rate is privately achievable when and ; this is strong secrecy in mutual-information form. The corresponding capacity is . 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 the sender and receiver begin with a finite-dimensional shared state independent of the equiprobable message. For each , the sender applies a quantum channel . The receiver measures with a POVM . Its average error is
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 .
The input, output, and reference registers are finite-dimensional in each block. No single-letter formula is included in these operational definitions.
Coherent-information concavity and subadditivity for degradable channels
Statement
Let for be finite-dimensional degradable channels with complements . Then is concave and nonnegative. For every joint input state ,
Consequently the supremum coherent information of is the sum of the two single-channel suprema.
Facts & Assumptions
Given: The finite-dimensional degradable channels and joint input state in the Statement.
Degradable and antidegradable channels: for a finite-dimensional channel .
Finite quantum mutual information identities and the Holevo identity: for a finite classical-quantum state, its mutual information equals its Holevo information.
Data processing for finite quantum mutual information: local channels on either register cannot increase finite quantum mutual information.
Finite quantum mutual, conditional, and conditional mutual information: quantum mutual information is defined by .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: every finite-dimensional density operator is a finite mixture of pure eigenstates.
Product additivity of coherent and private information: coherent information is additive on product input states for product channels.
Schmidt decomposition: the receiver and environment marginals of the pure Stinespring output of a pure input have the same positive eigenvalues.
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive ; it supports the cq entropy identity stated in [F3].
Proof
Fix a finite input ensemble with average . By [F2] and [F3], , where and denote the receiver and complementary output registers for the ensemble. The finite cq entropy calculation uses the block eigenvalues and the logarithm product law [F10]. Since is obtained from by in [F1], [F4] gives . Thus .
For a joint state , write for its marginals, , and . Expanding the entropies in [F5] and using [F2], [F6] gives . The tensor product maps to , so [F4] gives . The right side is therefore nonpositive, proving the claimed inequality.
Rewrite the inequality using [F2]. For every finite ensemble with average , this yields , which is exactly concavity of coherent information on the finite-dimensional state space.
Let be a spectral decomposition from [F7]. For each pure , an isometric Stinespring dilation produces a pure receiver-environment vector, so the two marginal entropies agree by [F9] and [F5] gives . Concavity from step 2.1 therefore implies .
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 of each finite supremum and letting 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.
Regularized coherent-information formula for quantum capacity
Statement
Let be a finite-dimensional memoryless quantum channel. For , put
Under the subspace entanglement-transmission convention in Operational quantum, private, and entanglement-assisted capacities,
No general single-letter or additivity assertion is made.
Facts & Assumptions
Given: The finite-dimensional memoryless channel and quantum-capacity convention in the Statement.
Density operator: a rank-one projection onto a unit vector is a density operator.
Complementary channels and coherent information: for a finite purification.
Product additivity of coherent and private information: coherent information is additive on product input states for product channels.
The maximally mixed state maximizes finite quantum entropy and Finite-dimensional von Neumann entropy: every state has by the eigenvalue formula and on a -dimensional register.
Limit formula for linearly bounded superadditive sequences: a linearly bounded superadditive sequence has normalized limit equal to its supremum.
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.
Exact flat spectral-type reduction of channel information: Exact flat spectral-type reduction of channel information.
Flat-input coherent information is achievable by subspace codes: Flat-input coherent information is achievable by subspace codes.
Dimension-dependent quantum entropy continuity and Holevo control: Dimension-dependent quantum entropy continuity and Holevo control.
Fuchs Van De Graaf: Fuchs Van De Graaf.
Partial trace contracts the trace norm on Hermitian operators: Partial trace contracts the trace norm on Hermitian operators.
Data processing for finite quantum mutual information: Data processing for finite quantum mutual information.
Proof
First establish the information-sequence limit, then prove the operational direct and converse bounds.
Set . A unit vector in the nonzero space 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 because entropy is nonnegative by [F3]. The state lies on a space of dimension by [F6], so [F3] gives . Thus .
For positive , choose states within of the respective suprema and . Their product is an admissible input for , and [F2] makes its coherent information the sum of the two values. Letting gives . The linear bound in step 1.1 and [F4] show that converges to .
For any state , apply the exact type reduction to and choose a type with Restrict the input of the -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 Here and below a negative right side is covered by rate zero. To pass from codes of length divisible by to all lengths , take , use the -block code, and pad the remaining fewer than inputs with a fixed pure state; the decoder discards their outputs. Fidelity is unchanged and the rate loss tends to zero. Since by [F15], letting gives . Applying this result to any fixed block channel and padding again gives for every , and therefore the full regularized direct bound.
For a length- isometric code of dimension , let , let be its decoded entangled state, and put . Write , with . Fuchs–van de Graaf gives , because is the squared overlap with the pure target. Partial-trace contraction gives . Quantitative continuity on dimensions and yields Thus decoded coherent information is at least . By [F14] and [F1], for the pre-decoding purification and analogously after decoding. The reference entropy is unchanged, and data processing [F13] applied to gives . Before decoding, the purification is the encoded half-maximally-entangled state, so its coherent information equals . Consequently For a reliable code sequence , and because the encoder is isometric. Divide by and use this uniform dimension bound to conclude that the limsup code rate is at most . 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.
Regularized private-information formula for quantum channel capacity
Statement
Let be a finite-dimensional memoryless quantum channel. For each , let
where the supremum ranges over all finite ensembles of input states on . Under the strong-secrecy, average-error convention in Operational quantum, private, and entanglement-assisted capacities,
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.
Private information of a finite channel ensemble and Private information is an average coherent-information difference: for a finite ensemble, , where is the complementary output.
Finite quantum mutual, conditional, and conditional mutual information and Finite quantum mutual information identities and the Holevo identity: for a finite classical-quantum state, is its Holevo information.
Strong subadditivity of finite-dimensional quantum entropy: strong subadditivity with a one-dimensional middle register implies .
Product additivity of coherent and private information: product ensembles on tensor-product channels have additive private information.
Limit formula for linearly bounded superadditive sequences: a linearly bounded superadditive sequence with satisfies .
The maximally mixed state maximizes finite quantum entropy and Finite-dimensional von Neumann entropy: on a state space of dimension , , and the eigenvalue formula gives .
Finite cq wiretap achievability with strong Holevo secrecy: Finite cq wiretap achievability with strong Holevo secrecy.
Finite-alphabet Fano inequality: Finite-alphabet Fano inequality.
The finite Holevo measurement bound: The finite Holevo measurement bound.
Finite entropy and mutual-information chain rules: for finite classical variables.
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.
Write . The one-state ensemble has private information zero, so . For any finite ensemble, [F1]–[F3] give , since [F3] implies . By [F2], [F7], and the logarithm law [F13], because each conditional output entropy is nonnegative by [F6]. The output dimension and logarithm identity in [F8], together with [F6], give . Therefore .
For positive integers , choose finite ensembles whose private informations are within an arbitrary of and . Their product ensemble is finite and, by [F4], has private information equal to the sum. Thus . Letting proves superadditivity; define . The linear bound in step 1.1 and [F5] now prove that converges to its supremum.
Apply the construction to any finite ensemble of inputs for a fixed block channel . 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 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 for every : 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.
For any uniform -message code, let be Bob's decoded message and its average error. Write , with continuous endpoint values. The finite Fano inequality gives for . By [F12], , and 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 . Therefore The uniform input ensemble is among those defining , and its private information is . Thus For , the desired asymptotic bound is trivial. For a reliable strongly secret sequence, divide by ; since is bounded and , the displayed inequality itself bounds , even though no dimension-based bound on the number of repeated classical messages was assumed. The terms and vanish. This proves the converse for the stated liminf-achievable rate convention and the retained full equality .
Additive entanglement-assisted classical capacity formula
Statement
Let be a finite-dimensional quantum channel. Under the shared-entanglement coding convention in Operational quantum, private, and entanglement-assisted capacities,
where is any finite purification of on . The value is additive: for finite-dimensional channels.
Facts & Assumptions
Given: The finite-dimensional channels, prior shared entanglement, and purification convention in the Statement.
Complementary channels and coherent information, Finite-dimensional von Neumann entropy, and Schmidt decomposition: for a purification , and .
Finite channel information maxima are attained: the finite-dimensional maximum of exists.
Additivity of optimized entanglement-assisted information: is additive for tensor-product channels.
Flat-input entanglement-assisted achievability by Weyl coding: Flat-input entanglement-assisted achievability by Weyl coding.
Exact flat spectral-type reduction of channel information: Exact flat spectral-type reduction of channel information.
Every finite extension is obtained from a purification by a channel: Every finite extension is obtained from a purification by a channel.
Data processing for finite quantum mutual information: Data processing for finite quantum mutual information.
Finite-alphabet Fano inequality: Finite-alphabet Fano inequality.
The finite Holevo measurement bound: The finite Holevo measurement bound.
Finite entropy and mutual-information chain rules: for finite classical messages, .
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.
Strong subadditivity of finite-dimensional quantum entropy: with a one-dimensional middle register, strong subadditivity gives and hence .
Finite quantum mutual information identities and the Holevo identity: for the finite cq output ensemble, is its Holevo information; the required logarithm product law is included in [F12].
Proof
For any purification , its reference marginal is with the same positive eigenvalues as , so by [F1]. Substituting [F1] into [F2] gives . Thus the two maximized information expressions in the Statement agree, and [F3] supplies their maximizers.
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.
For any input state and positive integer , exact spectral type reduction gives a flat state on an -use input subspace such that Apply the flat-state construction to that fixed block channel. For fixed , both its Weyl alphabet and its receiver output dimension are finite, so the HSW theorem applies before any limit in is taken. The shared resource is the flat type-subspace maximally entangled state for each outer block. Padding fewer than unused original-channel inputs with a fixed state gives codes for all sufficiently large lengths and no asymptotic rate loss. Therefore Since by [F13], letting 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.
Consider any length- stated EA code with uniform message register , receiver's prior share , channel input , and receiver output . Before transmission its joint state is The marginal is the product of the uniform message and the original share: each encoder is trace-preserving and hence cannot change . In particular . Let be its average input. By the extension lemma, the state is obtained by a channel on the reference of a purification of . After transmission, quantum-mutual-information data processing gives Expanding the entropy definitions gives the exact identity The last term is zero, and [F14] gives . Therefore The equality uses the stated optimized-information additivity lemma, whose proof follows local-channel mutual-information data processing and product-state entropy additivity. Write with continuous endpoint values. By [F11], ; [F15] identifies with the Holevo quantity of the cq output state, and the Holevo measurement bound [F10] gives . Fano then gives Singleton message sets are trivial. Divide by and let average error tend to zero to bound every achievable rate by , 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 to both channels and their product, and using the stated proved additivity of , proves the capacity additivity assertion as well.
Single-letter quantum and private capacities of degradable channels
Statement
Let be a finite-dimensional degradable channel with a fixed complement . Then
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.
Degradable and antidegradable channels: a degrading channel satisfies .
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.
Finite channel information maxima are attained: the finite-dimensional coherent information maximum is attained.
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.
Private information is an average coherent-information difference: for an ensemble , .
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: each density operator is a finite convex combination of rank-one eigenprojections.
Proof
The tensor power of a degradable channel is degradable: the product degrading map is a channel by Finite-dimensional channels compose and tensor, and it maps to . Therefore [F2] gives . Substituting in the regularized quantum formula [F4] yields .
For any -use input ensemble , 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 . Hence the -use private-information supremum has the same upper bound.
Choose a maximizing state using [F3], and decompose it spectrally as using [F6]. For a pure input , choose a one-dimensional purification reference; the joint output-reference state has the same nonzero eigenvalues as , so the defining formula in Complementary channels and coherent information gives . Therefore the pure-state ensemble has private information by [F5]. Thus ; step 2.1 with gives the reverse inequality, and step 2.1 for all gives . The regularized formula [F4] therefore yields .
The identities in steps 1.1 and 3.1 prove the stated equality and remove both regularizations.
Exact quantum, private, and entanglement-assisted erasure capacities
Statement
For the finite-dimensional flagged erasure channel with input dimension and erasure probability ,
All capacities are in nats per channel use. The unassisted quantum and private formulas are zero in the antidegradable regime .
Facts & Assumptions
Given: A data dimension , erasure probability , and the capacity conventions in the Statement.
Complement and degradation maps of the erasure channel: the channel is degradable for and antidegradable for .
Single-letter quantum and private capacities of degradable channels: for a degradable channel, .
Regularized coherent-information formula for quantum capacity, Regularized private-information formula for quantum channel capacity, and Additive entanglement-assisted classical capacity formula: general capacities are given by the respective regularized or additive information formulas.
Data processing for finite quantum mutual information: applying a channel to one register cannot increase finite quantum mutual information.
Finite quantum mutual, conditional, and conditional mutual information: for finite bipartite states.
Private information is an average coherent-information difference: private information is for a finite input ensemble and its complementary output.
The maximally mixed state maximizes finite quantum entropy: , with equality at .
Finite-dimensional channels compose and tensor: tensor products of finite-dimensional channels are channels and tensor products of complements implement the product dilation.
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
By [F1] and [F8], the coherent information of an input state is , with and . If , its maximum is , attained at .
Now suppose . By [F2], there is an antidegrading channel with . Its tensor powers are channels by [F9]. For any -use input state and purification reference , [F5] gives . The joint state from a product Stinespring isometry is pure, so Schmidt decomposition gives and . By the mutual-information definition [F6], where the last equality is [F10]. Hence the data-processing inequality forces . A pure input attains zero, so the -use coherent-information supremum is zero and [F4] gives .
For , [F2] says the channel is degradable; applying [F3] to step 1.1 gives . This includes , where the value is zero.
For any finite -use ensemble, [F7] and [F6] express private information as . The antidegrading channel on and [F5] make this difference nonpositive. The singleton ensemble has private information zero, so each -use private-information supremum is zero; [F4] gives .
By [F1] and [F4], the entanglement-assisted objective is . Since , [F8] makes its maximum , proving the final formula.
5 · Examples, counterexamples and false statements
None yet.
Sources
- John Watrous, The Theory of Quantum Information
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel
- John Watrous, The Theory of Quantum Information, §8.3.2
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §24.7.1
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel, Appendix A discussion of regularization limits
- John Watrous, The Theory of Quantum Information, Appendix A, regularization of channel capacities
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §13.5
- John Watrous, The Theory of Quantum Information, §8.2.2
- John Watrous, The Theory of Quantum Information, §5.2.1
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §11.1
- John Watrous, The Theory of Quantum Information, Theorem 5.35 and Chapter 8
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §§11.7–11.8
- John Watrous, The Theory of Quantum Information, Proposition 5.22 and §5.2.1
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, Theorem 11.8.2
- John Watrous, The Theory of Quantum Information, Exercise 8.3 and §8.2.2
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §§13.5 and 24.8
- John Watrous, The Theory of Quantum Information, Proposition 8.17 and §8.2.2
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel, §3
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, Chapter 23
- John Watrous, The Theory of Quantum Information, §§5.2.1 and 8.2.2
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §§11.10 and 24.4
- John Watrous, The Theory of Quantum Information, §8.3.2 and §8.3.3
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, §24.7
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel, §§3–5
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, Chapters 23–24
- John Watrous, The Theory of Quantum Information, Lemma 8.38
- Charles H. Bennett, Peter W. Shor, John A. Smolin, and Ashish V. Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, §IV
- John Watrous, The Theory of Quantum Information, Proposition 8.17 and §8.3.2
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Proposition 24.7.1
- John Watrous, The Theory of Quantum Information, Chapter 8
- John Watrous, The Theory of Quantum Information, Exercise 8.3
- John Watrous, The Theory of Quantum Information, Theorems 8.53–8.55
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel, Theorem 5 and Proposition 7
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §§24.4 and 24.8
- Igor Devetak, The private classical capacity and quantum capacity of a quantum channel, Theorem 1, §3
- John Watrous, The Theory of Quantum Information, Chapter 8 and Appendix A
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Chapter 23
- John Watrous, The Theory of Quantum Information, Theorem 8.41 and Lemmas 8.36–8.40
- Bennett, Shor, Smolin, and Thapliyal, Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem, §II
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §§21.3–21.5
- Mark M. Wilde, From Classical to Quantum Shannon Theory, Theorem 13.5.2 and §24.8
- Devetak and Shor, The capacity of a quantum channel for simultaneous transmission of classical and quantum information, §4