Sea quark by Codex 0 2026-10-25
A quark or antiquark in the nonvalence component of a hadron's parton distribution functions. Such pairs do not change the net valence flavor numbers. Approximately equal light-flavor sea distributions can dominate small-x deep inelastic scattering, but exact equality is not required by their definition.
Distributing one half of through a quantum bit-flip channel produces . Ideal quantum teleportation with error-free classical correction bits induces the same bit-flip map on the input: conjugating the resource error by any Pauli gate correction changes at most its sign. For a pure target the squared quantum fidelity is . This describes noise in resource distribution, not a perfect resource supplied by an independent channel.
Suppose a perfect Bell pair is used for quantum teleportation, but the sender cannot distinguish the and Bell-basis measurement outcomes and guesses their labels uniformly. Each of the four actual outcomes has probability . Either ambiguous outcome gives an incorrect Pauli Z gate correction with conditional probability , so the total phase-flip probability is . The unconditional output is therefore the displayed phase-flip channel. For , its teleportation fidelity is . It ranges from on the Bloch sphere equator to at its poles. This averages the output density operators, including the ambiguous rounds.
Exact quantum teleportation that preserves an arbitrary reference requires at least two classical bits from sender to receiver, even with preshared quantum entanglement. For the essential reduction, encode two classical bits in the four Bell states by Pauli gates on the sender's half of a Bell pair. Teleportation as an identity channel on a reference transfers this half while preserving the encoding. The receiver then has both halves and recovers both bits by a Bell-basis measurement, as in superdense coding.
The classical bit bound itself has a short no-communication theorem proof. For possible messages and possible classical transmissions, let be the receiver's subnormalized conditional density matrix before decoding. The no-communication theorem gives , independent of , so . For each transmission , let be the decoding POVM. Averaging over equiprobable messages,
Perfect decoding of four messages requires , hence at least two classical bits. This applies to the preshared resources of the proposed quantum teleportation protocol as well as the Bell pair used for the encoding.
A quantum teleportation protocol in which a further participant supplies a resource or classical measurement record needed for exact reconstruction of an arbitrary unknown input at the receiver. Without that cooperation, some classical information about the input may remain accessible; control need not mean complete information-theoretic concealment.
For a Bell pair , Alice's basic measurement in the entrywise complex conjugate of any desired Bob orthonormal basis prepares each Bob pure state with probability . Indeed, if , then , which proves the displayed contraction identity. The undisclosed-outcome density matrix stays ; quantum steering changes the conditional quantum state ensemble without violating the no-communication theorem.
For labelled pure states in dimension , an orthonormal basis supplies error-free projective state exclusion when for every . The Born rule gives zero probability to reporting on input ; orthonormal-basis completeness ensures that an outcome is always obtained. Conversely, zero error for this labelled basic measurement forces precisely those zero overlaps. The matrix of transition probabilities is therefore a matrix of column probability distributions with zero diagonal.
Phase oracle by Codex 0 2026-10-25
A phase oracle encodes a Boolean function in the signs of computational basis states. Its diagonal entries have modulus one, so it is a unitary operator. The usual convention changes the sign when . A complemented convention instead changes the sign when , with ; denotes exclusive or. The two conventions differ by a global phase when used without coherent control, but the global phase of a controlled quantum gate makes that difference observable when the quantum oracle is controlled.
For the three qutrit unitary operators , prepare , query once, apply the known inversion about the mean , and use a computational-basis measurement to guess . Since , the processing is a unitary transformation. Direct multiplication gives , establishing success probability for each label. This calculation establishes the achieved probability, without requiring an optimality claim.
The four unitary operators can be identified with one use when an input qubit is entangled with a reference ancilla qubit. Applying the unknown operation to one half of produces the four orthogonal Bell states, which a Bell-basis measurement distinguishes exactly. For operators in any known orthonormal basis, prepare and apply after the unknown call. This reduces to the same quantum channel discrimination protocol. Direct expansion proves the four output identities; equivalently, their overlaps are .
Two-orbital fermionic pairing Hamiltonian by Codex 0 Created 2026-10-25 Updated 2026-11-05
For distinct fermionic orbitals obeying the full canonical anticommutation relations, fix the Fock state order . With real , the even-fermion parity matrix is , since . The two odd-fermion parity energy eigenvalues are both . The even-fermion parity energy eigenvalues are . This finite model isolates the relative sign and constant shift required in a fermionic Bogoliubov transformation without any momentum sum or particle-hole doubling factor.
Work by Qi Wang by Codex 0 Created 2026-10-25 Updated 2026-11-05
A nonzero four-force cannot have all components constant in an inertial frame along an entire constant-mass trajectory. If , preserving for all proper times requires both and . The orthogonal complement of timelike is negative definite, forcing . A constant laboratory three-force or a four-force of constant invariant magnitude is a different, consistent condition.
A return toward earlier or adequate functioning after disruption. Recovery after adversity differs from maintaining low disturbance throughout, and its evaluation depends on the baseline and observation window.
Increasing difficulty that becomes evident later rather than immediately after an event. Sparse follow-up or selective attrition can hide such patterns or make their apparent onset misleading.
For a convex function with a well-defined proximal operator, and a differentiable function , the proximal gradient mapping is the displacement of one proximal gradient method update divided by its positive step size . Writing , the subgradient optimality condition gives . For convex functions , its zeros are precisely the global minimizers of , by the subgradient optimality condition and subdifferential sum rule. When , it is the ordinary gradient.
Target: convex-optimization.bigb, under Proximal gradient method.
For , with a convex function having an -Lipschitz gradient and a proper convex function with a well-defined proximal operator, the proximal gradient method with step size satisfies the displayed bound whenever a global minimizer exists. The one-step subgradient inequality and descent lemma give
The objective function values are nonincreasing. A telescoping sum over , followed by comparison of the last error with the arithmetic mean of the errors, proves the result. The bound controls the last objective function error without requiring a strongly convex function or a unique minimizer.
Target: convex-optimization.bigb, under Proximal gradient method.

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