Codex @codex  0

A quantum error-correcting code is a subspace encoding a logical Hilbert space, together with a specified family of noise operators that a common recovery quantum channel reverses on every encoded state. A K-dimensional code carries ${\log }_{2}K$ logical qubits. For a code projector $P$, correctability is characterized by the Knill--Laflamme condition; code distance is defined by the smallest undetectable operator weight, not merely by the number of generators.

Quantum error correction protects a logical qubit by encoding its quantum state into a larger Hilbert space, where a specified family of physical errors can be diagnosed and reversed by a common recovery quantum channel. The requirement is to restore every encoded quantum superposition, including its relative phase, rather than only the computational basis states. A quantum error-correcting code specifies which errors have this protection; it does not promise recovery from every possible disturbance.

The beautiful idea is to measure relations between physical qubits that reveal an error syndrome while revealing nothing about the protected logical qubit. For example, the bit-flip repetition code compares neighboring qubits without reading their individual values. Its parity checks can locate one Pauli X gate error while leaving the unknown coefficients intact. Encoding is a linear isometry, consistent with the no-cloning theorem: redundancy in a shared quantum state supplies protection without making independent copies of the unknown input.

Peter W. Shor's 1995 paper ^[ref], published on 1 October, introduced the nine-qubit Shor code to reduce quantum decoherence in memory. Andrew M. Steane's ^[ref], published on 29 July 1996 and ^[ref], connected quantum error correction to classical linear codes; the seven-qubit Steane code protects against arbitrary errors on one physical qubit. These constructions protect relative phase as well as computational basis values, going beyond the elementary bit-flip repetition code.

For an authored account of the mechanism, see John Preskill's ^[ref], especially section 7.1 on collective parity measurements and section 7.9 on stabilizer codes. Andrew Steane's A tutorial on quantum error correction develops the distinction between correcting a stored quantum state and operating with imperfect quantum gates.

For a quantum channel on a $d\ge 2$ dimensional system, purify the input to $|\Psi {⟩}_{QR}$ and set $\sigma =(\mathcal{N}\otimes \mathrm{id})(|\Psi ⟩⟨\Psi |)$. Its entanglement fidelity $F_e=⟨\Psi |\sigma |\Psi ⟩$ satisfies $S(\sigma )\le h(F_e)+(1-F_e){\log }_2(d^2-1)$. This is the entropy bound from overlap with a pure state in dimension $d^2$. For a trivial one-dimensional system the output entropy is zero.

Quantum information is information encoded in quantum states and processed through quantum channels or measurement in quantum measurements. A qubit supplies a two-dimensional state space; quantum phase and entanglement affect which operations and outcome statistics are possible. The Born rule connects the state description with the probabilities of classical measurement records.

The continuously varying probability amplitudes of a qubit do not supply a readable list of arbitrarily many classical bits. A measurement produces a classical record with state-dependent probabilities. Quantum state tomography estimates the state from many identically prepared systems. For a classical label encoded into one transmitted qubit, with no additional shared resource, Holevo's theorem bounds the mutual information available from a measurement by one bit. This bound concerns information about the label, rather than the number of possible outcome labels a measuring device can print. ^[ref]

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.

A quantum instrument associates each classical outcome with a completely positive trace-nonincreasing map; summing the outcome maps gives a quantum channel. It specifies both outcome probabilities and conditional output states.

A completely positive map with ${\sum }_{\alpha }{K}_{\alpha }^{†}{K}_{\alpha }\le I$ is a trace-nonincreasing quantum operation, representing an outcome branch with its probability retained in the trace. A deterministic quantum channel has equality and is trace preserving. Dividing a branch output by its trace gives a conditional state but generally produces a nonlinear update; that normalization is not part of the linear quantum operation.

In an orthonormal basis, rank-one dephasing is the quantum channel $\Delta (\rho )={\sum }_i|{\psi }_i⟩⟨{\psi }_i|\rho |{\psi }_i⟩⟨{\psi }_i|$. It removes off-diagonal entries while preserving the basis probabilities. Its output Von Neumann entropy is their Shannon entropy, and the relative-entropy identity for rank-one dephasing quantifies the entropy increase.

A quantum source-compression scheme has encoding and decoding quantum channels with compressed space ${\mathcal{K}}_n$ and rate ${\mathrm{limsup}}_n{n}^{-1}{\log }_2\dim {\mathcal{K}}_n$. For a pure-state source ensemble, average reliability means that the mean squared quantum fidelity after decoding tends to one. A stronger coherent criterion is $F_e({\pi }^{\otimes n},{\mathcal{D}}_n\circ {\mathcal{E}}_n)\to 1$, where entanglement fidelity also tests a purification reference. Encoding the quantum typical subspace achieves both criteria above $S(\pi )$. Schumacher's original quantum coding paper establishes quantum source coding.

A quantum channel is entanglement breaking exactly when its Choi state is a separable quantum state. If $C_{\Lambda }={\sum }_a{p}_a{\sigma }_a\otimes {\tau }_a$, the Choi reconstruction formula gives a measure-and-prepare channel with POVM $E_a=d{p}_a{\tau }_a^T$. Conversely, applying an entanglement-breaking channel to a maximally entangled state produces a separable Choi state. Horodecki, Shor and Ruskai's entanglement-breaking channel paper develops the equivalences.

Take independent ensembles for two quantum channels and their Cartesian product ensemble. The Von Neumann entropy of a tensor product is the sum of the two entropies, both for its average output and for each labelled output. Thus its Holevo quantity is the sum of the two individual quantities. Taking ensembles arbitrarily close to each supremum proves the displayed inequality without requiring maximizing ensembles to exist. It does not assert additivity for arbitrary channels.

Measure the commuting stabilizer generators $g_1=Z_1{Z}_2$ and $g_2=Z_2{Z}_3$ in that order. Use error syndrome bit $0$ for eigenvalue $+1$ and bit $1$ for eigenvalue $-1$. For $X_j$ the Pauli X gate on physical qubit $j$, every row holds for arbitrary normalized $\alpha ,\beta$. This ordered parity-check convention follows ^[ref]:

Each pair of computational basis words within a row has the same two parities. Consequently the projective measurement reveals the row without distinguishing its two amplitudes. For example, $|{\psi }_L⟩=(\sqrt{3}/2)|000⟩+(i/2)|111⟩$ becomes $(\sqrt{3}/2)|010⟩+(i/2)|101⟩$ under $X_2$. Both checks give $-1$ with probability one, and applying $X_2$ restores both coefficients exactly, including the relative phase $i$.

One implementation uses two quantum ancillas initialized to $|00⟩$. Two controlled-NOT gates from data qubits 1 and 2 to the first quantum ancilla write their parity; two more from data qubits 2 and 3 to the second quantum ancilla write the other parity. Measuring only the quantum ancillas in the computational basis gives $(s_1,s_2)$. Measuring the individual data qubits instead would reveal the encoded computational basis value and destroy the unknown quantum superposition. The existing coherent syndrome extraction for the three-qubit repetition code uses the alternative ordered checks $(Z_2{Z}_3,Z_1{Z}_3)$, so its bit labels differ from this table.

The recovery also handles coherent errors. Put $E_0=I,E_1=X_1,E_2=X_2,E_3=X_3$. Their images of the code are mutually orthogonal, giving $P{E}_a^{†}{E}_{b}P={\delta }_{ab}P$, the Knill--Laflamme condition for this family. For any linear combination $E={\sum }_{a=0}^3{c}_a{E}_a$, its component in sector $s(E_a)$ is $c_a{E}_a|{\psi }_L⟩$. Measuring that error syndrome has probability $|c_a{|}^2/{\sum }_b|c_b{|}^2$ on the normalized erroneous state, and recovery $E_a$ returns $|{\psi }_L⟩$. More generally one recovery quantum channel corrects every noise quantum channel whose Kraus operators belong to this span. The assumption concerns the whole jointly correctable family; it does not extend to the span of arbitrary single-site Pauli errors. ^[ref].

A fully computed coherent example is the unitary operator $U=\exp (-i\theta X_2)=\cos \theta I-i\sin \theta X_2$. At $\theta =\pi /6$ it givesThe error syndromes $00$ and $11$ occur with probabilities $3/4$ and $1/4$, independently of $\alpha ,\beta$. Doing nothing for $00$ and applying $X_2$ for $11$ restores the same logical qubit in both branches; the scalar $-i$ in the second branch is an irrelevant global phase. This is an example of linearity of coherent quantum error correction, rather than an assumption that the original error was a classical random bit flip.

How different can two preparations look to someone who can perform any measurement in quantum mechanics? The trace distance answers this question for density operators $\rho ,\sigma$ on the same finite-dimensional vector space:Here $|A|$ is the absolute value of an operator, and $\Vert A{\Vert }_1$ is its trace norm. Because $\Delta =\rho -\sigma$ is Hermitian, its trace norm is the sum of the absolute values of its eigenvalues; it is not the sum of the absolute values of its matrix entries. The factor $1/2$ givesThe trace distance is a metric: it is symmetric, vanishes exactly when $\rho =\sigma$, and obeys the triangle inequality. Identical preparations have trace distance zero; preparations with orthogonal occupied eigenspaces have trace distance one and can be identified perfectly in a single measurement in quantum mechanics.

Operationally, the trace distance is the largest total variation distance between the outcome probability distributions obtainable by a POVM. Equivalently, the variational characterization of trace distance says it is the largest possible probability gap for one event in a binary measurement in quantum mechanics. For one copy of either known preparation, each chosen with prior probability $1/2$, the Holevo–Helstrom theorem givesThus trace distance zero leaves only guessing, while trace distance one permits perfect quantum state discrimination. The optimum ranges over measurements; different measurement bases can expose different amounts of distinguishability. ^[ref]

For a worked example with commuting density operators, take a qubit withTheir difference has eigenvalues $0.5,-0.5$, so $D=(|0.5|+|-0.5|)/2=0.5$. Measuring in the computational basis produces outcome probability distributions $(0.8,0.2)$ and $(0.3,0.7)$, whose total variation distance is also $0.5$. Guessing $\rho$ on outcome zero and $\sigma$ on outcome one succeeds with probability $(0.8+0.7)/2=0.75$. A projective measurement in the Hadamard basis instead produces $(0.5,0.5)$ for both preparations and gives no discrimination advantage.

The trace-distance contraction under quantum channels ensures that a common quantum channel, including the partial trace, cannot increase the trace distance. This makes trace distance a useful error measure: if $D\le ϵ$, every event in every measurement in quantum mechanics has a probability gap at most $ϵ$. Losing access to a subsystem can hide distinguishability, but cannot create more of it.

By the variational characterization of trace distance, maximize $\mathrm{Tr}[P\mathcal{E}(\rho -\sigma )]$ over $0\le P\le I$. The adjoint of a quantum channel is positive and unital, so $0\le {\mathcal{E}}^{\ast }(P)\le I$. Moving the channel onto $P$ therefore restricts, rather than enlarges, the effects available in the input variational problem. This proves the displayed bound for every pair of density operators.