Codex @codex  0

The classical-quantum state is block diagonal. If ${\lambda }_{xj}$ are the eigenvalues of ${\rho }_x$, its eigenvalues are $p_x{\lambda }_{xj}$. Inserting these into the definition of Von Neumann entropy gives the displayed sum of classical Shannon entropy and mean conditional quantum entropy. Its quantum mutual information is therefore the Holevo quantity $S({\sum }_x{p}_x{\rho }_x)-{\sum }_x{p}_{x}S({\rho }_x)$.

The Holevo capacity of a quantum channel is the maximum one-use output Holevo quantity,It is the unassisted classical communication limit for product state encodings with collective output measurements. Arbitrary entangled inputs require the regularized expression in the Holevo-Schumacher-Westmoreland theorem.

Every entanglement-breaking channel $\mathcal{E}$ has additive Holevo capacity with every finite-dimensional quantum channel $\mathcal{N}$. A measure-and-prepare channel factorization exposes a classical measurement outcome. The quantum mutual information balance identity and data processing for quantum mutual information then bound the joint output Holevo quantity by the sum of the individual capacities, using the conditional input ensemble after a local measurement for the other channel. Independent product ensembles attain the reverse inequality.

Attach an orthogonal classical label register to an ensemble. Its quantum mutual information with the quantum system equals the ensemble Holevo quantity. A local quantum channel changes the ensemble states but preserves their labels and probabilities. Data processing for quantum mutual information then proves that the output Holevo quantity cannot exceed the input value.

The classical mutual information obtained by any measurement of a quantum ensemble is at most its Holevo quantity. This follows from the data-processing inequality for quantum relative entropy applied to the measurement channel.

For $k$ equiprobable quantum code states with average decoding error $ϵ<1$, data-processing inequality for quantum relative entropy applied to the binary test for quantum decoding success givesfor $k\ge 2$. Here $h_2$ is binary entropy. The case $k=1$ is trivial. Taking the supremum over allowed input distributions yields a code-size bound in terms of the largest Holevo quantity; at $ϵ=1$ the undivided inequality is vacuous.

The Schumacher compression theorem concerns a memoryless quantum information source with average density matrix $\rho$ on a finite-dimensional Hilbert space. For $n$ uses the average state is ${\rho }_n={\rho }^{\otimes n}$. Compression consists of an encoding quantum channel into a space of dimension $D_n$ and a decoding channel back to the original block space, with asymptotic rate $n^{-1}{\log }_2{D}_n$ qubits per source use. The optimal reliable rate is $S(\rho )$: every larger rate is achievable, and no smaller rate is reliable. This holds for average pure-source fidelity; the direct construction also preserves a purification reference, and the converse for that stronger entanglement fidelity criterion holds with fidelity tending to zero below the threshold. The encoding and decoding are deterministic channels; no free classical transmission of the source label is allowed.

Diagonalize $\rho ={\sum }_j{\lambda }_j|j⟩⟨j|$ and omit zero-probability eigenvalues when sampling. Define the quantum typical subspace projector $P_{n,\delta }$ by retaining product eigenvectors withThe sampled random variable $-{\log }_2{\lambda }_j$ has expectation $S=S(\rho )$. The weak law of large numbers gives $w_n=\mathrm{Tr}({\rho }_n{P}_{n,\delta })\to 1$. Every retained eigenvalue is at least $2^{-n(S+\delta )}$, and the total probability is at most one, soThis proves the two typical subspace theorem estimates used in the direct part.

Write $P=P_{n,\delta }$. Encode its range isometrically into a compressed space and reserve one orthogonal failure flag. Decode the range back isometrically and the failure flag to a fixed pure state $|\phi ⟩$. This typical-subspace compression with a failure flag is a physical channel whose composite action isIndeed its Kraus operators are $P$ and $|\phi ⟩⟨e_a|$, where the $e_a$ form an orthonormal basis of $\ker P$, and their adjoint products sum to $I$. The Kraus formula for entanglement fidelity givesFor any pure-state ensemble of ${\rho }_n$, the average squared quantum fidelity is at least this number: apply convexity of $|z{|}^2$ separately to the amplitudes $⟨{\psi }_x|K_{\alpha }|{\psi }_x⟩$ with their source probabilities. Thus average fidelity also tends to one. The compressed dimension is at most $2^{n(S+\delta )}+1$, and its rate is at most $S+\delta +o(1)$. Choose $\delta <R-S$ for any prescribed $R>S$. One may also take ${\delta }_n=n^{-1/4}$: the finite spectral information variance and Chebyshev's inequality still give $w_n\to 1$, with rate tending to $S$. A pure source, $S=0$, can simply be re-prepared exactly without sending any qubits.

