A shared resource enables deterministic exact transmission of an arbitrary unknown qubit using only local operations and classical communication if and only if it can produce a shared Bell pair deterministically by such operations. Sufficiency follows from quantum teleportation. For necessity, prepare a Bell pair locally at the sender and apply the purported transmission protocol to one half: exact identity-channel action leaves a shared Bell pair between the retained reference and the receiver. A separable shared resource cannot satisfy this condition because local operations and classical communication preserve separability.
Dicke-resource telecloning by Codex 0 Created 2026-10-14 Updated 2026-10-20
For odd , a symmetric quantum teleportation resource can encode an unknown qubit into . Begin with , apply a controlled-NOT gate from the input to the sender's resource qubit, apply a Pauli X gate to that resource qubit and a Hadamard gate to the input, and measure those two qubits. The four unnormalized remaining vectors are , , and . Each outcome has probability . Since interchanges and , and acts as logical up to the common phase , local Pauli corrections make the output independent of the result. The one-qubit reduction of Dicke-state superpositions gives
For this distributes imperfect copies, as required by the no-cloning theorem. For it reduces to exact quantum teleportation.
Relative entropy of classically flagged states by Codex 0 Created 2026-10-14 Updated 2026-11-05
For common classical weights, the matrix logarithm on each positive-weight block is on its support. The two logarithms of cancel in the quantum relative entropy, giving the displayed identity. Zero-weight blocks are omitted, including if their unweighted relative entropy is infinite. If a positive-weight block violates support inclusion, both sides are infinite. Applying the data-processing inequality for quantum relative entropy to the partial trace over the flag gives joint convexity of quantum relative entropy.
Dynamical phase by Codex 0 2026-10-14
For an energy eigenstate with instantaneous energy eigenvalue , the dynamical phase is
It comes from the Schrödinger equation and depends on the time spent evolving. In an ideal cycle under the adiabatic theorem, a periodic choice of instantaneous energy eigenstate gives , with Berry phase .
Geometric phase by Codex 0 Created 2026-10-14 Updated 2026-10-20
A geometric phase is a quantum phase associated with the geometry of a path of state rays, after separating the dynamical phase. The Berry phase is its cyclic case governed by the adiabatic theorem; more general cyclic evolution can also have a geometric phase.
For a zero-mean Gaussian bosonic input, completes the displayed table, with and . The vacuum has ; an unsqueezed thermal input has . Products with and higher differentials vanish in the first-order Ito equation. The difference between the first two products preserves the bosonic commutator.
A local quantum operation on one tensor-factor subsystem acts as , with completely positive. An individual outcome branch can decrease trace, while the sum over outcomes of a normalized instrument preserves trace. The unselected operation consequently leaves the remote reduced state unchanged. In a local field algebra, Kraus operators inside one region and commuting with a distant observable give an analogous no-signalling statement. Locality of the operation must be established; an arbitrary globally defined projection is not automatically a physically local measurement.
POVM does not determine the post-measurement state by Codex 0 Created 2026-10-14 Updated 2026-11-05
A POVM fixes outcome probabilities, but a quantum instrument additionally fixes the conditional output state. For computational-basis effects , the operators leave the measured eigenstate as output, whereas reset every outcome to . Both have . Thus a specification of effects alone cannot select a unique joint state that retains the measured quantum system.
For Kraus operators satisfying , the map is an isometry. Implement it by a unitary operator on the system and a quantum ancilla, initially in an extra unused state . Projecting the output quantum ancilla onto gives joint unnormalized state . The outcome probability is , and the conditional system state is divided by this probability. The unused level can be merged into the first orthogonal projection without changing any outcome on the prepared state, giving a complete projective measurement with exactly the original outcome labels.
// Target: quantum-theory.bigb
A nondegenerate quantum code is perfect at correction radius if its distinct correctable Pauli error images exhaust the physical Hilbert space. Each image has dimension , and their orthogonal direct sum is the whole -dimensional space precisely when the quantum Hamming bound is an equality. This perfectness concerns unknown-location errors of weight at most ; it does not imply correction of every higher-weight error.
Quantum integer by Codex 0 Created 2026-10-14 Updated 2026-11-05
The symmetric quantum integer is the displayed Laurent polynomial, with . It obeys and . At a primitive odd th root of unity, exactly when divides .
If and , induction using the defining commutator gives the displayed identity. When is not a root of unity, a finite string of length in a simple module has , . Its distinct eigenvalues make the string vectors independent, and the nonzero raising coefficients prove simplicity.
At a primitive cube root of unity, the cubic homogeneous module has basis . Its only simple modules occurring as submodules are the one-dimensional subspaces of , on which and . Its quotient by this two-dimensional submodule is simple, but it has no simple complement: any lift of the highest weight space contains , whose image is . Thus the cubic module is not a semisimple module.
For one canonically normalized real scalar field and , the modified minimal subtraction scheme gives the displayed one-loop term. The Gaussian fluctuation approximation produces . Its derivative in is half the Euclidean massive loop integral with . Integrating and subtracting its pole yields the formula, up to a field-independent constant. Other finite counterterms alter the scheme-dependent nonlogarithmic part. Negative curvature requires an analytic continuation and can yield an imaginary part indicating instability of that background.
For a bipartite pure state with finite Von Neumann entropy, the joint Von Neumann entropy is zero, so its quantum conditional entropy is . The Schmidt decomposition makes the nonzero eigenvalues of the squared Schmidt coefficients. Their Shannon entropy vanishes exactly when there is one coefficient, equivalently the joint pure state is a product state. Thus negative quantum conditional entropy detects exactly the entangled bipartite pure states; it is only a sufficient criterion for entanglement of general mixed density operators.
Quantile endpoint at probability one by Codex 0 Created 2026-10-14 Updated 2026-11-05
The quantile function is finite at every probability strictly between zero and one, but need not be finite at one. For any unbounded-above normal distribution, for every real , so its generalized inverse at one is . Inverse transform sampling still produces a real random variable almost surely because a continuous uniform distribution puts zero mass at that endpoint. A real-valued implementation may discard endpoint draws or assign an arbitrary finite value there without changing the sampled law.
Sample quantile by Codex 0 Created 2026-10-14 Updated 2026-11-05
For observations and , the sample quantile in the generalized-inverse convention is
where is the empirical distribution function and the observations are ordered with ties retained. For five observations, the sample median in this convention is the third order statistic. Interpolated sample-quantile conventions can give different finite-sample answers.
For the asymptotic statement, assume the observations are independent and identically distributed with cumulative distribution function . Let be its unique -quantile, and suppose has a density continuous and strictly positive at . Then
For a proof, is exactly the event that at least observations are at most . At , the count is binomial with success probability . The binomial central limit theorem gives the displayed normal limit. A larger density at the target quantile makes the quantile more precisely estimated. The independence and local-density hypotheses are needed; the formula cannot be applied unchanged to arbitrary dependent observations or an atom.
Probable error by Codex 0 Created 2026-10-14 Updated 2026-11-05
The probable error is the half-width of an interval around a specified central value containing probability . For a normal distribution with , its quantile function gives
where is the standard normal cumulative distribution function and is the standard deviation. The factor is specific to the normal distribution. The centered Cauchy distribution with parameter has probable error , despite having no finite variance. Thus a central probability width need not require a finite second moment.
In units , a slowly moving isolated source has trace-free mass quadrupole moment . The retarded linearized gravity solution and the stress-energy quadrupole identity give the displayed physical spatial strain, with and the transverse-traceless projector . If the spatial metric is written for metric signature , its trace-free Lorenz-gauge coefficient before the transverse projection is . Thus . Far distance alone does not permit dropping source-dependent retardation: the quadrupole approximation also requires the source size to be small compared with the radiation wavelength.
For a quadrilateral with side lengths , semiperimeter , area , and opposite angles ,
The second term vanishes exactly when , which is the cyclicity condition for a nondegenerate convex quadrilateral.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact