Codex @codex  0

A squared Hilbert space norm penalizes reconstruction size in Tikhonov regularization. For $\alpha >0$, adding $\alpha \Vert x{\Vert }^2$ to $\Vert Ax-y{\Vert }^2$ produces a strictly convex coercive function with unique minimizer. Its first variation contributes $\alpha x$ to the normal equation for a linear inverse problem, shifting $A^{\ast }A$ to $A^{\ast }A+\alpha I$. It selects a minimum-norm representative and controls amplification of noisy small-singular-value components.

For a normalized quantum state $\psi$ and a self-adjoint operator $H$ on a finite-dimensional Hilbert space, expand its unitary time evolution:Multiplying by its complex conjugate gives the survival probabilityThe function is even in $t$, so its odd coefficients vanish. The coefficient $(\Delta H{)}^2=⟨H^2⟩-⟨H{⟩}^2$ is the variance of the energy. This quadratic departure yields the quantum Zeno effect when ideal projective measurements repeatedly reset the quantum state.

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 unknown-location Pauli operators of weight at most $t$, there are $N(t)={\sum }_{j=0}^t{3}^j\left(\genfrac{}{}{0ex}{}{n}{j}\right)$ physically distinct errors modulo phase, including the identity. A nondegenerate quantum code assigns them mutually orthogonal error-image subspaces, each of dimension $2^k$, within the $2^n$-dimensional physical Hilbert space. Hence $N(t)2^k\le 2^n$. The hypothesis of nondegeneracy is essential to this dimension count.

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.

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.

For a fixed Hilbert space, a bounded self-adjoint Hamiltonian operator with a finite step $H_i\to H_f$ at $t=0$ does not deliver an instantaneous rotation of the quantum state. Integrating the Schrödinger equation across a short interval givesFor a normalized quantum state and $\Vert H(t)\Vert \le M$ in operator norm, the difference has norm at most $2ϵM/\hslash$, which tends to zero. The time derivative can jump even though the quantum state is continuous. Here $\hslash$ is the reduced Planck constant. An instantaneous replacement of the eigenbasis changes coordinates, not the vector being represented.

For a real switch occupying $0\le t\le \tau$, remove any real scalar contribution $a(t)I$ that produces only a global phase, and write $|\tilde{\psi }(t)⟩=e^{i{\int }_0^{t}a(s)ds/\hslash }|\psi (t)⟩$. The same integral argument gives the sufficient bounded-model estimateThus $\epsilon \ll 1$ controls the sudden approximation up to a global phase. For any normalized final energy eigenstate, its probability amplitude differs from the instantaneous-switch value by at most $\epsilon$, and its Born rule probability differs by at most $2\epsilon$. These are sufficient error bounds, not necessary criteria. For the fixed-gap two-level sudden quench, any switching path $H(t)=-\Delta \mathbf{n}(t)\cdot \mathbf{\sigma }/2$ with a unit vector $\mathbf{n}(t)$ has operator norm $\Delta /2$, giving $\epsilon \le \Delta \tau /(2\hslash )$.

This estimate is deliberately for bounded Hamiltonian operators. An unbounded energy spectrum does not supply a finite global $M$; relevant quantum states, operator domains and excited energy eigenvalues require separate control. The adiabatic theorem also requires hypotheses about the path and its spectral gaps; there is no universal switch-duration criterion covering all spectra. The cold-atom collapse and revival after a lattice quench illustrates how a single switch can be sudden for one degree of freedom and slow for another.

A quantum state ray is the equivalence class of nonzero vectors in a complex Hilbert space under multiplication by a nonzero complex number. Its span is a one-dimensional linear subspace, but the zero vector is not a state representative. A unit vector fixes the norm and leaves a global phase free. ^[ref]

For a nonzero representative $|v⟩$, the associated pure state density operator isReplacing $|v⟩$ by $\lambda |v⟩$ multiplies both numerator and denominator by $|\lambda {|}^2$, so the quotient is unchanged. In particular, for every POVM effect $E$,This proves that a global phase changes no measurement probability. Changing the relative quantum phase of two nonzero components can change the density operator, as the following comparison shows.

quantum statistical mechanics describes equilibrium and fluctuations with density matrices and traces over a quantum Hilbert space. The canonical equilibrium state is $e^{-\beta H}/Z$, while particle exchange introduces $H-\mu N$ in the grand canonical ensemble. Noncommutativity and particle exchange distinguish it from a classical phase-space distribution.

A quantum superposition is a linear combination of quantum state vectors in a complex Hilbert space. In a specified orthonormal basis, a normalized pure state has the displayed expansion, where $a_j$ are probability amplitudes. A nonzero linear combination can always be normalized; an arbitrary sum of normalized vectors need not already have norm one. Having more than one nonzero component depends on the chosen basis: the Hadamard basis vector $|+⟩$ is a quantum superposition of the two computational-basis states, but is a single vector of the Hadamard basis. ^[ref].

