Renormalization scheme Created 2026-10-14 Updated 2026-11-05
A choice of renormalization conditions and finite counterterms defines a renormalization scheme. The minimal subtraction scheme removes only regulator poles; the modified minimal subtraction scheme also removes conventional universal constants. Different schemes can assign different values to renormalized couplings while describing the same physical observables after parameters are consistently matched.
Bare mass Created 2026-10-14 Updated 2026-11-05
The bare mass is the mass parameter in a regulated field-theory action before a renormalization condition relates it to a measured mass. For a scalar, loop self-energy corrections change the propagator denominator to . The pole mass solves for a stable particle. The bare mass generally depends on the regulator when the pole mass is held fixed.
Bare coupling Created 2026-10-14 Updated 2026-11-05
A bare coupling is an interaction coefficient in a regulated action. It is related to a renormalized coupling through counterterms and any required powers of the renormalization scale. For quartic scalar theory in dimensions, its mass dimension is , and . At fixed regulator, changing while leaving the theory unchanged keeps fixed; the corresponding change of defines its renormalization-group beta function.
Alternating split of a Poisson process Created 2026-10-14 Updated 2026-11-05
Alternately routing a rate- Poisson process produces non-Poisson streams with common interarrival law Erlang. The odd-numbered stream has an initial exponential delay, while the even-numbered stream is an ordinary renewal process. Their equilibrium delay survivor is . The probability of no odd-stream point in is ; for the even stream replace the minus by a plus. Conditioning on the parity of proves these formulas.
Two-bit remote state preparation on a graph-state path Created 2026-10-14 Updated 2026-11-05
Alice holds the first two qubits and Bob the third of a three-vertex graph-state wire. Alice measures at and , with outcomes , and sends these two bits. Bob applies , the inverse of the known Pauli frame , obtaining up to global phase. Bob need not know the angles. Every branch succeeds, with branch probability , and no postselection is needed. Alice's measurements and Bob's corrections constitute local operations and classical communication on the previously shared entangled resource.
For a target pure state of a qubit, choose its orthogonal complement so that
Measuring the sender's half of this singlet state in that basis leaves the receiver in when the sender obtains . The outcome has probability one half. One classical success flag heralds the exact preparation without conveying the target's classical description.
// Target: quantum-theory.bigb
Prepare independent candidate blocks by one-bit heralding of a remote state preparation block, but send only the first successful block's index. Success eventually occurs with probability one; a prefix code for a rare geometric success uses at most expected bits per block. The expected singlet state consumption is . Alternatively, limiting the number of trials to gives failure probability at most and a fixed message length . Both versions approach one classical bit per remotely prepared qubit in their respective expected-length or high-success senses.
// Target: quantum-theory.bigb
Suppose two orthonormal qubit bases have disjoint physical rays. Alice chooses which conjugate basis to measure on her half of a Bell state. A device that perfectly labels Bob's individual member of either basis would reveal Alice's choice without her outcome being communicated. Spacelike operation would therefore violate relativistic causality, even though ordinary projective measurements see the same reduced density matrix .
Rod containment and simultaneity Created 2026-10-14 Updated 2026-10-25
A moving rod can have both ends inside a shorter shed on a single constant-time slice of the shed frame. Lorentz transformation sends the two simultaneous endpoint events to different times in the rod frame; it does not imply simultaneous containment there. Entrance and first collision can be spacelike separated and occur in reversed time order. After impact, length changes must propagate through the rod causally; a perfectly rigid instantaneous stopping model is not relativistically admissible.
Electromagnetic minimal coupling Created 2026-10-14 Updated 2026-11-05
Electromagnetic minimal coupling replaces the free kinetic momentum in an action or Hamiltonian by a combination involving the electromagnetic potential. For , the canonical covector is , so recovers the potential-independent covector. Under , the action changes by an endpoint term. The fixed-endpoint equations are the relativistic Lorentz force equation and are gauge invariant.
Background hazard 2026-10-14
In relative survival, the background hazard is an individual's expected mortality hazard in a suitable reference population. Its dependence on age, sex and calendar time can be obtained from population life tables. In a heterogeneous cohort, estimating a common excess hazard requires averaging these known background hazards over the current risk set, rather than over the original cohort.
Excess hazard 2026-10-14
An excess hazard measures mortality above the background hazard. When it is common across individuals, each observed survivor function factors into its individual background survivor function and a common relative survivor function. A nonnegative excess hazard gives a nonincreasing relative survivor function; a negative excess hazard can instead reflect better survival than expected in the reference population.
Under the additive hazard function model , the survivor function factorization gives , independently of . If the excess hazard is nonnegative, this has a survival-probability interpretation for a hypothetical process with just that hazard. If excess hazards are negative, relative survival can exceed one and is a comparison ratio rather than an ordinary survivor function.
Index state Created 2026-10-14 Updated 2026-11-05
An index state is a chosen orthonormal basis vector in the indexing subsystem of a relative state decomposition. It labels the corresponding partial inner product; it need not be an eigenvector of the subsystem's reduced density matrix.
For the half-normal distribution, the density ratio to is maximized at . Completing the square gives the envelope constant above and acceptance probability . Its logarithmic derivative is , so the optimal rate is . Give an accepted nonnegative value an independent fair sign to obtain the standard normal distribution. The expected number of proposals is , while the probability of rejecting one proposal is ; these are different quantities.
Ratio-of-uniforms method 2026-10-14
For a nonnegative integrable function with integral , its ratio-of-uniforms region has area . A uniform point in the region transforms under with Jacobian determinant ; integrating over gives density . A rectangle containing the region gives a practical rejection sampling algorithm using only uniform random variables, with acceptance .
Write . Against an exponential distribution proposal of mean , the chi-squared distribution density has envelope constant . The density ratio divided by is . Thus generate and accept when for independent uniform distributions. The inequality validates the acceptance probability. The accepted probability density function is the target because rejection sampling weights the proposal by its target-to-envelope ratio.
Accepting a fresh uniform deck permutation with a probability depending only on whether its endpoint ranks match preserves uniform individual rank marginals by symmetry. It changes their joint law. For four cards of each of thirteen ranks and rejection probability on a mismatch, the accepted matching probability is . The two accepted ranks are independent precisely at ; equality of marginals alone does not imply independence.
With proper prior independent of the neutral Kingman's coalescent times, propose from their joint prior and accept with probability . The accepted density is proportional to the prior times the observed-count likelihood, hence is the posterior given . The acceptance rate is the prior predictive probability . For , divide the acceptance function by its maximum , achieved at , to improve the rate to without altering the accepted distribution. For , .
For , the maximum of on occurs at . If one parameter is one, the maximum is attained at the corresponding endpoint; if both are one, is constant. Let . Accept an independent uniform distribution proposal when another uniform draw is at most . The accepted probability density function is the beta distribution, and acceptance probability is .

There are unlisted articles, also show them or only show them.