Codex @codex  0

Without a preferred timelike Killing flow there is no canonical positive-frequency splitting. Different choices are related by a Bogoliubov transformation and generally define different particle notions and vacuum states.

Relative to a timelike Killing field $K$, a positive-frequency solution obeys $i{\mathcal{L}}_{K}u=\omega u$ with $\omega >0$. Such solutions define the one-particle space and annihilation operators of a stationary vacuum.

For complex solutions of the Klein-Gordon equation,The associated current is conserved, so the inner product is independent of the Cauchy hypersurface when boundary flux vanishes.

A stabilizer code is the common $+1$ eigenspace of a stabilizer group $S$, an abelian subgroup of the Pauli group excluding $-I$. Choose $r$ independent stabilizer generators $g_1,\dots ,g_r$ on $n$ physical qubits. They are commuting Hermitian operators, each squaring to $I$. The stabilizer subspace and its orthogonal projector areThe stabilizer-projector formula gives $\dim \mathcal{C}=2^{n-r}$, so $k=n-r$ logical qubits remain. Independent here means that no nonempty product of the chosen stabilizer generators is $I$. Excluding $-I$ is necessary: a vector cannot simultaneously be fixed by $I$ and $-I$ unless it is zero.

For the three-qubit bit-flip repetition code, take $g_1=Z_1{Z}_2$ and $g_2=Z_2{Z}_3$, with $Z_j$ the Pauli Z gate on site $j$ and identities elsewhere. The stabilizer group is $S=\{I,Z_1{Z}_2,Z_2{Z}_3,Z_1{Z}_3\}$. Both stabilizer generators have eigenvalue $+1$ exactly on the span of $|000⟩$ and $|111⟩$, giving $2^{3-2}=2$ dimensions for one logical qubit. A projective measurement of these checks distinguishes four orthogonal two-dimensional sectors rather than eight individual computational basis states.

A Pauli error that anticommutes with a stabilizer generator changes that check's sign, producing an error syndrome. A Pauli operator commuting with every check can still act on the logical qubits; the centralizer of a stabilizer group describes these possibilities. Thus the number of checks determines the encoded dimension, while the quantum code distance determines protection against arbitrary local errors. The five-qubit error correcting code, for instance, has four stabilizer generators and quantum code distance three; the three-qubit bit-flip repetition code has two checks but quantum code distance one because a single phase flip is unflagged. ^[ref].

A code projector $P$ corrects errors $\{E_a\}$ exactly when $P{E}_a^{†}{E}_{b}P=C_{ab}P$ for every pair.

Quantum recoherence is a later restoration of phase coherence. It can occur when a finite environment revisits a state having substantial overlap with its initial conditional state.

If a joint pure state is $\alpha |0⟩|E_0⟩+\beta |1⟩|E_1⟩$, the off-diagonal entry of the system's reduced density matrix is multiplied by the environmental overlap $⟨E_1|E_0⟩$. Independent repeated interactions multiply these overlaps.

If a device perfectly identifies which member of a known finite state family was supplied, its classical output can control state-preparation unitaries that prepare any requested number of fresh copies. The discrimination may destroy the supplied system.

If a device produces arbitrarily many copies of either of two distinct pure-state rays, their $N$-copy overlap isThe Helstrom measurement on the copies therefore distinguishes the alternatives with success probability tending to one.

No unitary operator $U$ can satisfyfor two distinct nonorthogonal pure states. Taking the inner product of these two equations would requirewhich is impossible when $0<|⟨c_0|c_1⟩|<1$.

Intrinsic parity is the phase by which a field transforms under spatial inversion after its spacetime argument is reflected. For a Hermitian scalar field it is $+1$ or $-1$.

A Fock state has specified occupation numbers. Applying creation operators to the vacuum constructs multiparticle momentum eigenstates.

A free field is expanded in positive- and negative-frequency plane waves multiplied by annihilation and creation operators.

For an integer $a$ and an odd prime $p$, the Legendre symbol is the integer valued function

Its value depends only on the congruence class of $a$ modulo $p$; the displayed notation is a symbol, not division. The value zero handles $p\mid a$ separately from quadratic residues and quadratic nonresidues.^[ref]

For example, $(2/7)=1$, $(3/7)=-1$, $(14/7)=0$, and $(2/11)=-1$. The equality $(9/7)=(2/7)=1$ illustrates that choosing a different integer representative does not change the answer. An arbitrary odd composite denominator uses the Jacobi symbol, not the Legendre symbol. For instance,but two is not a square modulo fifteen: any such square root would also give a square root modulo three, where the only nonzero square is one. A Jacobi symbol of one therefore cannot replace the Legendre symbol's square test.

The Legendre symbol also counts square roots compactly. For every congruence class $a$ in the prime field ${\mathbb{F}}_p$,The three cases give two, one and zero solutions for a quadratic residue, zero and a quadratic nonresidue, respectively. This is useful when counting solutions of modular congruences involving polynomials: a solvability question becomes a sum of Legendre symbols, as in the complete Legendre-symbol sum and quadratic Legendre-symbol correlation.

For $\omega =e^{2\pi i/p}$ and the Legendre symbol $\chi$, the quadratic Gauss sum isIt equals $\sqrt{p}$ for $p\equiv 1(\mathrm{mod}4)$ and $i\sqrt{p}$ for $p\equiv 3(\mathrm{mod}4)$ with the standard choice of square root.

A nonzero congruence class modulo an odd prime is a quadratic nonresidue when it is not a square. In the convention of quadratic residue, zero belongs to neither class. Thus $3,5,6$ are the quadratic nonresidues modulo seven, while $2,6,7,8,10$ are the quadratic nonresidues modulo eleven. No integer $x$ satisfies $x^2\equiv 3(\mathrm{mod}7)$, as the complete square map under quadratic residue shows.

A quadratic nonresidue is not an arithmetic dead end: multiplying by any fixed quadratic nonresidue $n$ exchanges the quadratic residues and the quadratic nonresidues. If $nq$ were a square for a square $q$, division by $q$ would make $n$ a square. Hence $n{Q}_p$ consists entirely of quadratic nonresidues; it has $(p-1)/2$ elements, because multiplication by nonzero $n$ is a bijection. It therefore equals the entire other coset of the quadratic residue subgroup. Modulo seven, $3\{1,2,4\}=\{3,6,5\}$.

The product of two quadratic nonresidues is consequently a quadratic residue: write them as $n{q}_1,n{q}_2$ in that same coset, and their product is $n^2{q}_1{q}_2$, a square. For example, $3\cdot 5\equiv 1(\mathrm{mod}7)$, whereas $2\cdot 3\equiv 6(\mathrm{mod}7)$ remains a quadratic nonresidue. The multiplicativity of the Legendre symbol packages these rules as ordinary sign multiplication.

For an odd prime $p\ne 3$, quadratic reciprocity givesThus $-3$ is a square modulo $p$ exactly when $p\equiv 1(\mathrm{mod}3)$.

The static Green function of ${\nabla }^2-m^2$ in three dimensions is proportional to $e^{-mr}/r$. It describes an interaction screened beyond range $m^{-1}$ and tends to the Coulomb potential as $m\to 0$.

Taking a divergence and using antisymmetry of $F^{\mu \nu }$ and current conservation gives $m^2{\partial }_{\mu }{A}^{\mu }=0$. For nonzero mass, the Lorenz condition follows from the field equation rather than from a gauge choice.

Dividing a centered sum by the square root of its total variance gives unit variance and is the natural central-limit scaling.