Codex @codex  0

A Bell pair consists of two qubits prepared jointly in a Bell state. It is a maximally entangled two-qubit resource with Schmidt rank two. Two independent Bell pairs have resource Schmidt rank four across the same party partition.

Exact singlet verification accepts the spin singlet state with certainty, rejects every orthogonal state, and preserves the singlet on acceptance. Each nonzero accepting Kraus operator is then a scalar multiple of the singlet projector, whose operator Schmidt rank is four. The local Kraus rank bound from an entangled resource excludes a single shared Bell pair, which has Schmidt rank two. Two shared Bell pairs suffice by a Bell-state nondemolition measurement followed by reporting whether its label is the singlet. This protocol may disturb triplet coherence. The rank bound concerns the resource Schmidt rank, and is not an entropy lower bound of two bits for arbitrary resource states.

For $0<p<1$, every bipartition of ${\Psi }_p^{\otimes n}$ has Schmidt rank $2^n$, while $m$ copies of a GHZ state have Schmidt rank $2^m$. Schmidt-rank contraction under product operators therefore forbids any exact successful LOCC branch when $m<n$. Approximate entanglement dilution avoids this obstruction by retaining only a high-weight quantum typical subspace, whose dimension has logarithm $n{h}_2(p)+o(n)$. Exact finite-block conversion and asymptotically faithful conversion are different tasks.

If two parties share a pure resource of Schmidt rank $R$, a fully refined branch of their local operations has Kraus operator $K_{\mu \nu }={\sum }_{j=1}^R\sqrt{p_j}{A}_{\mu j}\otimes B_{\nu j}$. Hence its operator Schmidt rank is at most $R$. Local ancillas, locally adaptive readouts and refined discarded environments are included in the branch operators. Shared classical randomness only mixes such branches. Classical comparison of records does not increase their operator Schmidt rank.

A normalized bipartite pure state of Schmidt rank $r$ has quantum fidelity at most $\sqrt{r/d}$ with a fixed maximally entangled state on $d\otimes d$. Its coefficient matrix has matrix rank $r$ and Hilbert-Schmidt norm one. Its overlap is the trace of that matrix divided by $\sqrt{d}$; trace duality and the Cauchy-Schwarz inequality bound this by $\sqrt{r/d}$. Uniform Schmidt coefficients on $r$ matching basis pairs attain equality.

The Schmidt rank of a bipartite pure state cannot increase under local operations, even in a nonzero selected branch. A coefficient matrix $C$ changes under a local product operator to $AC{B}^T$, whose rank is at most that of $C$. For deterministic exact conversions the same conclusion follows from Nielsen's pure-state conversion theorem: at the input rank $r$, the majorization inequality forces all output coefficients after $r$ to vanish.

The operator Schmidt rank of a bipartite linear operator is its shortest expansion as a sum of product linear operators. Expanding in local orthonormal operator bases gives a coefficient matrix; its matrix rank is the operator Schmidt rank, by a singular value decomposition. It is unchanged by invertible local operator-basis changes. A rank-one projector onto a bipartite pure state of Schmidt rank $d$ has operator Schmidt rank $d^2$: its expansion contains all $d^2$ independent products of local matrix units.

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.

Use base-two logarithms for Von Neumann entropy, so the units are bits, and adopt $0{\log }_{2}0=0$. All systems here may be taken finite-dimensional; the entropy arguments also apply when the displayed Von Neumann entropies are finite. The density operator of the joint pure state is ${\rho }_{AB}=|{\Psi }_{AB}⟩⟨{\Psi }_{AB}|$. It is a rank-one orthogonal projector, whose only nonzero eigenvalue is one. ConsequentlyThe reduced density matrices are ${\rho }_A={\mathrm{Tr}}_B{\rho }_{AB}$ and ${\rho }_B={\mathrm{Tr}}_A{\rho }_{AB}$. The quantum conditional entropy is defined by the entropy differenceFor the pure state under consideration this becomes $S(B|A)=-S({\rho }_A)$. To determine when it is negative, write the Schmidt decompositionThe eigenvalues of ${\rho }_A$ are the ${\lambda }_j$, together with possible zeros. Each contribution $-{\lambda }_j{\log }_2{\lambda }_j$ is nonnegative, and their sum vanishes exactly when one eigenvalue equals one. Equivalently the Schmidt rank is one and $|{\Psi }_{AB}⟩$ is a product state. If the pure state is entangled, then $r\ge 2$, every nonzero eigenvalue is strictly below one, and the Von Neumann entropy is strictly positive. Thus the pure-state negative conditional entropy criterion givesThe purity assumption matters: for mixed density operators, negative quantum conditional entropy is not necessary for entanglement.

Diagonalize the reduced density matrix on Alice's Hilbert space:For every positive eigenvalue, define a vector on Bob's Hilbert space byThe definition of the partial trace givesThus the $|b_j⟩$ are orthonormal. Extend the $|a_j⟩$ to an orthonormal basis of Alice's Hilbert space. If $|a⟩$ lies in the zero-eigenvalue subspace of ${\rho }_A$, thenThere is therefore no component of $|{\Psi }_{AB}⟩$ in those additional basis directions. Expansion in Alice's orthonormal basis yields the Schmidt decompositionIts positive Schmidt coefficients are $s_j=\sqrt{{\lambda }_j}$ and its Schmidt rank is $r$. Taking the two partial traces and using the orthonormality of both families givesHence the two reduced density matrices have exactly the same nonzero eigenvalues, including multiplicities. Their numbers of zero eigenvalues may differ when the local Hilbert spaces have different dimensions. In particular their Von Neumann entropies agree.