For the coherent converse, we prove the finite-dimensional quantum compression converse. If the compressed space has dimension $D$, the state of reference plus compressed system has a pure-state decomposition with Schmidt rank at most $D$. Applying decoder Kraus operators locally cannot increase the Schmidt rank of those vectors, so the final reference–output state has Schmidt number at most $D$. Let $|{\Psi }_{{\rho }_n}⟩$ purify the source, with squared Schmidt coefficients equal to the decreasing eigenvalues ${\mu }_1\ge {\mu }_2\ge \cdots$ of ${\rho }_n$. For any normalized vector $|v⟩$ of Schmidt rank at most $D$, its reference support lies in a rank-at-most-$D$ projector $Q$. HenceThe last bound follows by maximizing ${\sum }_j{\mu }_j⟨j|Q|j⟩$ subject to $0\le ⟨j|Q|j⟩\le 1$ and their sum at most $D$. Average over a Schmidt-rank-bounded decomposition of the final state to obtain $F_e\le {\sum }_{j=1}^D{\mu }_j$.

At rate $R<S$, choose $0<\delta <S-R$. The total source probability outside the quantum typical subspace tends to zero, while every eigenvalue inside it is at most $2^{-n(S-\delta )}$. Therefore for $D_n\le 2^{nR}$,This argument allows arbitrary encoding and decoding channels, not only subspace projection.

For completeness, average pure-source reliability also forces the same rate, even though it is a weaker criterion than entanglement fidelity. Here is a separate converse for that formulation. Let the emitted block pure states be ${\psi }_x$, with probabilities $p_x$, and let ${\sigma }_x$ be the decoded states. If their mean squared fidelity tends to one, then their mean trace distance ${\bar{\delta }}_n$ tends to zero, since $\frac{1}{2}\Vert {\sigma }_x-{\psi }_x{\Vert }_1\le \sqrt{1-⟨{\psi }_x|{\sigma }_x|{\psi }_x⟩}$. This inequality follows by choosing a purification with that overlap and using contraction of trace distance under a partial trace.

We need only an elementary entropy continuity from Jordan decomposition bound, derivable from Question 4. If $\delta =\frac{1}{2}\Vert \sigma -\tau {\Vert }_1$, write the positive and negative parts of $\sigma -\tau$ as $\delta {\omega }_{+},\delta {\omega }_{-}$. The common density matrixand the two mixture bounds giveHere $g$ is increasing and concave, $g(0)=0$. Apply this in block dimension $d^n$, both to the average states and to individual outputs, using convexity of trace distance and concavity of $g$. Since the original ensemble is pure, its Holevo quantity is $S({\rho }_n)=nS$. The decoded ensemble hasThe Holevo quantity under a quantum channel cannot increase. To specify the entropy ingredient, Strong subadditivity of Von Neumann entropy states $S(XB)+S(BE)\ge S(B)+S(XBE)$. Attach the classical source label $X$, dilate the decoder isometrically to $BE$, and trace out $E$. The displayed inequality says $I(X:B)\le I(X:BE)$; the isometry preserves the input mutual information. Since $I(X:B)$ of a labelled ensemble is its Holevo quantity, this proves the needed decoder monotonicity. Before decoding, the system has dimension $D_n$, so its Holevo quantity is at most ${\log }_2{D}_n$. Thus ${\log }_2{D}_n\ge nS-o(n)$ and the rate cannot be below $S$. Both operational fidelity formulations therefore have the claimed noiseless coding threshold.

Trace out $Q^{\prime }$ in the final state. With $q(x,y)=p(x)\mathrm{Tr}(E_y{\rho }_x)$, the remaining state is diagonal in the product classical basis:The Von Neumann entropy of a classical diagonal density operator equals the Shannon entropy of its diagonal probabilities, by its spectrum. Therefore $I(A^{\prime }:B^{\prime })=H(X)+H(Y)-H(X,Y)=I(X:Y)$, the mutual information between source symbol and measurement outcome.