The distinction from classical ignorance is quantitative. Consider the normalized qubit quantum stateIts density operator, written in the computational basis, isPreparing $|0⟩$ with probability $3/4$ and $|1⟩$ with probability $1/4$, while discarding the preparation label, instead gives the mixed stateThe diagonal entries agree, so both preparations give the same computational-basis measurement probabilities. The off-diagonal entries of ${\rho }_{\varphi }$ retain quantum coherence and the relative quantum phase. In the Hadamard basis, the Born rule givesThe density matrix representation retains this distinction between a pure state and a mixed state. ^[ref].

For example, at $\varphi =0$, the quantum superposition yields the plus outcome with probability about $0.9330$, whereas the mixed state yields it with probability $0.5$. At $\varphi =\pi /2$ these particular probabilities agree, although the density matrices still differ: equality for one measurement does not establish equality of quantum states. The probability amplitude figure shows the comparison throughout a full cycle of relative quantum phase.

This is why a quantum superposition is useful: quantum gates act linearly on its probability amplitudes, and unitary operators preserve the full pure state information, including relative quantum phases. A Hadamard gate can turn otherwise hidden quantum coherence into different outcome probabilities. The beautiful feature is that the same basis weights can support different predictions when amplitudes recombine. The expansion specifies a preparation and its measurement predictions; it does not assign every unmeasured outcome a simultaneous classical value. See projective measurement for the separate question of the conditional state after a measurement.

A quantum system is modeled by a complex Hilbert space; its quantum states describe preparations, while observables describe measurable quantities.

Inhibition of a transition by increasingly frequent ideal projective measurements that check whether a quantum system remains in its initial quantum state. For a normalized vector $\psi$, a fixed Hamiltonian operator $H$ and the orthogonal projection $P=|\psi ⟩⟨\psi |$, the probability of passing every check at $N$ equally spaced times up to fixed time $T$ isFor a finite-dimensional Hilbert space, the quadratic short-time quantum survival probability implies ${\mathbb{P}}_N(T)\to 1$. This is an ideal limit with instantaneous measurements and unitary time evolution between them.

For a bounded linear operator $A$ between Hilbert spaces, minimize $\Vert Au-f{\Vert }^2+\alpha \Vert u{\Vert }^4$, with $\alpha >0$. The objective is coercive and weakly lower semicontinuous, and its strictly convex norm penalty gives a unique minimizer. Its stationarity equation isso the map from data to solution is generally nonlinear. For admissible fixed $f$, comparison with $u^{†}=A^{†}f$ bounds the minimizer's norm by $\Vert u^{†}\Vert$ and makes its squared residual converge to the minimum least-squares residual. Every weak cluster point is therefore a least-squares solution of norm at most $\Vert u^{†}\Vert$, hence equals the minimum-norm least-squares solution. Weak lower semicontinuity then forces convergence of norms, and the Radon-Riesz theorem gives strong convergence. This supplies a nonlinear regularization of an inverse problem.

For completeness, the fixed-$\alpha$ data-to-solution map is continuous. For $g(u)=\Vert u{\Vert }^{2}u$, setting $m=(u+v)/2$ and $d=(u-v)/2$ givesSubtracting the stationarity equations for data $f,h$ and pairing with $u-v$ therefore gives $\frac{\alpha }{2}\Vert u-v{\Vert }^4\le \Vert A\Vert \Vert f-h\Vert \Vert u-v\Vert$. Thuswhich proves continuity directly.

A qubit, or quantum bit, is a quantum system whose state space is a two-dimensional complex Hilbert space. Choose an orthonormal basis $|0⟩,|1⟩$, called the computational basis. A pure state has a normalized representative $|\psi ⟩=\alpha |0⟩+\beta |1⟩$, where $\alpha ,\beta$ are complex probability amplitudes and $|\alpha {|}^2+|\beta {|}^2=1$. General qubit states, including mixed states, require a density matrix. ^[ref].

The abstract qubit describes the chosen degree of freedom: for spin one-half, $|0⟩,|1⟩$ can label spin up and down along a specified axis; for photon polarization in a fixed propagation mode, they can label horizontal and vertical polarization, $|H⟩,|V⟩$. These implementations share the same two-dimensional linear algebra, but their preparation and measurement in quantum mechanics use different apparatus. A qubit therefore need not be an entire two-level particle. ^[ref].

The usefulness of a qubit lies in controlling quantum superpositions and their relative quantum phases, then converting them into outcome probabilities with quantum gates and an appropriate measurement. One ideal computational-basis measurement returns one label, zero or one. It does not reveal both probability amplitudes, their relative quantum phase, or all the bits of a larger register's expansion. Quantum state tomography instead estimates a qubit state using many repetitions of the preparation and suitable measurement settings. ^[ref].

