An ultrarelativistic particle has energy much larger than its rest energy. Its dispersion relation is then approximated by .
At , . Thus a moving clock accumulates seconds of proper time per laboratory second, and a parallel moving rod has times its rest length. The Lorentz factor approaches one at small speed and grows without bound as approaches the speed of light; a massive object's rest frame never requires a boost at .
A nonzero spacetime vector is null when its Minkowski norm vanishes, . Null tangent vectors describe the local directions of light rays.
Two bound-state solutions of the same one-dimensional time-independent Schrödinger equation have constant Wronskian. Their decay at infinity makes this constant zero, so the two solutions are linearly dependent. Every bound-state energy is therefore nondegenerate.
In a uniformly rotating frame, centrifugal acceleration points away from the rotation axis and equals .
A tensor network state contracts auxiliary indices of local tensors to encode a many-body wavefunction.
Quantum error correction protects a logical qubit by encoding its quantum state into a larger Hilbert space, where a specified family of physical errors can be diagnosed and reversed by a common recovery quantum channel. The requirement is to restore every encoded quantum superposition, including its relative phase, rather than only the computational basis states. A quantum error-correcting code specifies which errors have this protection; it does not promise recovery from every possible disturbance.
The beautiful idea is to measure relations between physical qubits that reveal an error syndrome while revealing nothing about the protected logical qubit. For example, the bit-flip repetition code compares neighboring qubits without reading their individual values. Its parity checks can locate one Pauli X gate error while leaving the unknown coefficients intact. Encoding is a linear isometry, consistent with the no-cloning theorem: redundancy in a shared quantum state supplies protection without making independent copies of the unknown input.
Peter W. Shor's 1995 paper [ref]
https://journals.aps.org/pra/abstract/10.1103/PhysRevA.52.R2493. Scheme for reducing decoherence in quantum computer memory
, published on 1 October, introduced the nine-qubit Shor code to reduce quantum decoherence in memory. Andrew M. Steane's [ref]https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.77.793. Error Correcting Codes in Quantum Theory
, published on 29 July 1996 and [ref], connected quantum error correction to classical linear codes; the seven-qubit Steane code protects against arbitrary errors on one physical qubit. These constructions protect relative phase as well as computational basis values, going beyond the elementary bit-flip repetition code.For an authored account of the mechanism, see John Preskill's [ref], especially section 7.1 on collective parity measurements and section 7.9 on stabilizer codes. Andrew Steane's A tutorial on quantum error correction develops the distinction between correcting a stored quantum state and operating with imperfect quantum gates.
Topological quantum matter has robust low-energy properties controlled by global topology rather than local order parameters.
The partial trace over is the linear operation characterized byApplied to a density operator, it produces a reduced density matrix.
A pure quantum state is represented by a unit vector up to global phase, or equivalently by the rank-one density operator .
There are unlisted articles, also show them or only show them.