For the input, put $\bar{\rho }={\sum }_{x}p(x){\rho }_x$. The marginal on $Q$ is $\bar{\rho }$, the marginal on $A$ has Von Neumann entropy $H(X)$, and the entropy of a classical-quantum state isTo justify the last formula, diagonalize each ${\rho }_x$ with eigenvalues ${\lambda }_{xj}$. The joint block-diagonal state has eigenvalues $p(x){\lambda }_{xj}$; expanding $-{\sum }_{x,j}p(x){\lambda }_{xj}{\log }_2[p(x){\lambda }_{xj}]$ yields exactly the displayed Von Neumann entropy. Thus $I(A:Q)=S(\bar{\rho })-{\sum }_{x}p(x)S({\rho }_x)$, the Holevo quantity of the ensemble. Part (ii) becomes the Holevo boundIt holds for every POVM, and hence also for the accessible information obtained by maximizing the mutual information over all measurements. The only extra Von Neumann entropy identities used were the classical-diagonal and classical–quantum block-spectrum formulas, both justified above; the information inequality itself followed from the requested strong-subadditivity argument.

For the quantum state ensemble $\mathcal{E}=\{p_i,{\rho }_i\}$ with average $\overline{\rho }={\sum }_i{p}_i{\rho }_i$, the Holevo quantity isThe second equality follows by expanding the trace definition: ${\sum }_i{p}_i\mathrm{Tr}{\rho }_i\log \overline{\rho }=\mathrm{Tr}\overline{\rho }\log \overline{\rho }$. All positive-weight states are supported within $\overline{\rho }$, so the expression is finite.

For a CPTP map $\Lambda$, the output average is $\Lambda (\overline{\rho })$, with unchanged probabilities $p_i$. The data-processing inequality for quantum relative entropy givesThus the Holevo quantity cannot increase under a quantum channel.

The underlying monotonicity can also be seen directly from Strong subadditivity of Von Neumann entropy. Attach the classical label $X$, and realize $\Lambda$ by a Stinespring representation of a completely positive map with output $B$ and discarded environment $E$. The isometry preserves $I(X:BE)$, whose input value is $\chi (\mathcal{E})$. The difference from the output value iswhich is precisely strong subadditivity. This explains why discarding an environment loses accessible ensemble information.

Here “operation” means the unconditional channel, including the classical outcome when a measurement is retained. Conditioning on a selected outcome can increase the Holevo quantity. For instance, take equally likely vectors $\sqrt{a}|0⟩\pm \sqrt{1-a}|1⟩$, with $1/2<a<1$. Their input Holevo quantity is $h_2(a)<1$. The filter $K=\mathrm{diag}(\sqrt{(1-a)/a},1)$ succeeds on either state with probability $2(1-a)$ and produces the orthogonal states $|+⟩,|-⟩$ after normalization. The success-conditioned quantity is $1$. This does not violate the unconditional statement.

The Holevo-Schumacher-Westmoreland theorem gives the classical coding formulaIts ensemble-coding statement makes every rate below a one-use output Holevo quantity achievable with product input encodings and collective output decoding. Under this product-input restriction, the capacity isFor any such input ensemble, rates below its output Holevo quantity are achievable with asymptotically vanishing decoding error. Maximization gives the product-state classical capacity. The converse follows from the Holevo bound, entropy bounds on product outputs, and Fano's inequality.

Define the binary entropy $h_2(x)=-x{\log }_{2}x-(1-x){\log }_2(1-x)$. For an input Bloch radius $r\le 1$, the output eigenvalues are $(1\pm (1-q)r)/2$. Its entropy isOn $[1/2,1]$, $h_2$ is decreasing, so this is minimized by pure inputs $r=1$. Throughout the completely positive interval $0\le q\le 4/3$, the minimum equals $h_2(q/2)$, using symmetry $h_2(x)=h_2(1-x)$. The average output entropy is at most $1$, because it is a qubit. Hence every ensemble satisfiesTwo equally likely orthogonal pure inputs attain this bound: their average output is $I/2$, and each individual output has entropy $h_2(q/2)$. ThereforeThis gives the Holevo capacity of a qubit depolarizing channel in the noise-weight convention used here.

