For a specified correctable set of distinct Pauli operators modulo phase, a nondegenerate code has mutually orthogonal error images $E\mathcal{X}$. Equivalently, the matrix in the Knill--Laflamme condition is diagonal for that Pauli error set. Each error therefore requires a separate syndrome subspace of dimension equal to the logical code dimension. Degenerate codes can have distinct errors with the same action on the code and do not satisfy this orthogonality counting argument.

A code with orthogonal projector $P$ detects an error $E$ when its compression to the code is scalar. A projective measurement of $P$ then either flags departure from the code or, on a successful code-space outcome, leaves the logical state unchanged up to normalization. This includes harmless scalar errors, even though they need not produce a nonzero error syndrome. Detectability extends by linearity to the span of a set of errors. Every Pauli operator of weight less than the quantum code distance is detectable.

The five-qubit code encodes one logical qubit into five physical qubits and corrects an arbitrary error on one physical qubit. In a nondegenerate realization, the identity and fifteen one-qubit Pauli operators take the two-dimensional code into sixteen mutually orthogonal syndrome subspaces, filling the 32-dimensional physical Hilbert space.

// Target: quantum-error-correction.bigb

A concatenated quantum code replaces each physical qubit of an outer code by a logical qubit of an inner code. Correction proceeds from inner blocks to outer blocks. For independent errors and ideal correction, a logical-error map $f$ iterates as $p_{\ell +1}=f(p_{\ell })$. This recursion describes the code/channel model and does not by itself include errors in encoding and recovery gates.

// Target: quantum-error-correction.bigb

A logical qubit is a two-dimensional encoded quantum subsystem with chosen orthonormal logical basis states $|0_L⟩,|1_L⟩$. An encoding linear isometry sends $\alpha |0⟩+\beta |1⟩$ to $\alpha |0_L⟩+\beta |1_L⟩$. In a concatenated quantum error-correcting code, one level's logical qubit supplies one qubit of the next outer code.

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.

The quantum measurement problem asks how a unitary superposition of system and apparatus outcomes gives rise to one definite observed outcome. Quantum decoherence explains the suppression of interference between outcome branches, but by itself does not select one branch.

For $\dot{\rho }=-i[H_0+f{H}_1,\rho ]$ and ${\dot{\rho }}_d=-i[H_0,{\rho }_d]$, the Hilbert-Schmidt distance gives $V=\Vert \rho -{\rho }_d{\Vert }^2/2$. The choice $f=\mathrm{Tr}({\rho }_d[-i{H}_1,\rho ])$ yields $\dot{V}=-f^2$. Decrease alone does not prove convergence: orthogonal pure eigenstates of a diagonal $H_0$ give zero input for a transverse Pauli control even though their distance remains nonzero. Such a law can be simulated to produce an open-loop control.

Hamiltonian engineering designs accessible interactions or their effective time average to implement desired quantum states or unitary operators. The available control inputs, Quantum Hamiltonian generators and laboratory constraints determine which transformations can actually be achieved. Model-based open-loop control computes a waveform before running it; adaptive experiments instead evaluate its performance on the physical system.

Design Lindblad operators and a Quantum Hamiltonian so that desired density operators are stationary and unwanted perturbations decay. A dissipative interaction can change the spectrum and purity of a density operator, reaching targets unavailable to purely coherent Hamiltonian engineering. The engineered stationary state must be physical, and uniqueness alone must be distinguished from an explicit proof of asymptotic convergence.

In coherent quantum feedback, a quantum controller interacts with the controlled system without first converting the control signal into a classical measurement record. Optical feedback through a beam splitter is one example. The input-output interconnection must preserve the physical quantum dynamics, including noise and commutation relations; a classical state-feedback formula does not automatically define a valid quantum controller.

An Ising coupling generates $e^{-i\varphi Z\otimes Z}$ with $\varphi =\int J(t)dt$ in units $\hslash =1$. It is entangling precisely when $\varphi$ is not an integer multiple of $\pi /2$. A $\pi$ rotation on one qubit reverses its sign, permitting an ideal echo to cancel an always-on coupling.

On a connected transition chain, independently selected resonant pulses realize embedded two-level rotations with tunable angle and phase. Eliminate target amplitudes from one end of the chain using complex Givens rotations, and invert those rotations to prepare the target from a basis state. The pulse angles come from amplitude ratios and the phases from relative complex arguments. Spectator components are unchanged by each embedded rotation. Work in the interaction picture and compensate the known drift phases at the chosen final time when the target is specified in the laboratory frame.

