The useful object is the Choi state of the entanglement-breaking channel. Put , introduce a reference with the same computational basis as , and use the normalized maximally entangled stateThe entanglement-breaking channel makes a separable quantum state. Its partial trace is , because is a quantum channel. Write a separable positive operator decompositionDiscard any term with : a positive operator with zero trace is zero. DefineEach is a density operator. Each is a positive operator, and taking the matrix transpose of the partial trace identity givesThus the form a POVM. In this reference-first convention, the Choi reconstruction formula isThe factor is essential because we used a normalized Choi state. A measurement channel storing the outcome , followed by the prescribed quantum state preparation of , has precisely this action on every linear operator . The desired factorization is therefore
Write and for the classical quantum registers and . By the quantum mutual information formula , expanding the right-hand side of the quantum mutual information balance identity givesAll Von Neumann entropies here are evaluated in .
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 for the Holevo capacity, the supremum of the output Holevo quantity over finite input ensembles.
The marginal is an output ensemble for , with inputs . Consequently . Also is obtained from by a quantum channel on which retains and prepares from . HenceTo bound the latter even for entangled states , exhibit the conditional input ensemble after a local measurement. Setwhen ; zero-weight outcomes can be omitted. The numerator is a positive operator, its trace is , and the sum to one. ThusThis is a classical-quantum state with an output ensemble for , so . Combining these bounds with yieldsThe last step takes the supremum over all input ensembles on . The left-hand channel direction is , as established in part (i); the printed 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.
Use an orthonormal eigenbasis of the Hermitian operator and set . Since is a positive contraction,For , the missing weight among the first entries equals the weight in the remaining entries:The ordered eigenvalues satisfy for and for . ThereforeThis argument does not require the eigenvalues of to be positive. For , positivity and zero trace give ; for , the same argument applied to gives . Thus in every caseThe orthogonal projection onto the leading eigenvectors attains equality. This is the Hermitian effect variational principle, extending the Ky Fan maximum principle to all positive contractions with the prescribed trace.
Choose Kraus representationsThe composite quantum channel has Kraus operators . Each has matrix rank at most , because it factors through the -dimensional space , andThe operation fidelity uses the unsquared quantum fidelity on a purification of a density operator, so its square is entanglement fidelity. The Kraus formula for entanglement fidelity givesIndeed each overlap equals .
For any one of these Kraus operators , let be the orthogonal projection onto its image, of matrix rank . Since , the Cauchy-Schwarz inequality for the Hilbert-Schmidt inner product gives the rank bound for a weighted operator trace:The last step uses part (i) at , followed by nonnegativity of the eigenvalues of the density operator . Summing over the Kraus operators and using their completeness relation proves the finite-dimensional quantum compression converse:No invertibility of , or restriction to an isometric decoder, was used.
The absolute value of an operator, trace norm, and operator norm are respectivelyThe positive square root of an operator makes well defined. Its eigenvalues are the singular values of , so and .
Use the polar decomposition of a bounded operator , with the given unitary operator . In an orthonormal eigenbasis for ,The operator norm assumption and unitarity imply . The triangle inequality therefore yields the required trace estimate:Choosing attains equality, which also gives the finite-dimensional trace duality formula . A singular causes no difficulty: in a finite-dimensional square space the polar factor can be extended to a unitary operator on the complementary subspaces.
Let denote the partial transpose. The partial transpose of a maximally entangled projector iswhere is the swap operator, satisfying and . If has positive partial transpose, then is a positive operator of trace one, hence .
For a pure state , the unsquared quantum fidelity obeys . Using the trace-adjoint identity for partial transpose and part (i),The overlap is nonnegative, so taking its square root proves the PPT maximally entangled overlap bound:The product state attains the bound, so it is sharp.
In the computational basis ordered as , the Hermitian matrix isIts trace is one, and its eigenvalues are , , , and . Thus the remaining density operator condition, positivity, holds exactly when both nonzero candidates are nonnegative:This is the admissible parameter interval for the dephased Bell-state mixture.
A density operator is a pure state exactly when its matrix rank is one. Within the admissible interval from part (a), one of and must vanish. Therefore the pure-state parameters and vectors arewhere the Bell states are . Equivalently, the purity of a density operator is , reaching one exactly at these two endpoints.
Every separable quantum state has positive partial transpose. Here the partial transpose iswith eigenvalues . Any nonzero therefore gives a negative eigenvalue, excluding a separable quantum state. At , the explicit decompositionis a mixture of product states. ConsequentlyOnly necessity of the positive partial transpose criterion is needed here; sufficiency at zero follows directly from the decomposition.
For any normalized pure state on finite-dimensional Hilbert spaces , the Schmidt decomposition givesThe and form orthonormal sets in their respective spaces. The positive numbers are the Schmidt coefficients, and is the Schmidt rank. Taking a partial trace gives the reduced density matricesThus the nonzero eigenvalues of the two reduced density matrices agree.
One construction is a singular value decomposition of the coefficient matrix in . If , the columns of give , the complex conjugates of the columns of give , and the singular values give . This also explains why the Schmidt coefficients are real and nonnegative.
The coefficient matrix in the computational basis isFor a bipartite pure state, the partial traces give and . Therefore the requested reduced density matrices areThe columns of are orthogonal. Their norms are and , so normalizing them gives the orthonormal setWith and , a Schmidt decomposition isExpanding this expression reproduces the minus sign in the coefficient. The two reduced density matrices both have eigenvalues and , consistent with these Schmidt coefficients.
Write . Normalization says , and the Schmidt rank equals the matrix rank of . Its nonzero singular values are therefore with .
The overlap with the maximally entangled state is . The trace norm estimate of Q3(i), with test linear operator , followed by the Cauchy-Schwarz inequality, givesFor two pure states, the unsquared quantum fidelity is the absolute value of their overlap. Hence the maximally entangled overlap bound from Schmidt rank isThe bound is attained by . Thus uniform Schmidt coefficients on aligned basis pairs give the greatest possible overlap for that Schmidt rank.
Use logarithms to base two, so Von Neumann entropy and quantum relative entropy are measured in bits. For density operators ,The quantum relative entropy formula applies when the support of a positive operator is contained in that of ; otherwise . Use in the Von Neumann entropy formula.
The binary density operator is diagonal with eigenvalues . Its Von Neumann entropy is the binary entropy:The two diagonal density operators commute, so their quantum relative entropy isA term with zero numerator has value zero; a positive numerator and zero denominator give . In particular, , whereas or gives .
Choose uniform on and zero outside it, so the marginal density operator of is . Define the binary test for quantum decoding success byEach is a positive contraction. The computational basis blocks of are these effects on and zero elsewhere. Thus , making a POVM on the whole space, including labels outside .
On the correlated classical-quantum state, its acceptance probability isOn the product of the marginal density operators,since . The two requested probabilities are therefore and . In the notation for binary output density operators, the measurement channel sends the joint input to and the product input to ; their parameters describe outcome one, not outcome zero.
For the distribution and POVM from part 2, apply the data-processing inequality for quantum relative entropy to the measurement channel. The quantum mutual information is the quantum relative entropy from the joint density operator to the product of its marginals, so for ,The last step uses for the binary entropy and . If , rearrangement and then the supremum over give the one-shot classical-quantum coding converse:For , the sole POVM effect is , forcing , and the bound is trivial. For , division by is undefined: the undivided inequality remains valid and gives no size restriction. The displayed coding bound is therefore understood for , or with a vacuous right-hand side at .
An alternative uses the original decoder directly. Let be the uniform message and its measured estimate. For , Fano's inequality bounds the conditional entropy by . The Holevo bound givesThus the same coding bound follows by bounding the classical mutual information obtainable from the POVM.
Articles by others on the same topic
There are currently no matching articles.