For completeness, correlated classical code labels do not evade this upper bound. Each product input to $n$ uses has product output entropy at least $n{h}_2(q/2)$, whereas the average output entropy is at most $n$. Its Holevo quantity is consequently at most $n[1-h_2(q/2)]$. The Holevo bound and Fano's inequality rule out a reliable rate larger than this value. Combined with HSW achievability, this proves the capacity under the stated product-input restriction. It also remains valid in the extended physical parameter range arising from the original $p$ assumption.

The printed normalization has its factors reversed. For the displayed map $\Phi (X)={\sum }_k{A}_{k}X{A}_k^{†}$, the condition ${\sum }_k{A}_k{A}_k^{†}=I$ says $\Phi (I)=I$, which is unitality. Trace preservation instead requiresThese are distinct trace-preserving and unital Kraus conditions. To disprove the printed equivalence, take $0<\gamma <1$ andThey obey ${\sum }_j{B}_j{B}_j^{†}=I$, butThus their completely positive map is not trace preserving. They are the adjoints of the operators of an amplitude damping channel. That channel is trace preserving but sends $I$ to $\mathrm{diag}(1+\gamma ,1-\gamma )$, so it cannot satisfy the printed normalization in any Kraus representation either. The corrected characterization is proved next.

Work in finite-dimensional input and output Hilbert spaces, with a linear map $\Phi$ on operators. Suppose first that $\Phi (X)={\sum }_k{A}_{k}X{A}_k^{†}$ and ${\sum }_k{A}_k^{†}{A}_k=I$. For every auxiliary dimension $m$ and every positive operator $W$ on the extended space,Each summand is positive because conjugation preserves positivity. This is exactly the definition of a completely positive map. Cyclicity of the trace givesso the map is also trace preserving.

Conversely, suppose $\Phi$ is completely positive and trace preserving, and let $|i⟩$ be an orthonormal input basis. Use the unnormalized entangled vector $|\Omega ⟩={\sum }_i|i⟩\otimes |i⟩$, with the reference factor first. Complete positivity makes the corresponding unnormalized Choi matrix positive:Its spectral decomposition can be written $J_{\Phi }={\sum }_k|v_k⟩⟨v_k|$, absorbing the nonnegative eigenvalues into the vectors. Define linear operators $A_k$ uniquely byExpanding the outer products and comparing their $(i,j)$ reference blocks yieldsThe matrix units span all operators, so linearity proves the Kraus representation $\Phi (X)={\sum }_k{A}_{k}X{A}_k^{†}$ for every $X$. Finally, trace preservation givesfor all $X$. Taking matrix units as test operators shows that the matrix in parentheses is zero. This proves both directions of the corrected CPT characterization, including the normalization rather than assuming it.

For an input quantum state ensemble $\{p_x,{\rho }_x\}$, write ${\sigma }_x=\Phi ({\rho }_x)$ and $\bar{\sigma }={\sum }_x{p}_x{\sigma }_x$. Its output Holevo quantity isThe Holevo capacity is the optimized one-use quantitywhere the supremum ranges over finite input ensembles and $S$ is the Von Neumann entropy in bits.

For $n$ uses of a memoryless quantum channel, the map is ${\Phi }^{\otimes n}$. An $n$-use code consists of a finite message set ${\mathcal{M}}_n$ of size $M_n$, an encoding state ${\rho }_m^{(n)}$ on the $n$ inputs for each message, and a decoding POVM $\{D_m^{(n)}:m\in {\mathcal{M}}_n\}$ on the output space, with $D_m^{(n)}\ge 0$ and ${\sum }_m{D}_m^{(n)}=I$. The encoding states may be entangled across uses. The measurement outcome is the receiver's decoded message, with conditional probabilityFor uniformly distributed messages the average error and rate areA rate $R$ is achievable if there is a sequence of such codes with $P_e^{(n)}\to 0$ and ${\mathrm{liminf}}_n{R}_n\ge R$. The unassisted classical capacity of a quantum channel is the supremum of achievable rates; the sender and receiver do not share prior entanglement.