Let distinct nonorthogonal pure states have overlap magnitude $0<c<1$, and let one quantum channel take $n$ identical inputs to $m$ outputs. Let ${ϵ}_u,{ϵ}_v$ be the respective probabilities that a test for the ideal $m$-copy pure state fails. Trace distance contraction, its triangle inequality and the pure-target upper bound on trace distance give $\sqrt{1-c^{2m}}\le \sqrt{{ϵ}_u}+\sqrt{1-c^{2n}}+\sqrt{{ϵ}_v}$. Squaring with the Cauchy-Schwarz inequality gives the displayed strategy-independent positive bound. It establishes both a worst-case bound and an equal-prior average bound. Averaging rotated pairs establishes a positive Haar-average bound for unknown qubit inputs, without assuming independent clone errors.

For two pure states of overlap $0<c<1$, a quantum channel attempts to turn $M$ copies into $N>M$ copies. Let $e_i$ be the failure probability of the all-copies projector test on input $i$. The pure-state trace distance and fidelity identity, trace-distance contraction under quantum channels, pure-target upper bound on trace distance and triangle inequality give the displayed strictly positive gap $\Delta$. Hence ${\max }_i{e}_i\ge {\Delta }^2/4$, and for positive priors ${\pi }_0+{\pi }_1=1$, weighted Cauchy-Schwarz inequality gives ${\pi }_0{e}_0+{\pi }_1{e}_1\ge {\pi }_0{\pi }_1{\Delta }^2$. No positive state-by-state bound holds: preparing one candidate perfectly makes its own conditional failure probability zero.

A propagator is a two-point kernel describing propagation and, in a free theory, a Green function for the quadratic kinetic operator. Its boundary prescription determines its type: the time-ordered Feynman propagator uses an $iϵ$ prescription, while retarded and advanced propagators impose causal boundary conditions.

A short proof outline connects Gauss's lemma to counting points with integer coordinates. For distinct odd primes $p,q$, define the two floor function sumsThe parity form of Gauss's lemma gives $(q/p)=(-1{)}^M$ and $(p/q)=(-1{)}^N$. In the open rectangle $0<x<p/2$, $0<y<q/2$, the line $y=qx/p$ separates $M$ points below it from $N$ points above it. None lies on the line, because $py=qx$ and coprimality would force $p\mid x$. The total is therefore $(p-1)(q-1)/4$. Combining that count with the parity identities gives quadratic reciprocity.^[ref]

The practical reward of quadratic reciprocity is a smaller modulus: swap a pair of distinct odd primes, record the required sign, then reduce the numerator by modular arithmetic. Use multiplicativity of the Legendre symbol and the second supplementary law for quadratic reciprocity to handle a factor of two. For example,Here $11,43$ are both $3$ modulo $4$, so the first swap changes sign; $11\equiv 3(\mathrm{mod}8)$ gives $(2/11)=-1$; the swap involving five has no sign change. An independent square check is $21^2=441\equiv 11(\mathrm{mod}43)$. The method determines existence of a square root without itself finding that root.

A composite numerator is allowed in a Legendre symbol; a composite denominator instead calls for a Jacobi symbol. Its Jacobi reciprocity law supports repeated swaps and remainder reductions, in the spirit of the Euclidean algorithm.^[ref]

A final Jacobi symbol of one is not a square-existence certificate for a composite number modulus. For example,yet $x^2\equiv 2(\mathrm{mod}15)$ is impossible: reducing it modulo three would require a square congruent to two, and squares modulo three are only zero or one. The product has hidden two local failures. By contrast, for a prime denominator, a Legendre symbol of one does certify a quadratic residue.

A quadratic program is an optimization problem with a quadratic objective and linear equality or inequality constraints. A positive-definite objective Hessian makes it strictly convex and coercive; on a nonempty closed feasible set its minimizer exists and is unique. Such a program resolves tied Lasso knots by constraining tangent signs of currently zero regression coefficients while allowing unrestricted tangents for nonzero ones.

A plotting position assigns a probability level to an order statistic for a Q-Q plot. The displayed formula is one convention, not a universal definition. R's ppoints uses $p_i=(i-a)/(n+1-2a)$, with $a=1/2$ by default for $n>10$, which gives our choice at $n=19$; for $n\le 10$ its default is $a=3/8$. NIST's normal probability plot instead describes an approximation to uniform distribution order statistic medians. State the convention when comparing plots, especially their extreme quantiles. ^[ref][ref]