Codex @codex  0

The purity of a density operator is $\gamma =\mathrm{Tr}({\rho }^2)$. It equals one exactly for a pure state; in finite dimension $d$ it lies between $1/d$ and $1$. The minimum occurs exactly at the maximally mixed state $I/d$.

A worked qubit family interpolates between the mixed state $I/2$ and the pure state ${\rho }_{+}=|+⟩⟨+|$, where $|+⟩=(|0⟩+|1⟩)/\sqrt{2}$:The eigenvectors are $|\pm ⟩=(|0⟩\pm |1⟩)/\sqrt{2}$, with eigenvalues ${\lambda }_{\pm }=(1\pm p)/2$. Squaring and summing these eigenvalues givesHere $P_X(+)$ is the Born rule probability of the positive outcome in an $X$ projective measurement. The Bloch vector is $(p,0,0)$, since ${\rho }_p=(I+p{\sigma }_x)/2$ with ${\sigma }_x$ one of the Pauli matrices. At $p=0$ the purity is $1/2$; at $p=1/2$ it is $5/8$, with $P_X(+)=3/4$; at $p=1$ it is one. Within this family, $p=1$ is a pure state and every $p<1$ is a mixed state. Extending the formula to $p>1$ produces a negative eigenvalue $(1-p)/2$, so it ceases to be a density operator despite remaining Hermitian with trace one.

The Bloch vector length measures polarization: for any qubit density operator, $\gamma =(1+|\mathbf{r}{|}^2)/2$. This connects the interior of the Bloch ball with mixed states and its boundary, the Bloch sphere, with pure states. ^[ref]

For a short proof of the general bound, use the spectral theorem: the nonnegative eigenvalues ${\lambda }_j$ sum to one, so $\gamma ={\sum }_j{\lambda }_j^2$. ThenThe lower bound is attained only when all eigenvalues equal $1/d$; the upper bound is attained only when exactly one eigenvalue is nonzero, and hence equals one. Purity is therefore a simple quantitative test of mixedness, invariant under a unitary operator. It does not specify the entire density operator: even distinct pure states all have purity one. ^[ref]

Errors on a known subset of $m$ qubits are correctable by a distance-$d$ code whenever $m<d$. Every product $E_a^{†}{E}_b$ of errors supported on that subset still has support in the same subset, so its compression is scalar. The Knill--Laflamme condition therefore supplies one recovery for every channel on that subset. Equivalently, erasing the subset leaks no logical information to it: if a reference is maximally entangled with the encoded logical system, its joint density operator with the erased subsystem is a product state.

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.

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 unitary operation on a fixed number of qubits used as a component of a quantum circuit. Examples include the Hadamard gate and Controlled-Z gate. Measurements are described separately by quantum measurement; a gate is a reversible operation on its full input state.

A measurement in quantum mechanics turns a quantum state preparation into a classical outcome, such as a detector label. Two questions must be distinguished: how likely is each outcome, and what quantum state remains conditional on that outcome? A positive operator-valued measure answers the first; a quantum instrument answers both. This distinction is useful whenever a measured system participates in a later experiment, including quantum state tomography and measurement-based quantum feedback.

For a density operator $\rho$, the Born rule gives $p_m=\mathrm{Tr}(E_m\rho )$, where the $E_m$ are positive operators satisfying ${\sum }_m{E}_m=I$. Here $I$ is the identity operator, and $\mathrm{Tr}$ denotes the trace. Positivity makes every $p_m$ nonnegative; completeness makes their sum one. For a pure state, $\rho =|\psi ⟩⟨\psi |$ and $p_m=⟨\psi |E_m|\psi ⟩$. A projective measurement is the special case in which the $E_m$ are orthogonal projections onto mutually orthogonal subspaces.

For a qubit, choose the computational basis and write a normalized pure state, up to global phase, asThe angle $\varphi$ is a relative quantum phase; at the poles it does not distinguish states. Measuring the Pauli matrix $Z$ reports $+1$ for label zero and $-1$ for label one, withThese probabilities describe repeated identical preparations. They do not assign a hidden, pre-existing value to every possible measurement basis.

The Born rule grew out of Max Born's 1926 work on quantum scattering: squared probability amplitudes determine the relative frequencies of scattering outcomes. Born explained this statistical interpretation again in his 1954 Nobel lecture. This probability law does not by itself select a post-measurement state. ^[ref]; ^[ref].

Let $L=2^t$, let $j_0$ be the nearest label to $L\varphi$, and let $m\ge 2$. The exact quantum phase estimation amplitude is $L^{-1}{\sum }_{a=0}^{L-1}{e}^{2\pi ia(\varphi -j/L)}$. The sine bound on circular distances gives probability at most $1/(4d_j^2)$, where $d_j$ is the centered distance from $j$ to $L\varphi$. At label distance $\ell$ from $j_0$, $|d_j|\ge \ell -1/2$, with at most two labels for each $\ell$. Since $(\ell -1/2{)}^{-2}\le [(\ell -1)\ell {]}^{-1}$, the tail telescopes to the displayed bound. Adding $u$ control qubits beyond $b$ desired phase bits gives circular accuracy below $2^{-b}$ with failure probability at most $[2(2^u-1){]}^{-1}$.

