A service time $S$ is the time needed to complete a customer's service requirement when a server works on that customer at the declared full capacity. If the required work is $B$ and capacity is $c$, then $S=B/c$. Its expected value is a duration. In an M/M/1 queue, the parameter $\mu$ of the exponential distribution has units of inverse time, and $\mathbb{E}S=1/\mu$.

Under uninterrupted first come first served, the customer's time in service equals $S$, while its customer sojourn time also includes the preceding queueing delay. Under processor sharing, elapsed time can be longer than $S$ because each customer receives only a fraction of the capacity. For example, two jobs arriving together, each requiring six work units, finish after four seconds on a three-unit-per-second sharing server; each has full-capacity service time two seconds.

A residual service time is the remaining full-capacity service duration. Service-time variability affects the Pollaczek-Khinchine mean formula, whereas Little's law needs the relevant finite means and consistent system boundaries rather than an exponential service distribution.

The total time between admission to a selected queueing system and departure. It includes waiting and service if both are inside the chosen system, and only service time if the selected system consists of the server alone. Little's law relates its mean to mean population and admitted queue throughput.

The long-run rate at which admitted customers complete service. In a stable queue without abandonment it equals the admitted arrival rate, which may be less than the offered rate because of blocking. Little's law uses this actual rate for the chosen subsystem. If customers leave without completing service, service completions alone cannot replace the admission rate when measuring the customer sojourn times of all admitted customers.

The long-run fraction of time a work-conserving server is busy. Applying Little's law to the server alone gives utilization equal to admitted queue throughput times mean service time. In a finite-buffer queue, the blocking probability must be included in that throughput.

A symmetric two-well system has nearly localized left/right states coupled by a positive quantum tunnelling magnitude $\Delta =\hslash K{e}^{-S_I/\hslash }$. Its effective Hamiltonian is $E_{\mathrm{well}}I-\Delta {\sigma }_x$, so the superposition with an even spatial wavefunction is lower, and the level splitting is $2\Delta$. The dilute instanton gas reproduces these two exponents through even/odd crossing sums.

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 flavor eigenstate is a state with a definite flavor label in the specified interaction or flavor-charge basis. For neutral kaons, $K^0=d\bar{s}$ and ${\bar{K}}^0=s\bar{d}$ have definite opposite strangeness. Weak interactions mix them, so these flavor states are not the mass eigenstates. The precise flavor basis must be specified when discussing mixing.

The least worst-case number of input-oracle calls made by a quantum circuit that computes a Boolean function with zero error on every input. Known unitary gates and classical processing do not count toward this quantity; their runtime is a separate cost.

After $T$ input-bit queries, every probability amplitude is a polynomial of degree at most $T$, because the bit-query matrix entries are affine in the input bits. An acceptance probability is a sum of squared absolute amplitudes and has polynomial degree at most $2T$. Multilinear reduction on the Boolean cube does not increase degree. Exact acceptance therefore implies $Q_E(f)\ge \lceil \mathrm{deg}(f)/2\rceil$. For bounded error the acceptance polynomial only approximates the Boolean function; its exact representing degree is not the relevant bound.

An eigenstate with phase $\varphi$ becomes an eigenstate with phase $n\varphi$ under the tensor product of $n$ copies of the unitary operator. A promise $0\le \varphi <1/n$ prevents modulo-one aliasing. For $n=2^s$ and dyadic $\varphi =x/2^m$, exact quantum phase estimation then needs $m-s$ phase bits and $2^{m-s}-1$ queries to a supplied joint controlled oracle. This is a saving in joint-oracle calls, not in the total number of individual oracle invocations needed to build that joint operation.

Share a Bell state meter pair, apply local system-to-meter CNOT gates, and measure each meter in the computational basis. The parity of the local meter records measures system $Z_A{Z}_B$ while preserving all coherence within either parity sector. The complete tuple of local records has Kraus operator $P_{u\oplus v}/\sqrt{2}$. Each local record is uniform, and the nonlocal result requires local operations and classical communication to compare records. A local Hadamard gate conjugation supplies the corresponding $X_A{X}_B$ measurement.

Exact singlet verification accepts the spin singlet state with certainty, rejects every orthogonal state, and preserves the singlet on acceptance. Each nonzero accepting Kraus operator is then a scalar multiple of the singlet projector, whose operator Schmidt rank is four. The local Kraus rank bound from an entangled resource excludes a single shared Bell pair, which has Schmidt rank two. Two shared Bell pairs suffice by a Bell-state nondemolition measurement followed by reporting whether its label is the singlet. This protocol may disturb triplet coherence. The rank bound concerns the resource Schmidt rank, and is not an entropy lower bound of two bits for arbitrary resource states.

Choose a shared random axis uniformly from $x,y,z$, perform its entanglement-assisted nondemolition parity measurement with one Bell pair, and accept the anticorrelated parity. The spin singlet state always passes unchanged. The averaged acceptance operator is $\Omega ={\sum }_j(I-{\sigma }_j\otimes {\sigma }_j)/6=P_s+(I-P_s)/3$, so an orthogonal triplet state passes with probability one third. This is a statistical verifier with a nonzero acceptance gap, rather than an exact single-shot singlet-versus-triplet decision. The Bell-pair cost of exact nondemolition singlet verification concerns the stronger zero-error task.

A two-qubit gate is a unitary operator on two qubit lines, extended by the identity on the others. It may be entangling, as a CNOT gate is, or a product of local operations. In a Hamiltonian simulation model allowing arbitrary two-qubit gates, the exponential of a Hermitian term supported on two lines counts as one such gate. Compiling it into a fixed discrete universal quantum gate set introduces a separate approximation cost.

In rationalized natural units, the fine-structure constant is $\alpha =e^2/(4\pi )$. It measures the electromagnetic interaction strength. Its use in a specified perturbative calculation requires a consistent coupling and renormalization scale convention.

At tree level this QED process has two internal muon exchange diagrams, differing by the order of the two outgoing photon vertices. Their propagator momenta are $p_1-k_1$ and $p_1-k_2$ for incoming muon momentum $p_1$. The amplitude begins at order $e^2$ and obeys the two-photon fermion Ward identity. Identical final photons require the usual factorial correction when integration over the full final-state Lorentz-invariant phase space would otherwise count them twice.

A functional derivative of the quantum effective action gives an amputated one-particle-irreducible correlation function. Its perturbative graphs stay connected after cutting any single internal propagator. A free quadratic effective action has no vertices of order greater than two; interactions generate higher vertices.

Quark-hadron duality is the correspondence, in suitable inclusive or averaged observables, between a quark-level description and a sum over hadronic states. Asymptotic freedom supports perturbative short-distance production, but sharp resonances and threshold regions can invalidate a pointwise partonic approximation. Inclusive predictions can have both radiative and nonperturbative corrections.

Hadronization is the conversion of colored quarks and gluons into color-neutral hadrons. It affects exclusive final-state distributions even when an inclusive observable can be approximated through a short-distance partonic calculation. A tree-level partonic decay width does not by itself model this conversion.

Write a real quadratic polynomial as $x^{T}Hx+2q^{T}x+c$, with $H$ symmetric. If $H$ is invertible, translation by $x_0=-H^{-1}q$ removes the linear term. An orthonormal eigenbasis then makes the remaining quadratic form diagonal. Eigenvalue signs and the translated constant determine the real geometry, such as an ellipsoid or a one-sheet hyperboloid. A singular $H$ requires separate treatment of linear terms in its null directions; a center need not exist.