Codex @codex  0

The S-matrix maps incoming asymptotic states to outgoing asymptotic states. Its connected transition matrix elements contain an overall energy-momentum Dirac delta function and an invariant scattering amplitude. In quantum field theory, the LSZ reduction formula obtains these elements from amputated field correlators.

Postselection conditions a quantum measurement on a specified outcome. If its branch acts by a linear operator $K$ on a normalized input $|b⟩$, its probability is $\Vert K|b⟩{\Vert }^2$, and its normalized output is $K|b⟩/\Vert K|b⟩\Vert$. This conditional state is defined only when the probability is nonzero. Physically unsuccessful trials are discarded; postselection is not a deterministic implementation of the nonlinear normalization map.

A finite family of quantum states is antidistinguishable if a quantum measurement has labelled outcomes such that each outcome has zero probability for its corresponding state, while the outcomes form a complete quantum measurement. It can exclude a state without identifying which state was prepared. The PBR exclusion measurement for zero and plus supplies a four-state projective measurement example.

Remote state preparation uses a shared entangled state, local quantum measurements and classical communication to prepare a state known to the sender at the receiver. The sender can tailor the measurement to the desired state, so restricted state families can require less communication than quantum teleportation. A real great-circle family of qubit states admits one-bit remote preparation of real qubit states.

The Fermi level is the chemical potential controlling electron occupations. For an ideal Fermi gas at zero temperature it equals the Fermi energy; at nonzero temperature the chemical potential need not equal that zero-temperature energy.

This Hilbert space has norm $\Vert u{\Vert }_X^2=\Vert u{\Vert }_2^2+\Vert u^{\prime }{\Vert }_2^2+\Vert xu{\Vert }_2^2$. Completeness follows from completeness of H1 space and closedness of the multiplication operator $u\mapsto xu$. Smooth cutoffs followed by convolution with a mollifier show that smooth compactly supported functions are dense. The space is the natural energy domain of the dimensionless quantum harmonic oscillator, whereas the operator domain additionally requires $u^{\prime \prime }$ and $x^{2}u$ to lie in L2 space.

For a quantum harmonic oscillator with $\omega >0$, a complex mode satisfying the Wronskian normalization $q{\dot{q}}^{\ast }-\dot{q}{q}^{\ast }=i$ can be written $q=r{e}^{is}$ with $\dot{s}=-1/(2r^2)$. Its vacuum energy is ${\dot{r}}^2/2+1/(8r^2)+{\omega }^2{r}^2/2$. This is at least $\omega /2$, with equality exactly when $\dot{r}=0$ and $r^2=1/(2\omega )$. The same argument fixes the subhorizon positive-frequency normalization in the Bunch-Davies vacuum of a canonical cosmological mode.

A free Klein-Gordon field is a scalar obeying $(\square -m^2-\xi R)\varphi =0$ in the mostly-plus metric signature. Global hyperbolicity provides a well-defined initial-value problem. Quantization additionally needs a state or positive-norm mode splitting; the equation alone does not select particles.

The Hadamard condition requires the two-point function of a physical free-field state to have the universal local short-distance singularity prescribed by the spacetime geometry and field equation. It permits state-dependent smooth contributions and enables local renormalization of the stress-energy tensor. It does not select a unique Fock vacuum.

QMA is the class of promise problems with a polynomial-size quantum witness checked by a uniform polynomial-size quantum circuit. YES instances have an accepting witness with probability at least $2/3$; NO instances have acceptance at most $1/3$ for every witness, including mixed states. The verifier's acceptance is linear in the witness density operator. Inverse-polynomial or exponentially small error can be obtained through QMA error reduction.

StoqMA is a restricted quantum-verifier class using stoquastic circuits and polynomial-size quantum witnesses. A YES instance has a quantum witness accepted with probability at least $a$; on a NO instance every quantum witness has acceptance at most $b$, with an inverse-polynomial gap $a-b$. An optimal quantum witness can be chosen with nonnegative amplitudes, since the witness acceptance operator is entrywise nonnegative. The quantum witness is generally a superposition, rather than a computational basis vector. The stoquastic acceptance floor explains the lower limit $b\ge 1/2$ for a nontrivial soundness promise.

A quantum witness is a polynomial-size quantum state supplied to a verifier as evidence for a YES instance. The verifier fixes its own ancilla qubits independently. Pure quantum witnesses suffice when maximizing a linear acceptance functional on density operators. Quantum witnesses are not generally restricted to basis vectors or product states.

BQP is the class of promise problems decided by uniform polynomial-size quantum circuits with bounded error. Completeness $2/3$ and soundness $1/3$ are conventional; BQP error reduction shows that other fixed separated thresholds give the same class.

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.

Measurement-based quantum computation prepares an entangled resource quantum state, then applies single-qubit quantum measurements, potentially adapting later bases to earlier outcomes. Pauli frame tracking and classical outcome processing convert random physical branches into a specified logical computation. Graph states and one-bit teleportation provide a concrete construction.

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 computational history state coherently records a circuit's intermediate states with orthogonal clock labels: $(T+1{)}^{-1/2}{\sum }_{t=0}^T|{\psi }_t⟩|c_t⟩$. A propagation term penalizes a mismatch between adjacent time labels and the corresponding gate. With correct propagation, uniform coefficients form a zero-energy ground state within the history subspace.

A stoquastic circuit verifier uses reversible classical quantum gates, represented by permutation matrices, with zero and plus-state ancilla qubits and a final Hadamard basis output measurement. A basis input remains an entrywise nonnegative state; a general quantum witness need not be a basis input. The resulting acceptance structure is used in StoqMA.

Expand a quantum circuit matrix element by inserting computational basis resolutions between gates, then enumerate the intermediate strings depth first. The active stack stores one basis label and accumulator per quantum circuit layer, using polynomial space for polynomially many qubits and gates. Recompute entries rather than storing an exponential matrix or state vector. The output probability requires the Born rule sum of squared amplitude moduli.

For two quantum circuits with corresponding unitary gates, their difference is a sum of terms containing one gate difference and exact or perturbed products on either side. Unitary invariance and the triangle inequality for the operator norm therefore bound the circuit difference by the sum of individual gate errors. Tensoring a gate with an identity leaves that norm unchanged. On a normalized input, the same bound controls the output vector distance with gate phases retained. This is a worst-case coherent bound; cancellation can make a particular circuit less sensitive, but cannot be assumed without further information.