A galaxy cluster deflects background light through its projected gravitational field. In the thin-lens approximation for gravitational lensing, maps image to source angle. Its surface mass density enters through
Here is signed lensing magnification; observed brightness uses . The 's are angular diameter distances to lens, source and between them; denotes lensing shear, not a Lorentz factor. strong gravitational lensing creates arcs and multiple images near critical curves. For an axisymmetric lens, a tangential Einstein ring satisfies mean enclosed convergence one, giving
This is projected enclosed mass, not a general three-dimensional mass profile inferred from a single arc.
weak gravitational lensing uses coherent distortions of many background galaxies. Their intrinsic orientations average approximately to zero, allowing an estimate of reduced shear and a projected mass map. The method traces all gravitating material without assuming hydrostatic equilibrium, which is valuable in merging clusters. Accurate work requires correction of the point spread function, calibrated shape measurement, source redshifts, foreground-member rejection and selection effects. Intrinsic shape noise, unrelated line-of-sight structures and lens-model degeneracies remain. The mass-sheet degeneracy leaves reduced shear unchanged under and , so absolute mass normalization needs additional information.
In the Bullet Cluster, weak gravitational lensing places the main projected mass peaks near the collisionless galaxies, displaced from the X-ray-emitting gas that contains most observed baryon mass. Comparing the lensing, optical and X-ray maps supports a dominant weakly collisional dark component under the usual gravity model; lensing alone does not identify its particle species. Cluster lensing measures projected gravitational mass independently of gas temperature or dynamical equilibrium.[ref]
In a close binary star, the rotating effective gravitational potential defines two Roche lobes meeting at the inner Lagrange point. Stellar expansion or orbital shrinkage can bring the donor into Roche-lobe overflow. Gas then flows through the inner Lagrange point; its angular momentum can form an accretion disk around the companion. wind mass transfer in a binary star is also possible without Roche-lobe filling. For a circular, synchronized binary, the Eggleton Roche-lobe radius approximation is
This describes the lobe geometry, not the donor's dynamical response.[ref]
conservative binary mass transfer has fixed total mass and orbital angular momentum, neglecting stellar spin. Using gives
Since , transfer from the more massive donor initially shrinks the orbit; after binary mass ratio reversal it expands. Stability depends on both stars and their changing lobes. Let and . A small mass loss reduces the relative overfill if . Use the adiabatic donor response for dynamical stability, and its thermal response for slower adjustment; an equilibrium mass-radius law alone cannot decide both.
Stable transfer can proceed on nuclear or thermal timescales, while dynamically unstable overflow may create a common envelope, orbital spiral-in and either envelope ejection or a merger. Escaping gas, gravitational radiation and magnetic braking make evolution nonconservative by changing orbital angular momentum. accretion onto a compact stellar object releases power of order , producing bright X-ray binaries; radiation-driven outflows can limit retained mass. Eclipses, radial velocities and disk emission constrain the geometry and masses, but inclination, irradiation and assumptions about mass or angular-momentum loss affect the inference. The essential feedback is the donor's radius relative to its evolving Roche lobe.
Quantum error correction encodes a logical qubit into a larger Hilbert space, diagnoses a specified error family with an error syndrome, and reverses it without learning the protected logical amplitudes. It must preserve arbitrary superpositions, not just distinguish two classical codewords.
The bit-flip repetition code encodes
Measure the commuting stabilizer generators and using ancillary qubits. Their outcomes reveal the parity relations, with the three-qubit bit-flip syndrome table
Both codewords have the same parity checks, so the syndrome does not reveal or . For example, the error produces ; applying restores the encoded superposition. A coherent combination of correctable errors is also recoverable after the syndrome is recorded in an ancilla, by linearity.
This three-qubit code corrects one bit flip, not every one-qubit error. A physical changes the relative logical phase without a nontrivial bit-flip syndrome. General single-qubit noise is a linear combination of ; protecting arbitrary single-qubit errors therefore needs a code such as the Shor code, the Steane code or the five-qubit code, with the corresponding enlarged syndrome structure.
The general exact-recovery criterion is the Knill--Laflamme condition. For code projector and error operators , there must be constants such that
It expresses that the syndrome information can depend on the error but not on the logical state. Encoding entangles several physical qubits; it does not create independent copies of an unknown input, so it respects the no-cloning theorem. Fault-tolerant implementations must also prevent noisy syndrome extraction and recovery gates from spreading an initially correctable error into an uncorrectable one.
Quantum teleportation transfers an unknown qubit state using a previously shared Bell pair, local operations and two classical bits. It requires no description of the unknown complex amplitudes and produces no extra copy.
Let the input be , and let Alice and Bob share . Alice applies a controlled-NOT gate from to , then a Hadamard gate to . Expanding the circuit gives the Bell-basis teleportation identity in computational-output form:
Her projective measurement yields each bit pair with probability . She sends the two classical bits, and Bob applies to recover . The order is the inverse of the displayed conditional operator; interchanging these Pauli corrections changes only an irrelevant global phase when both bits are one.
Before receiving the bits, Bob has
Thus teleportation respects the no-communication theorem and cannot transmit the usable unknown state faster than the classical message. Alice's input has been measured, and the shared entanglement resource has been consumed, in agreement with the no-cloning theorem. The protocol transfers the state, not the material particle initially carrying it.
A physical implementation must distribute and preserve an entangled pair, implement a Bell-basis measurement and transmit its result to a controllable output system. Imperfect entanglement, lost outcomes and noisy corrections reduce quantum fidelity; a heralded probabilistic experiment must report its success probability separately from conditional fidelity. Ideal deterministic teleportation assumes every Bell outcome can be identified and corrected.
A weak measurement couples an observable only weakly to a meter, so the pointer distributions associated with its different eigenvalues overlap strongly. One trial supplies little information and a small disturbance; an ensemble is needed to estimate a small mean shift. It is not an exact determination of a previously hidden eigenvalue with no disturbance.
For pointer position and conjugate momentum , a short von Neumann measurement interaction has unitary . An eigenvalue translates the pointer by . The weak regime requires those translations to be small relative to the pointer width. Without postselection the first-order mean displacement is for an initially uncorrelated, suitably centered meter.
If the system is prepared in and postselected in , the unnormalized meter state is
For a real centered Gaussian pointer with no position–momentum correlation, the conditional position shift is ; the imaginary part affects the conjugate momentum distribution. The weak value can be complex or have a real part outside the observable's eigenvalue interval, because it is a conditional transition-amplitude ratio, not an eigenvalue.
An example apparatus uses photon polarization as the two-level system, a weak polarization-dependent transverse displacement as the interaction, and an output polarizer for postselection. Repeated position detections estimate the selected beam's displacement. Nearly orthogonal selection can make the conditional shift large, but also reduces the accepted sample and eventually invalidates the first-order expansion. The original weak-value proposal emphasized preselection, a weak coupling and postselection, rather than an anomalous result from an ordinary sharp spin measurement.[ref]
Weak coupling limits quantum measurement backaction per trial; it does not abolish the information–disturbance tradeoff. Repeating weak observations can accumulate substantial backaction, and discarding rejected trials cannot automatically improve the information available per prepared system. Conditional pointer amplification and a statistically improved parameter estimate are distinct claims.
In de Broglie-Bohm theory, the system has both a wavefunction and an actual configuration of particle positions. The wavefunction obeys the Time-dependent Schrödinger equation; the configuration follows the guidance equation. For spinless particles without electromagnetic vector potentials, write using a dimensionful action . Then
The actual configuration selects a trajectory, while the guiding wave generally retains all branches. A measurement correlates system and apparatus configurations; the actual apparatus position lies in one recorded branch. Effective collapse follows when wave packets have separated sufficiently in configuration space, although the full wave continues its Schrödinger evolution.
Substituting the polar form into that equation yields the probability continuity equation and a modified Hamilton-Jacobi equation,
The amplitude-dependent term is the quantum potential. Taking gradients gives a second-order force description, but initial velocities remain constrained by the guidance law. Nodes require care because the displayed quotient is singular there.
If the initial configuration distribution is , the same continuity equation preserves that distribution: quantum equilibrium equivariance. It then reproduces ordinary nonrelativistic quantum measurement statistics within the model's applicability. Equivariance preserves a distribution; it is not by itself a proof that every initial distribution equals .
For entangled particles the guiding wave lives on their joint configuration space, so one particle's velocity can depend on the distant actual configuration. This explicit nonlocality avoids the locality premise of a Bell inequality. In quantum equilibrium it does not permit controllable faster-than-light signalling. Spin extensions use a spinor wavefunction and its probability current; they need not assign a classical little spinning vector with simultaneous definite values for every spin component.
David Bohm developed this account in his two 1952 papers. The first sets out the dynamics and the second treats measurement and the relation to ordinary predictions.[ref][ref] The theory supplies additional dynamical variables and a particular nonlocal account of outcomes, rather than deriving a unique interpretation from the standard wavefunction alone.
A qubit has state with . An -qubit register occupies a -dimensional Hilbert space and may contain entanglement. This large state space does not mean that a measurement reads out all its complex amplitudes: computational-basis outcomes occur with the Born rule probabilities.
A quantum circuit prepares a register, applies quantum gates, and measures selected outputs, possibly using classical feed-forward. Closed gates are unitary operators and therefore reversible; initialization, measurement and discarding can be treated using a larger system and environment. Single-qubit rotations together with an entangling two-qubit gate give a universal quantum gate set. The CNOT gate acts as .
For example, a Hadamard gate on the first qubit of followed by a CNOT creates . A Hadamard produces amplitudes with relative signs, so later gates can make unwanted alternatives interfere destructively and useful alternatives reinforce. Quantum algorithms organize this interference to improve a specified computational task; superposition alone does not supply an arbitrary speedup or permit reading every branch.
A finite discrete universal set such as Clifford gates together with a non-Clifford phase gate approximates general unitaries to chosen precision. Runtime includes the number of gates, repetitions and classical processing. Measurement outcomes may require multiple runs to estimate a probability or amplify success.
Quantum decoherence and imperfect gates limit an implementation. Quantum error correction encodes logical information into several physical qubits and measures error syndromes without directly learning the encoded amplitudes. Under appropriate noise and control assumptions, fault tolerance permits reliable longer computations; simply maintaining an isolated ideal state is not a realistic account of a large processor.
A bipartite pure state is entangled when it is not a product state. Its Schmidt decomposition is , where and . More than one nonzero coefficient means entanglement. The two reduced density matrices have the same nonzero spectrum, and their Von Neumann entropy is the pure-state entanglement entropy. A maximally entangled pair of qubits has one bit of this entropy.
For mixed states, classical correlations are not sufficient: a separable quantum state is a convex mixture , and entanglement means that no such decomposition exists. A reduced entropy alone no longer measures mixed-state entanglement. An entanglement witness or a suitable separability criterion can detect it.
Local unitary transformations preserve the Schmidt spectrum. More general local operations and classical communication can discard entanglement but cannot freely create it from a separable input. Nielsen's pure-state conversion theorem gives the exact deterministic criterion: is possible precisely when . In decreasing order, every partial sum for the input is no larger than the corresponding output sum, with equal totals. The direction matters: a uniform spectrum can be converted to a concentrated one; a product state cannot deterministically become a Bell pair.
A probabilistic local filter can concentrate a partially entangled pair. For with , Alice's successful operator produces equal amplitudes. The outcome is a Bell pair with probability ; a complementary operator supplies a complete measurement. Failure is heralded, so there is no deterministic creation of a more entangled pair. This illustrates entanglement concentration.
Many-copy entanglement distillation and entanglement dilution connect noisy or nonuniform resources with standard Bell pairs. Entanglement enables quantum teleportation and other protocols, but classical communication is still required; the no-communication theorem excludes message transmission merely by choosing a distant local measurement.
This is an entanglement-based quantum key distribution scheme of the type proposed by Artur K. Ekert.[ref] The measurements generate correlated random data; Alice does not choose a message by choosing their random outcomes.
After the measurements, Alice and Bob announce their basis choices over an authenticated public channel. They retain the pairs with equal axes, here and , and Bob flips his outcome signs to match Alice's bits. They sacrifice a random subset for error estimation and use the appropriate other setting combinations to estimate . In the ideal source the same-axis bits match after the flip and ; the specified intercept-resend attack cannot reproduce that value.
A practical protocol includes information reconciliation, an accounting of information leaked publicly, and privacy amplification. It must abort when its statistical security conditions fail. Authentication is essential: a completely unauthenticated public channel permits a man-in-the-middle attack. A Bell-violation observation alone, without sampling, device and adversary assumptions and a finite-key analysis, is not a proof that Eve knows no key bits.
With a sufficiently uniform secret shared key of the required length, Alice can send publicly using a one-time pad; Bob recovers . The pad must be secret, as long as the protected message, and never reused. A complete security proof makes the probability or distinguishing advantage of failure small under stated assumptions. The ideal exam correlations diagnose the stated attack; they do not provide an unconditional guarantee against every attack or implementation fault.
Write and . Since and , the CHSH inequality combination becomes
Therefore
Parallel or antiparallel Eve axes attain the lower endpoint; orthogonal axes attain zero. This bound is specific to the two-sided projective attack and these planar settings. It is stronger than the generic local bound and should not be attributed to every possible eavesdropping strategy.
If Eve varies her axes independently of the users' still-secret random settings, the measured correlations average over her choices. The same linear combination obeys and remains in the interval by convexity. Strategies correlated with disclosed measurement settings would violate that independence premise; the protocol must protect it.
Figure 1.
The planar two-sided intercept-resend attack cannot reproduce the singlet CHSH value
. Original analytic curve as Eve changes the relative angle of her measurement axes. The dashed line is the undisturbed singlet result, outside the attack's attainable interval. Details.
Let Eve obtain . Applying part (b) to her axes gives . Conditional on these rank-one local measurements, the forwarded particles are a product state with individual spin directions and . Hence
Conditional independence gives the product of these means. Averaging over Eve's outcomes,
The sum is , so
Eve has turned the entangled source into an ensemble of product states by an intercept-resend attack. Ignoring her records does not restore the original singlet coherence.
The four required dot products are
Consequently the specified CHSH inequality combination is
The magnitude reaches the quantum Tsirelson bound and exceeds the local bound two. The negative sign follows this singlet and the stated order of terms; other conventions can reverse it.
A spin measurement along unit vector has outcome projector , with . The spin singlet state obeys and . Applying the Born rule,
Thus and . Substitution into part (a) gives
Equal axes give perfect anticorrelation, while orthogonal axes give zero correlation. Each local marginal remains uniform.
The spin singlet state has zero local means and outcomes , so both variances are one. Its Pearson correlation coefficient is therefore . Summing over the four joint outcomes gives
The equal-sign products contribute and the opposite-sign products contribute . In a finite sample the corresponding relative frequencies estimate these probabilities; the formula is not an assertion that a finite random sample has exactly zero empirical means.
Inverting the detector rotation at this time gives
For a representation with one system factor and one environment factor per displayed detector state, each parenthesized system–environment vector would have to be a product state. But the first has coefficient matrix in the indicated orthonormal bases; the second has matrix . Their matrix ranks are two whenever . Equivalently, their two nonzero Schmidt coefficients are , which no independent basis changes can remove. Thus the proposed factorization is impossible when .
The exception matters: at , the detector basis is the original basis up to phases or interchange, and a factorization does exist. In particular, the literal condition is insufficient if it includes . The intended obstruction concerns genuinely mixed detector bases.
The environment has selected robust detector records: its interaction commutes with the original projectors, and orthogonal environmental records suppress their interference in the reduced density matrix. A rotated detector branch instead leaves the system and environment entangled. This is environment-induced pointer-basis selection, the issue analyzed by W. H. Zurek in his apparatus-environment model.[ref]
This addresses the basis ambiguity but does not by itself select one realized outcome from the global superposition. Moreover, a two-state environment has recurrences: returns to unit modulus, so the toy model does not establish irreversible macroscopic collapse. A large environment can make records effectively persistent over experimental times, but that requires further dynamical assumptions. The distinction is part of the measurement problem, not an algebraic error cured by a partial trace.
At , define
They are normalized and orthogonal. The full state is the pure superposition . A nonselective von Neumann process 1 selecting the original detector records gives
Without imposing any projection on the full state, tracing out the orthogonal environment states already gives from part (a). These two global descriptions share that reduced state but differ in their global coherence. Quantum decoherence does not make a pure global state literally equal to the corresponding statistical mixture.
Since , the solution of the Time-dependent Schrödinger equation is
The two detector eigenvalues generate opposite rotations of the environment. Acting on the initial state gives
These are the indicated and . Their conditional environment overlap is . The partial trace therefore multiplies the coherence between and by . This is an exactly solvable single-qubit environment dephasing model, with fully reversible global evolution.
Figure 1.
Single-qubit environmental records suppress and later restore reduced coherence
. Original ideal unitary model. Zero off-diagonal coherence at one time does not imply irreversible collapse of the full state. Details.
Write , with . The orthogonal projection operators obey and . Hence , and the remaining tensor factors commute with detector operators. Therefore
The environment interaction preserves these detector populations, making their basis a candidate pointer basis. It can change their relative coherence without flipping the stored labels.
Put and . The detector rotation is real and orthogonal, so its inverse is the same transformation. Substituting it gives
Thus the requested orthonormal system states are
The pure density operator has not changed: this is only a different Schmidt decomposition of a maximally entangled state. But choosing a nonselective projective measurement in this new detector basis gives a different operation and generally a different state:
For an explicit matrix in the original ordered basis, write and . Then
At the entries and are , whereas they vanish in . Nevertheless, the system and detector individually each have reduced density matrix for either mixture.
This is the preferred-basis problem: the correlated state alone does not specify which detector observable becomes a stable classical record. Arbitrarily declaring collapse in a Schmidt basis changes the physical prediction. The actual detector interaction and environment must supply the basis selection, rather than a mere choice of notation.
Linearity of the detector's unitary time evolution maps the two input branches separately, giving the quantum premeasurement state
In the ordered tensor product basis , its pure density matrix is
A nonselective projective measurement in the indicated detector basis applies , removing the two off-diagonal terms:
This is the usual nonselective meaning of von Neumann process 1. It is not equal to the pure projector . If “the detector has clicked” means conditioning on an actual up outcome, the normalized postselected state is instead , with probability . The correlated superposition describes the coherent premeasurement before that selection.

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