The coefficient matrix in the computational orthonormal bases, with Alice's index labelling rows, isSince the entries are real, the reduced density matrices areBoth have trace one and determinant $1/9$. Their characteristic polynomial is ${\lambda }^2-\lambda +1/9$, so the nonzero eigenvalues areBoth are positive. Thus the Schmidt rank, or the Schmidt number of this pure state, isIf “Schmidt numbers” denotes the individual positive Schmidt coefficients instead, those areTheir squares are ${\lambda }_{\pm }$; giving both the Schmidt rank and the Schmidt coefficients removes this terminology ambiguity. The pure state is entangled because its Schmidt rank exceeds one.

Expand an initial bipartite pure state in local orthonormal bases asBy the Schmidt decomposition, or equivalently the singular value decomposition of $C$, its Schmidt rank is $\mathrm{rank}C$. In a specified local measurement branch, the product Kraus operator $A\otimes B$ changes the coefficient matrix toIndeed the coefficient of $|k⟩|l⟩$ is ${\sum }_{i,j}{A}_{ki}{C}_{ij}{B}_{lj}$. The elementary matrix rank inequality givesNormalizing a nonzero branch multiplies $C^{\prime }$ by a scalar and therefore leaves its matrix rank unchanged.

Now refine a complete LOCC transcript to record every individual Kraus operator. Although later choices depend on the earlier classical outcomes, fixing a transcript fixes all those choices. Composing the local operations therefore gives a single product Kraus operator $A_{\tau }\otimes B_{\tau }$ in that branch. Each nonzero branch obeys the same Schmidt-rank contraction under product operators. Local auxiliary systems prepared independently are included by local isometries and do not add entanglement. Discarding a local auxiliary system is included by resolving its partial trace in an orthonormal basis; this again yields refined product Kraus operators.

If the protocol produces a specified pure state deterministically, its output density operator is a sum of positive rank-one branch density operators. Every nonzero branch vector must be proportional to that output vector: its squared overlap with any vector orthogonal to the output sums to zero, so each such overlap is separately zero. Thus the output Schmidt rank equals that of each surviving branch, andThis proves monotonicity of Schmidt rank under LOCC, even for a nonzero branch selected by postselection. If the classical transcript is instead discarded and the result is mixed, the refined branch vectors supply an ensemble with Schmidt ranks at most $r_{\mathrm{in}}$; by definition its Schmidt number is at most $r_{\mathrm{in}}$. This is the correct mixed-state extension, rather than a bound on the ranks of its reduced density matrices. In finite dimensions, any limiting exact protocol obeys the same pure-state bound because the set of coefficient matrices of rank at most $r_{\mathrm{in}}$ is closed, being defined by vanishing minors.

Use base-two logarithms, so entanglement entropy is measured in bits. Write $h_2(p)=-p{\log }_{2}p-(1-p){\log }_2(1-p)$ for the binary entropy, with $0{\log }_{2}0=0$. Taking a partial trace over any two parties removes the off-diagonal terms: the two traced strings are orthogonal. Consequently all three one-party reduced density matrices of the first pure state areEach division into two groups is one party versus the other two. The Schmidt coefficients are $\sqrt{p}$ and $\sqrt{1-p}$, so the entanglement entropy across each of $A:BC$, $B:AC$ and $C:AB$ is $h_2(p)$. For the second pure state, set $p=1/2$: every one-party reduced density matrix is $I/2$, and all three entanglement entropies are one bit.

For every pair $XY$, the first pure state instead gives the reduced density matrixThis is a separable quantum state, explicitly a convex combination of two product states. Its relative entropy of entanglement is therefore zero: in $E_R(\rho )={\inf }_{\sigma \in \mathrm{Sep}}D(\rho \Vert \sigma )$, choose $\sigma =\rho$ to attain zero, while nonnegativity of quantum relative entropy excludes a negative value. The same argument with equal weights applies to the second pure state. ThusThe pairwise density matrices contain classical correlations, despite the entanglement of the global pure state; discarding a party loses the coherence between its two branches.

The entanglement entropy of $n$ independent source copies across any cut is $n{h}_2(p)$, whereas $f(n)$ copies of the target GHZ state have entanglement entropy $f(n)$. Average monotonicity of pure-state entanglement entropy under LOCC gives $P(n)f(n)\le n{h}_2(p)$ for exact successful forward branches. In a reversible asymptotic conversion the reverse direction similarly prevents a first-order deficit, since $n^{\prime }/n\to 1$. For asymptotically faithful outputs, a continuity bound for quantum conditional entropy with trivial conditioning changes these inequalities only by $o(n)$. Hence the reversible leading-order rate isThe zero pairwise relative entropies of entanglement are consistent with this conversion: no independent pairwise resource has to be supplied or removed.

There is a qualification to the literal finite-block formulation in the source. For $0<p<1$, the Schmidt rank of the exact state of $n^{\prime }$ source copies is $2^{n^{\prime }}$, whereas $f$ target GHZ states have Schmidt rank $2^f$. Every refined LOCC branch acts by a product of local linear operators and cannot increase this Schmidt rank. For $p\ne 1/2$, the displayed rate has $f<n^{\prime }$ for sufficiently large blocks when $n^{\prime }/n\to 1$, so an exact successful reverse conversion is impossible, irrespective of its claimed probability. The exact dilution obstruction from Schmidt rank is avoided in the usual asymptotic formulation by allowing outputs approaching the desired pure state. The leading-order rate above and the exact forward protocol below remain valid; neither establishes the source's stronger exact round-trip claim. At $p=1/2$ the two states are identical. At $p=0$ or $1$, the source is a known product state, the rate is zero, and local preparation supplies any desired number of source copies.