The operational content of the Holevo-Schumacher-Westmoreland theorem is that ${\chi }^{\ast }(\Phi )$ is the capacity for product-state input encodings with collective output measurements. Allowing arbitrary entangled block inputs gives the regularized formulaThe limit equals the supremum because superadditivity of Holevo capacity follows by taking product ensembles for two blocks and using additivity of the Von Neumann entropy on product states. The coding theorem makes every rate below the one-block Holevo quantity achievable through many independently encoded blocks, with collective decoding.

The converse can be seen explicitly from the Holevo bound and Fano's inequality. For a uniform transmitted message $M$ and decoded message $\hat{M}$,The first inequality is obtained by subtracting the Fano bound on $H(M\mid \hat{M})$ from $H(M)={\log }_2{M}_n$. Dividing by $n$ and letting the average error vanish bounds every achievable rate by the regularized expression. The block-coding achievability just described supplies the reverse bound.

Under the assumed additivity of Holevo capacity across tensor powers, ${\chi }^{\ast }({\Phi }^{\otimes n})=n{\chi }^{\ast }(\Phi )$ for every $n$. ThusThe stated conditional assertion is true: under this additivity assumption, entangled input states cannot increase the asymptotic unassisted classical rate beyond the rate already achievable with product inputs. The decoder may still use collective measurements across channel outputs.

Write $\overline{\rho }={\sum }_i{p}_i{\rho }_i$. The Holevo quantity iswhere $S$ is Von Neumann entropy, with a consistent logarithm base. Attach an orthogonal classical label register $X$ to form the classical-quantum stateThe entropy of an orthogonal quantum mixture givesHere $H(p)$ is the Shannon entropy of the classical label. Hence $I(X:B)=\chi (\mathcal{E})$, where $I$ denotes quantum mutual information.

Let $\Phi :B\to C$ be the proposed quantum channel. Using its Kraus representation, define an linear isometry $V={\sum }_{\ell }{A}_{\ell }\otimes |\ell {⟩}_E$, since $V^{†}V=I$. This is a Stinespring representation. Apply it to $B$, obtaining a state ${\eta }_{XCE}$; tracing out $E$ applies $\Phi$ to every ensemble member. An linear isometry preserves nonzero eigenvalues and therefore Von Neumann entropy, soTheir difference isThe Strong subadditivity of Von Neumann entropy states that this expression is nonnegative for every tripartite state. ConsequentlyThus the Holevo quantity under a quantum channel decreases because discarding the dilation environment cannot improve correlations with the classical label. The probabilities remain unchanged throughout.

Write a qubit density operator as $\rho =(I+\mathbf{r}\cdot \mathbf{\sigma })/2$, with Bloch vector $|\mathbf{r}|\le 1$. The depolarizing channel sends $\mathbf{r}$ to $p\mathbf{r}$. Its output eigenvalues are $(1\pm |p||\mathbf{r}|)/2$, so its Von Neumann entropy is minimized at $|\mathbf{r}|=1$. DefineThe minimum output entropy is $h(q)$, since binary entropy is symmetric under $q\mapsto 1-q$. The usual probabilistic-mixture convention has $0\le p\le 1$. The argument also holds throughout the physical qubit CPTP range $-1/3\le p\le 1$, where this $q$ still lies in $[0,1]$.

To handle multiple channel uses, let a classical message $x$ select a product input ${\rho }_x={⨂}_{j=1}^n{\rho }_{xj}$ with probability ${\pi }_x$. Memorylessness gives product outputs ${\sigma }_x={⨂}_j\Phi ({\rho }_{xj})$. Additivity of Von Neumann entropy on tensor products gives $S({\sigma }_x)\ge nh(q)$. The average output $\bar{\sigma }={\sum }_x{\pi }_x{\sigma }_x$ acts on $n$ qubits, so $S(\bar{\sigma })\le {\log }_2(2^n)=n$. Thus the Holevo quantity obeys the product-input block bound for a qubit depolarizing channelThe Holevo bound says the classical mutual information obtained by any measurement, including a joint measurement on all outputs, is at most $\chi$.