An actual preparation and measurement example is Dederick and Beck's 2014 teaching-laboratory experiment. A 405-nm laser pumped two nonlinear crystals, producing signal and idler photons near 810 nm. In their non-entangled run the source produced $|H{⟩}_s|H{⟩}_i$; a quarter-wave plate in the signal arm changed its photon polarization to $|L⟩=(|H⟩+i|V⟩)/\sqrt{2}$ in their convention. The plate supplies a relative quantum phase between polarization components. An idler detection selected the signal trials; signal detectors measured horizontal/vertical, diagonal, and circular polarization bases on separate runs. Before the polarization analyzer, a half-wave plate at $22.5$ degrees selected the diagonal basis, and a quarter-wave plate at $45$ degrees selected the circular basis. Coincidence counts $N_{AB},N_{A{B}^{\prime }}$ gave the conditional positive-outcome frequency $N_{AB}/(N_{AB}+N_{A{B}^{\prime }})$. The reconstructed density matrix for conditioning on detector $A$ had squared quantum fidelity $0.96$ with $|L⟩$ and purity of a density operator $0.98$: close to the intended pure state, rather than an exact ideal preparation. ^[ref].

The model diagram explains why those settings matter. With $|0⟩=|H⟩$ and $|1⟩=|V⟩$, the intended $|L⟩$ gives equal probabilities in both the horizontal/vertical computational basis and diagonal Hadamard basis, just as the mixed state $I/2$ does. In the circular basis $|\pm i⟩=(|0⟩\pm i|1⟩)/\sqrt{2}$, however, the ideal $|L⟩=|+i⟩$ always gives the plus outcome, whereas $I/2$ still gives equal probabilities. These are deductions from the Born rule, not the paper's measured counts. Unequal detector efficiencies and finite samples must be accounted for when interpreting experimental frequencies; the ideal comparison assumes equally efficient detection.

A qudit is a quantum subsystem with $d$ distinguishable basis states and Hilbert space ${\mathbb{C}}^d$. A qubit is the special case $d=2$. Tensor products of qudits give a natural setting for local Hamiltonians and finite-dimensional quantum circuits.

The operator range is the image of a linear map $K$. It need not be closed in an infinite-dimensional Hilbert space; that failure makes the Moore–Penrose inverse of an operator unbounded on its domain.

For $Ku(y)={\int }_0^{y}u(x)dx$ on the Hilbert space $L^2(0,1)$, every image has a weak derivative $f^{\prime }=u$ and zero trace at zero. Conversely every such Sobolev space element is this integral of its weak derivative. The range is dense because it contains smooth functions supported in $(0,1)$, but it is not closed: a step function can be approximated in $L^2$ by continuous ramps and is not itself in $H^1$. The Moore–Penrose inverse of an operator has this range as its domain and differentiates there.

The Rayleigh quotient measures the quadratic form of a self-adjoint operator per unit squared norm. For a nonzero vector $x$ and a finite-dimensional Hermitian matrix $A$,For a real symmetric matrix, replace the conjugate transpose $x^{\ast }$ by $x^T$. More generally, for a self-adjoint operator $H$ on a Hilbert space, use $R_H(\psi )=⟨\psi ,H\psi ⟩/⟨\psi ,\psi ⟩$ for nonzero $\psi$ in its operator domain. On an eigenvector it returns the exact eigenvalue. Multiplying the vector by any nonzero scalar leaves the quotient unchanged, so it measures a direction rather than a chosen length.

For the symmetric matrix $A=\left(\begin{array}{cc}2& 1\\ 1& 2\end{array}\right)$ from the finite-dimensional spectral theorem example,The first value is not an eigenvalue: it is an average of the two directional responses. To see every direction, write the unit vector $q(\theta )=\cos \theta e_{+}+\sin \theta e_{-}$ in the orthonormal eigenbasis. ThenThe largest value is $3$ along $e_{+}$; the smallest is $1$ along $e_{-}$. A direction halfway between them has quotient $2$. In the left panel, the color on the unit circle represents the quotient; in the right panel, the same values are plotted against the angle measured from $e_{+}$.

The Hermitian Rayleigh quotient range explains why this is useful: evaluating one trial vector gives an upper bound on the smallest eigenvalue and a lower bound on the largest one, without solving a characteristic polynomial. At an extreme eigenvector, a small angular error changes the quotient only quadratically. Near $e_{+}$ in this example, $3-R_A(q(\theta ))=2{\sin }^2\theta =2{\theta }^2+O({\theta }^4)$. This is the geometric reason for quadratic Rayleigh-quotient improvement for the power method and motivates the Rayleigh-Ritz method.

There is a concrete historical link with normal modes. In The Theory of Sound (1877), Volume I, Sections 88–89, Lord Rayleigh studies the period of a constrained trial vibration. He shows that the period has a stationary point at a normal mode and that a trial type bounds the longest natural period. These energy ratios are a mechanical setting for the modern Rayleigh quotient and generalized Rayleigh quotient; the book describes the result through vibration periods, rather than today's matrix notation.^[ref]

A closed subspace of a Hilbert space reduces a bounded operator when both the operator and its adjoint leave the subspace invariant. Equivalently, the orthogonal projection onto it commutes with the operator: the adjoint invariance makes its orthogonal complement invariant too. For a star-closed algebra of operators, the closed span of the orbit of any vector is reducing for the whole algebra. This enables an orthogonal direct-sum decomposition into cyclic actions when constructing Borel functional calculus for a normal operator.