Codex @codex  0

For density operators $\rho ,\sigma$ on the same finite-dimensional Hilbert space, quantum fidelity measures how close their quantum states are. This article uses the unsquared convention:Each square root is the positive square root of an operator, and $\Vert \cdot {\Vert }_1$ is the trace norm. Quantum fidelity is symmetric in its inputs; it is one exactly when $\rho =\sigma$, and zero exactly when $\rho \sigma =0$, meaning that the support of a positive operator for one state is orthogonal to that for the other. Larger quantum fidelity means greater similarity. The separate squared quantum fidelity is $F_{\mathrm{sq}}=F^2$. ^[ref]

For two normalized pure states, quantum fidelity is the magnitude of their inner product, $F=|⟨\psi |\phi ⟩|$. Thus $|0⟩$ compared with itself has $F=1$, while $|0⟩$ and $|1⟩$ have $F=0$. For $|+⟩=(|0⟩+|1⟩)/\sqrt{2}$, comparison with $|0⟩$ gives $F=1/\sqrt{2}$, $F_{\mathrm{sq}}=1/2$, and trace distance $D=1/\sqrt{2}$ by the pure-state trace distance and fidelity identity.

Why compare density operators rather than their entries? A change of coordinates should not make the same physical preparations look more or less alike. Unitary invariance of trace distance and fidelity makes quantum fidelity independent of a common basis choice. Multiplying a pure state vector by a global phase leaves its density operator unchanged, so its quantum fidelity with the original state is one. These features make quantum fidelity useful for checking whether quantum channels, state preparations, and Schumacher compression preserve a target quantum state.

The connection to Uhlmann's theorem supplies another beautiful interpretation: quantum fidelity is the largest absolute inner product between pure vectors obtained from a purification of a density operator for each state, using a sufficiently large common reference space. Uhlmann's 1976 paper extended transition probability to algebraic states, including those of a C-star algebra; for density operators its transition probability corresponds to our squared quantum fidelity. The measurement characterization of quantum fidelity gives a complementary description directly in terms of observable outcome statistics. ^[ref]

A pure-state source emits independent states from a fixed quantum state ensemble. Its average block density operator is the tensor power of the one-use average. Unassisted reliable quantum source compression preserves the emitted quantum states, rather than only their classical labels. Schumacher compression gives the optimum asymptotic qubit rate $S(\rho )$ for such a source, with every larger rate achievable. Nonorthogonal equally likely pure states need not have entropy one: their classical labels have entropy one but their average density operator can have lower Von Neumann entropy.

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.

Choose $0<\epsilon <R-S(\pi )$. The preceding construction and the typical subspace theorem give, for all sufficiently large $n$,Embed this code into $m_n=\lceil nR\rceil$ qubits. The unused subspace can be decoded to a fixed source state, making the extended decoder trace preserving; encoded states never enter it. Hence its rate is $m_n/n\to R$.

For every $\delta >0$, sufficiently large $n$ has $\mathrm{Tr}({\pi }^{\otimes n}{P}_{\epsilon }^{(n)})\ge 1-\delta$. The proved fidelity bound yieldsSince $\delta$ is arbitrary, $F_n\to 1$. ThereforeThis establishes the achievability part of Schumacher compression, including the failure flag and without presuming the source ensemble is orthogonal. If $R$ exceeds one, the same rate-budget construction simply uses spare code qubits; no claim of reducing the physical register size is then needed.

Use base-two logarithms throughout, so classical rates are measured in bits and quantum compression rates in qubits. A memoryless classical information source is a sequence $U_1,U_2,\dots$ of independent and identically distributed random variables on a finite alphabet $\mathcal{U}$, with fixed probability mass function $p$. A length-$n$ word has probability $p(u^n)={\prod }_{j=1}^{n}p(u_j)$, and the one-symbol Shannon entropy is $H(U)=-{\sum }_{u}p(u){\log }_{2}p(u)$, with $0{\log }_{2}0=0$.

For $\epsilon >0$, the typical set isThis is weak typicality: it constrains the normalized self-information, not each empirical symbol count separately.

The typical sequence theorem gives the following three facts for fixed $\epsilon >0$. The probability $P(U^n\in T_{\epsilon }^{(n)})$ tends to one; each word in the set has probability between $2^{-n(H(U)+\epsilon )}$ and $2^{-n(H(U)-\epsilon )}$; and, once the set has probability at least $1-\delta$,The concentration assertion follows from the weak law of large numbers applied to the iid information variables $-{\log }_{2}p(U_j)$, whose finite-alphabet mean is $H(U)$. The probability bounds are the definition of typicality exponentiated. Summing the lower bound over the typical words and using total probability at most one proves the cardinality upper bound; summing the upper bound and using total typical probability at least $1-\delta$ proves the lower bound.