An encoding stores $n$ classical bits in $m$ qubits so that a receiver who later chooses a bit index can recover that bit with a specified success probability. The sender cannot tailor the encoding to the unknown requested index. This task permits approximate recovery of any one bit rather than simultaneous recovery of all bits, and must specify whether additional communication, shared randomness, or entanglement is allowed.

A quantum register is a named tensor product factor of a quantum circuit's Hilbert space, usually a collection of qubits. Registers separate data, control, output and workspace roles; uncomputation returns workspace to a fixed quantum state without destroying coherence in the data.

For a code carrying $k>0$ logical qubits, two disjoint subsets $A,B$ of $d-1$ physical qubits are each correctable erasures. Purify the maximally mixed logical input using a reference $R$, and call the remaining physical subsystem $C$. Erasure decoupling gives $S(RA)=S(R)+S(A)$ and $S(RB)=S(R)+S(B)$. Purity and Subadditivity of Von Neumann entropy imply $2S(R)\le 2S(C)$, hence $k\le n-2(d-1)$. If two such disjoint subsets would not fit, partition the entire physical system into two correctable subsets; purity and decoupling then force $S(R)=0$, a contradiction. Thus the partition used in the proof is justified independently of the bound.

A quantum state describes a preparation through its predicted measurement in quantum mechanics probabilities. In the Hilbert space formulation, a pure state is a quantum state ray: a normalized vector representative $|\psi ⟩$ satisfies $⟨\psi |\psi ⟩=1$, and representatives differing by a global phase describe the same quantum state. ^[ref]

Both pure states and mixed states are represented by a density operator on the chosen complex Hilbert space:Thus $\rho$ is Hermitian, positive semidefinite and of unit trace; in infinite dimension it must also be a trace-class operator. For a normalized pure state, $\rho =|\psi ⟩⟨\psi |$ is a rank-one orthogonal projection. A mixed state has no single such vector representative. Its density matrix is the matrix of $\rho$ in a chosen orthonormal basis. ^[ref] For a discrete POVM with effects $E_a\ge 0$ and ${\sum }_a{E}_a=I$, the Born rule readsThese constraints and Born rule probabilities describe arbitrary finite-dimensional preparations. ^[ref]

Randomly choosing normalized pure states with probabilities $w_j$ and forgetting the label givesThis quantum state ensemble averages probabilities; a quantum superposition adds probability amplitudes. Several ensembles can give the same density operator. Quantum entanglement can make a reduced density matrix mixed while the joint quantum state is pure. ^[ref]

The preparation, the choice of basis, and the measurement are separate ingredients. A wavefunction $\psi (x)=⟨x|\psi ⟩$ is the position representation of a pure state; a general mixed state requires a density operator. For a closed quantum system, a unitary operator evolves it as $\rho \mapsto U\rho U^{†}$, preserving its eigenvalues and purity of a density operator. ^[ref] The Bloch sphere and Bloch ball give the qubit geometry; quantum state tomography connects repeated preparations to an estimated density matrix; projective measurement treats the conditional state after an outcome.

Quantum state tomography estimates a density operator from measurement frequencies on many independently and identically prepared systems. One fixed projective measurement reveals only its basis populations, so further measurement settings are generally needed. For a qubit, writeThe three Pauli matrices thus turn measured expectation values into the Bloch vector. This reconstruction uses the Bloch ball representation of arbitrary qubit density operators. ^[ref].

Divide the prepared ensemble into groups measured in the $X$, $Y$ and $Z$ bases. For example, positive-outcome frequencies $0.8,0.5,0.9$ give the estimate $\mathbf{r}=(0.6,0,0.8)$ andHere $|\mathbf{r}|=1$, so the reconstructed state is the pure state $(3|0⟩+|1⟩)/\sqrt{10}$. Its $Z$ frequencies alone also fit the diagonal mixed state with populations $0.9,0.1$; the $X$ data distinguish them. For the angular pure state in measurement in quantum mechanics, $r_x=\sin \theta \cos \varphi$, $r_y=\sin \theta \sin \varphi$ and $r_z=\cos \theta$, so $Y$ resolves the sign of the phase that $X$ alone cannot.

Finite samples introduce statistical uncertainty: with $N$ independent binary trials in one basis, the frequency has variance $p(1-p)/N$. At $p=1/2$ and $N=100$, its standard deviation is $0.05$. Fluctuations can place a naive Bloch vector estimate outside the Bloch ball; a physical reconstruction must enforce positivity of the density operator. Repeated measurements on one unprepared specimen sample its changing conditional state, rather than independent copies of its original state. Multiple bases are needed in this projective protocol; a single fixed informationally complete POVM, such as the tetrahedral qubit POVM, is an alternative. It still requires an ensemble of trials.