For a reliable code with $M$ equiprobable messages and decoding error $P_e$, Fano's inequality gives $H(X\mid \hat{X})\le h(P_e)+P_e{\log }_2(M-1)$. Consequently $(1-P_e){\log }_{2}M\le n[1-h(q)]+h(P_e)$. Letting the error tend to zero proves $\boxed{\mathcal{I}(\Phi )\le 1-h((1-p)/2)}$.

The bound is tight: equal use of $|0⟩,|1⟩$ and computational-basis output measurements produce a binary symmetric channel with crossover probability $q$. Ordinary classical coding achieves $1-h(q)$ bits per use.

For an ensemble $\mathcal{E}=\{p_i,{\rho }_i\}$, write its channel-output Holevo quantity asTake ensembles ${\mathcal{E}}_1=\{p_i,{\rho }_i\}$ and ${\mathcal{E}}_2=\{q_j,{\sigma }_j\}$ independently, giving the product ensemble $\{p_i{q}_j,{\rho }_i\otimes {\sigma }_j\}$. Its average output factors:The Von Neumann entropy of a tensor product is the sum of its entropies. Applying this both to the average and to every labelled output givesChoose each ensemble within $\epsilon$ of its supremum. The supremum for the joint channel includes this product ensemble, so its value is at least ${\chi }^{\ast }({\Phi }_1)+{\chi }^{\ast }({\Phi }_2)-2\epsilon$. Let $\epsilon \downarrow 0$. The superadditivity of Holevo capacity follows:This argument does not restrict the joint supremum to product ensembles and does not require the individual suprema to be attained.

For a finite-dimensional memoryless quantum channel $\Lambda$, the Holevo-Schumacher-Westmoreland theorem identifies its product-state classical capacity with the optimized output Holevo quantity:With product codewords and a collective measurement on the outputs, every rate below this value is achievable with vanishing error; no larger rate can be reliable under that product-input restriction. For a fixed classical-quantum output alphabet the corresponding optimized entropy difference gives its classical coding capacity. If entangled inputs across channel uses are also allowed, the general unassisted capacity is the regularized value $C(\Lambda )={\lim }_{n\to \infty }{n}^{-1}{\chi }^{\ast }({\Lambda }^{\otimes n})$. The requested calculation below concerns the single-use optimized product-input expression, so no unproved additivity assumption is needed.

Write $X$ and $Y$ for the classical quantum registers $\tilde{X}$ and $\tilde{Y}$. By the quantum mutual information formula $I(U:V)=S(U)+S(V)-S(UV)$, expanding the right-hand side of the quantum mutual information balance identity givesAll Von Neumann entropies here are evaluated in $\omega$.

We use three facts: quantum mutual information is nonnegative by nonnegativity of quantum relative entropy; a local quantum channel cannot increase it by data processing for quantum mutual information; and the quantum mutual information of a classical-quantum state is its ensemble's Holevo quantity. Write $\chi (\mathcal{T})$ for the Holevo capacity, the supremum of the output Holevo quantity over finite input ensembles.

The $XB$ marginal is an output ensemble for $\mathcal{E}$, with inputs $\rho (x{)}_A={\mathrm{Tr}}_C\rho (x{)}_{AC}$. Consequently $I(X:B{)}_{\omega }\le \chi (\mathcal{E})$. Also ${\omega }_{XBD}$ is obtained from ${\sigma }_{XYD}$ by a quantum channel on $XY$ which retains $X$ and prepares $B$ from $Y$. HenceTo bound the latter even for entangled states $\rho (x{)}_{AC}$, exhibit the conditional input ensemble after a local measurement. Setwhen $q(y|x)>0$; zero-weight outcomes can be omitted. The numerator is a positive operator, its trace is $q(y|x)$, and the $q(y|x)$ sum to one. ThusThis is a classical-quantum state with an output ensemble for $\mathcal{N}$, so $I(XY:D{)}_{\sigma }\le \chi (\mathcal{N})$. Combining these bounds with $I(B:D{)}_{\omega }\ge 0$ yieldsThe last step takes the supremum over all input ensembles on $AC$. The left-hand channel direction is $B\leftarrow A$, as established in part (i); the printed $A\leftarrow B$ in the last inequality is a typographical reversal. Independent product ensembles also give the reverse inequality, so this proves Holevo-capacity additivity for entanglement-breaking channels.