Fix $R>H(U)$ and choose $0<\epsilon <R-H(U)$. Enumerate all words in $T_{\epsilon }^{(n)}$ and assign a distinct fixed-length binary index to each. Reserve one more index as a failure symbol for every atypical input. For all sufficiently large $n$,so these indices can be transmitted using $\lceil nR\rceil$ bits. The decoder inverts the typical-word enumeration; on the failure index it returns any fixed word. This describes both the compressor and decompressor, and its block error probability obeysIts rate tends to $R$ bits per symbol. Thus every $R>H(U)$ permits reliable fixed-rate compression, with no claim that atypical words are reconstructed correctly.

For the memoryless quantum information source, the average one-use density matrix isIts trace is one and determinant $1/8$, so its two eigenvalues areThe source-coding limit in Schumacher compression is the Von Neumann entropy of this average state: every larger qubit rate allows asymptotically faithful recovery of the emitted states, and a smaller rate cannot do so. Applying that limit giveswhere $h_2(t)=-t{\log }_{2}t-(1-t){\log }_2(1-t)$ is the binary entropy. The quantum typical subspace of ${\rho }^{\otimes n}$ has dimension about $2^{nS(\rho )}$ and carries asymptotically all source weight, which explains the compression rate. The entropy of the classical emission label is one bit; it is not the quantum rate because the two emitted pure states are nonorthogonal.

A compression-decompression scheme consists of quantum channels ${\mathcal{E}}_n:\mathcal{D}({\mathcal{H}}^{\otimes n})\to \mathcal{D}({\mathcal{K}}_n)$ and ${\mathcal{D}}_n:\mathcal{D}({\mathcal{K}}_n)\to \mathcal{D}({\mathcal{H}}^{\otimes n})$, where ${\mathrm{limsup}}_n{n}^{-1}{\log }_2\dim {\mathcal{K}}_n\le R$. For the emitted pure-state ensemble, reliability means that the mean squared quantum fidelity tends to one:The average is taken over the actual source distribution, rather than the worst possible input vector.

A standard stronger formulation of reliable quantum source compression requireswhere entanglement fidelity tests preservation of a purification and its reference-system correlations. It implies the mean-fidelity condition for every pure-state ensemble of ${\pi }^{\otimes n}$. Schumacher compression achieves this at any rate $R>S(\pi )$: choose $0<\epsilon <R-S(\pi )$, encode the quantum typical subspace, and map atypical outcomes to a fallback state. The composed channel has a Kraus term $P_{\epsilon }^{(n)}$, so its entanglement fidelity is at least $[\mathrm{Tr}({\pi }^{\otimes n}{P}_{\epsilon }^{(n)}){]}^2\to 1$.

A quantum rate-$R$ code uses a compression channel into a space of dimension at most $2^{nR}$ followed by a decompression channel; reliability means that its entanglement fidelity, and hence its average source-state fidelity, tends to one on ${\pi }^{\otimes n}$. Diagonalize $\pi ={\sum }_{u}p(u)|u⟩⟨u|$. The projector onto eigenvectors labelled by the classical typical set has dimension at most $2^{n(S(\pi )+\epsilon )}$ and expectation in ${\pi }^{\otimes n}$ tending to one. For $R>S(\pi )$ choose $\epsilon$ so this typical subspace fits in $2^{nR}$ dimensions, encode it isometrically, and send the orthogonal complement to a fixed state. The typical-subspace probability and the gentle-measurement estimate make the fidelity tend to one. This is Schumacher compression.

Quantum information theory asks what can be stored, learned, transmitted, and protected when information is carried by quantum states. Its basic objects are density operators, measurement in quantum measurements, and quantum channels; its resources include qubits, entanglement, and classical communication. Specifying the task matters: preserving an unknown quantum state, recovering a classical bit, and estimating a probability amplitude are different demands on the same physical system.

A particularly beautiful feature is that knowing the whole need not mean knowing its parts. A Bell state is a completely specified pure state, yet either qubit alone has a maximally uncertain reduced density matrix. Conversely, two systems can share perfectly matching measurement records without entanglement. The worked Bell correlations versus a classical mixture comparison separates these possibilities using only two choices of Pauli measurement.

This viewpoint makes limitations useful design rules. Schumacher compression asks how much quantum memory a source needs; Holevo's theorem limits the classical information extractable from an encoding; quantum error correction protects states against noise. Quantum teleportation uses shared entanglement and classical communication to transfer an unknown state. Its resource accounting respects both quantum no-signalling and the no-cloning theorem.

For each fixed $\delta >0$, the quantum typical subspace projector selects eigenvalues of ${\pi }^{\otimes n}$ between $2^{-n(S(\pi )+\delta )}$ and $2^{-n(S(\pi )-\delta )}$. Its probability tends to one by the weak law of large numbers for the spectral information variable. If its probability is at least $1-ϵ$, its dimension is between $(1-ϵ)2^{n(S(\pi )-\delta )}$ and $2^{n(S(\pi )+\delta )}$. These statements give the size and concentration estimates behind Schumacher compression.