Quantum Physics Glossary

The vocabulary of Constraint-Surface Dynamics. Every term three ways: plainly, in the role it plays here, and formally. Each one has a machine-checked theorem behind it.

Constraint-Surface Dynamics is a research programme reconstructing quantum mechanics from a single deterministic arena — start at the main site or go straight to the papers.

• Aharonov-Bohm effectAn electron that never enters a magnetic field can still be shifted by it, as the enclosed flux changes the interference between paths, which shows that the field's potential carries physics the field strength alone doesn't.
• amplitude amplificationAmplitude amplification is the theorem of which Grover's algorithm is a shadow, as any quantum procedure with any success probability can have that probability raised by pure interference, quadratically faster than retrying.
• amplitude estimationPoint phase estimation at the rotation inside amplitude amplification and the success probability itself becomes measurable, quadratically faster than sampling could ever learn it.
• Bargmann invariantOne phase survives every change of convention, the phase of the product of three overlaps taken around a cycle, and it's also the fingerprint that tells a unitary symmetry from an anti-unitary one.
• Bell and CHSHNo pre-written answer sheet for all four measurement settings can match what a singlet pair of particles does, and the corpus proves this as a theorem about every possible answer sheet.
• Bell state is not a joinThe arena CSD assigns to two systems together is strictly larger than the two arenas simply paired, and the Bell state is a point of the excess, so entanglement is located exactly.
• Bernstein-Vazirani algorithmA hidden string of bits costs one classical question per bit, or exactly one quantum question in total, so the Bernstein-Vazirani algorithm is the cleanest single-query win the field has.
• Bloch sphereThe states of the simplest quantum system form an ordinary ball, which is a lovely accident of low dimension and the single most misleading picture in quantum mechanics.
• Bohmian mechanicsBohmian mechanics is CSD's nearest neighbour, deterministic, with definite states, and openly non-local, and the dispute between them is over where the probabilities come from.
• Borel setBefore any region can have a probability, someone has to say which regions are allowed to have a size at all, and the Borel sets are the answer everyone uses.
• Born ruleQuantum probabilities aren't a law of nature in CSD, as they're the sizes of regions in the space of states, measured with a ruler nobody was free to choose.
• Born volume ratioIn every finite dimension the Born weight of an outcome equals a ratio of volumes in the space of quantum states, for every outcome and every state, with no genericity condition attached.
• Canonical typicalityA small piece of a large quantum system looks thermal not because anything prepared it that way, but because almost every state of the whole makes it look that way.
• CarvingCarving is the programme's own word for the move it refuses to count as a derivation, which is cutting a region to have exactly the size you wanted to explain.
• CGLMP inequalityBell's inequality is built for measurements with two outcomes, so once you go beyond two you need a new inequality, and the conflict with local realism grows stronger rather than weaker.
• Choi's theoremA transformation of quantum states is physically allowed exactly when one matrix built from it passes a single positivity test, and CSD proves both directions, so whether a map is physical becomes a decidable question of linear algebra.
• Clifford plus TClifford plus T is the standard universal gate set, as the Clifford gates alone are classically simulable and adding the single eighth-turn phase gate makes every unitary reachable to any accuracy you ask for.
• Colbeck-Renner theoremNo deeper theory can predict a quantum measurement better than quantum mechanics does, as long as it lets the settings be chosen freely, and the proof runs on a chain of correlations that closes up on itself.
• CollapseIn CSD the quantum state never jumps, and that's a theorem about volume-preserving maps rather than a preference among interpretations.
• concatenated codeConcatenation encodes a code inside itself, so each physical qubit of the outer block becomes a whole encoded block of its own, and the failure probability drops to roughly its own square at every level.
• Constraint surfaceThere's one arena, it's deterministic, and it doesn't grow, and everything else in the programme is bookkeeping about how much of it a measurement context lets you see.
• ContextualityFor some sets of quantum questions no consistent answer sheet exists at all, and CSD's response is to stop demanding one answer per question and to say instead what the answer depends on.
• Copenhagen interpretationCopenhagen is the oldest position on quantum measurement and the one that declines the question, as measurement is where the theory stops and not something it explains.
• Crooks fluctuation theoremRun a process forwards many times and backwards many times, and the two records of work done cross at exactly the free energy difference. Every irreversible run is priced, not just the average.
• Darboux theoremEvery symplectic space looks the same near any point, as there's always a chart in which the structure takes the textbook form, so symplectic geometry has no local invariants beyond the dimension.
• De-isolationNothing collapses, as a measured system stops being isolated, and measurement is what de-isolation dynamics looks like from inside.
• DeterminismThe substrate has no dice, so the spread in the data is variation in what your preparation couldn't pin down.
• Deutsch-Jozsa algorithmThe Deutsch-Jozsa algorithm settles a question with a single query where any exact classical method needs exponentially many, and the problem it solves is useless by design and historic for exactly that reason.
• Dirichlet distributionBeing fairly ignorant about proportions that must add up to one has a precise mathematical form, and by a small miracle it's exactly the form that quantum state space flattens into.
• Duistermaat-Heckman formulaProject the curved space of quantum states down to its outcome probabilities and the curvature disappears exactly, which is what makes the Born rule computable in every dimension.
• Elitzur-Vaidman bomb testerYou can certify that a bomb is live without a single photon touching it, so the absence of an interaction becomes the measurement.
• Entropy subadditivityThe information missing from a whole never exceeds the sum of what's missing from its parts, and that's von Neumann's subadditivity inequality, proved at the matrix level with the operator-logarithm step informal proofs usually wave through.
• Epistemic measureCondition on what a preparation actually fixes, and the ignorance left over is a measure, and that measure is a theorem rather than a stipulation, as the arena's own volume disintegrates into exactly it.
• Euclidean spaceOrdinary geometry, extended to complex numbers, is the stage on which every finite quantum system in the corpus stands.
• Feynman-Kac formulaThe Feynman-Kac formula makes the path integral rigorous in imaginary time, as the solution of a heat equation with a potential is an average over Brownian paths weighted by the potential they travelled through.
• FibreThe arena of CSD is larger than the space of quantum states by exactly one compact factor, and from three dimensions upward the natural ways of doing without that factor stop working.
• Field arenaTake finitely many field modes, cap the number of quanta each can hold, and the whole toolbox of quantum field theory, propagators, light cones, Wick's theorem and thermal states, reappears as exact theorems on one finite arena.
• First-passage raceWhen a measurement has several possible outcomes, the one that happens is the one whose clock fires first, and the law those clocks obey isn't a modelling choice, as it's the only law that makes the race come out right, and that's proved in both directions.
• Fisher informationThere's a floor under every error bar, classical or quantum, and Fisher information is what sets it.
• Fisher-Rao metricThe natural way to measure distance between quantum states agrees with the statistician's way to measure distance between the probability distributions they produce, exactly and with no constant left to fix.
• Fubini-Study measureThe space of quantum states allows exactly one way of measuring size that respects its symmetry, and that one measure is what turns regions of the space into Born-rule probabilities.
• geometric phaseA quantum state taken around a closed loop and brought back to where it started keeps a leftover phase that depends only on the shape of the loop, so the phase is a record of the journey rather than of the time it took.
• GHZ stateThree particles can contradict local realism with certainty in a single run, with no statistics, no inequality and no margin of error.
• Gibbs stateThe state a system settles into at a given temperature is the unique solution to a trade-off between energy and disorder.
• Gisin's theoremEvery entangled pure state, however slightly entangled, violates a Bell inequality, so there's no quiet zone.
• Gleason and Busch theoremsThe corpus proves the standard route to the Born rule rather than borrowing it, and CSD's own derivation never uses it, so the two routes to quantum probability are genuinely independent.
• Gottesman-Knill theoremThe Gottesman-Knill theorem marks the boundary of quantum advantage, as circuits built from the Clifford gates can be simulated classically, because in the right picture they're nothing more than linear algebra on bits.
• Grover's algorithmGrover's algorithm finds one marked item in an unsorted list in a number of steps proportional to the square root of the list size, and a separate theorem shows that no quantum algorithm can do better.
• Haar measureA closed and bounded family of symmetries has exactly one even-handed notion of volume, and every measure CSD calls forced inherits its uniqueness from that one fact.
• Hadamard testThe Hadamard test turns a matrix element, a complex number buried inside an operator, into the bias of a single coin.
• Helstrom boundThe Helstrom bound says how well any measurement can tell two quantum states apart, and the answer is exactly the trace distance between them, attained by one specific test.
• Hermitian operatorA single symmetry condition on an operator guarantees that every number it can produce in a measurement is real, and it delivers the whole machinery of outcomes and eigenstates at no extra cost.
• Hidden variablesThe no-go theorems don't kill hidden variables, as they price them, and CSD reads the price tag and pays it.
• Hilbert spaceHilbert space is the stage on which quantum mechanics is usually performed, and CSD's claim is that it's scenery, the shadow cast by the physical object and not the object itself.
• Holevo boundA quantum system can be prepared in infinitely many distinct ways, yet no reader can extract more classical information from it than from a classical system of the same size, and the measurement channel of CSD is proved to pass exactly one bit per qubit.
• Hong-Ou-Mandel effectWhen two identical photons meet at a beam splitter they always leave together and never one through each exit, so their indistinguishability shows up as a hole in the data.
• Interaction priceSwitching on an interaction between field modes makes local quantities spread at a rate proportional to the coupling, and the corpus proves the rate is exact, at most twice the coupling times the elapsed time, and at least a fixed fraction of it.
• IsolationBeing isolated isn't scene-setting, as it's the variable the whole theory turns on, and quantum mechanics is what isolated pieces of the arena look like from outside.
• Jacobi identityThe Jacobi identity is the law that turns the mismatch between doing things in different orders into a structure of its own, and it's why classical and quantum dynamics read as two dialects of one language.
• Jarzynski equalityRush a system between two equilibrium conditions as violently as you like, and the average of a particular exponential of the work you did still returns the equilibrium free energy difference exactly. Irreversible experiments measure a reversible quantity.
• Kahler formOn the space of quantum states, distance, area and a quarter-turn coming from the complex numbers lock together, and that lock is what makes the volume of the space nobody's choice.
• Klein's inequalityOne quantum state is never negatively distinguishable from another, as the relative entropy of a state with respect to a second is at least zero, and that single inequality drives the second law, subadditivity, concavity and the Holevo bound in the corpus.
• KMS conditionThe algebraic signature of thermal equilibrium holds exactly on CSD's finite field arena, and cooling the thermal state all the way down recovers the vacuum.
• Knill-Laflamme conditionsQuantum error correction has an exact test, as a set of errors is correctable if and only if the code can't tell those errors apart, and that condition is a piece of algebra you can check before building any repair.
• Kochen-Specker theoremThere's a finite list of directions in space that admits no consistent yes-or-no labelling, so contextuality follows by pure counting, with no experiment, no statistics and no separated particles.
• Koopman operatorClassical mechanics has a Hilbert space and a unitary time evolution of its own, so neither of those is what makes a theory quantum, and what's left as the difference is that quantum observables don't commute.
• Kronecker productTwo quantum systems become one by multiplying their descriptions rather than adding them, which is why quantum resources multiply where classical ones merely add.
• Landauer's principleForgetting costs heat at a rate set by temperature alone, and that's the point at which information stops being an abstraction and acquires a physical price.
• Leggett-Garg inequalityBell's argument can be rotated from space into time, and what it then tests isn't action at a distance but whether the world has a definite history.
• LF1 main theoremIn a deterministic world with repeated preparations, the frequencies you observe converge to volume ratios with probability one, and the theorem is machine-checked with no randomness anywhere in the dynamics.
• Lie-Trotter product formulaAlternate many tiny steps of two operations that don't commute and the result converges to the exponential of their sum, with an error that shrinks like one over the number of steps, and CSD proves this in textbook generality, in a form ready for the Mathlib library, because its open-systems tier needed it and nothing on the shelf existed.
• Lieb-Robinson boundEven without relativity, influence in a quantum system with local interactions has a speed limit, and on CSD's finite field arena that limit is a theorem with the velocity written out.
• Lindblad equationThe master equation of open quantum systems is formalised end to end, as the evolution generated by every Lindblad generator is proved to be completely positive, with the bystander-system argument carried out rather than gestured at.
• Liouville measureA deterministic substrate needs a notion of volume that its own motion can't distort, and on CSD's sector that volume is forced and it's the Born measure.
• Loewner orderThere's a workable meaning of bigger for operators, and it brings a strange discovery, as taking square roots respects it while taking squares can break it.
• Luders ruleThe textbook's second rule, which says how a state changes when it's measured, isn't a second rule in CSD, as it's what the record layer does.
• Mach-Zehnder interferometerSplit a single particle down two paths and recombine them, and where it lands depends on both paths, including the one you can prove it never took.
• magic stateA magic state is the fuel of quantum advantage, a single special state that, consumed by otherwise classically trackable Clifford circuits, unlocks the one gate the Gottesman-Knill theorem can't simulate.
• magic-state distillationDistillation turns many noisy magic states into one clean one, by encoding them in a code whose checks reject the likely errors, and the error rate falls as the cube of itself at every round.
• Malus's lawMalus's law is a cosine-squared rule discovered in 1808 with a crystal and a sunset, and it turns out to be the oldest data point for the Born rule.
• Many-to-one projectionBehind every quantum state stands a crowd of world-states, and the projection that maps the crowd to one state loses information on purpose, and that loss is where quantum probability comes from.
• Many-Worlds interpretationMany-Worlds keeps the smooth quantum evolution and gives up the single outcome, and CSD makes the opposite choice, one trajectory and one world, as a settled commitment.
• Measurement contextA measurement isn't a question put to the quantum state, as it's a piece of apparatus, and the apparatus brings its own way of dividing the world into outcomes.
• Measurement flowA deterministic, volume-preserving flow carries out a measurement, and the volumes of its pointer blocks are the Born weights, for every preparation.
• Measurement problemQuantum mechanics contains two incompatible rules of change and no instruction for when to switch between them, and CSD replaces the switch with theorems about what no dynamics can do.
• Mermin inequalityAdd more particles and the conflict between quantum mechanics and common sense grows exponentially, so it doesn't average out but compounds.
• Moment mapThe Born probabilities are coordinates, and the moment map reads them straight off the geometry of the space of quantum states, with no measurement postulate consulted.
• Naimark dilationEvery noisy, imperfect measurement made in a real laboratory is an ideal textbook measurement carried out on a larger system, and that single fact is what lets CSD's derivation of the Born weights cover actual experiments rather than idealised ones.
• Nelson stochastic mechanicsNelson derived the Schrodinger equation from a diffusion, so the same continuity equation that lets Bohm read a velocity off the wavefunction lets Nelson read a drift with noise against it, and the Born density solves both.
• No exact finite-dimensional CCRIn a world with only finitely many distinguishable states, the founding equation of quantum mechanics can't hold exactly, and one line of arithmetic proves it while CSD says precisely where the equation gives way.
• No-signallingNothing done to the far wing of an entangled pair changes the statistics seen at the near wing, and CSD proves this exactly, for every state, entangled ones included.
• Ontic vs epistemicWhat exists is one question and what a measurement context lets you say is another, and most quantum paradoxes are category errors between the two.
• Outcome regionAn outcome is a region, and the apparatus alone draws its boundary, so the preparation decides where the trajectory lands and doesn't get to draw the map.
• Ozawa error-disturbance relationThe famous error-times-disturbance formula attributed to Heisenberg fails in the laboratory, and the relation that actually holds is Ozawa's, with three terms instead of one, and the corpus proves it.
• Partial traceMathlib has no partial trace for matrices, so the corpus built one, the staple operation of quantum information, with its working properties proved and staged for contribution upstream.
• Pauli matricesThree small matrices carry the entire two-level world, and their refusal to commute is the uncertainty principle in its smallest packaging.
• Peres criterionYou can test for entanglement with a pencil, as you transpose half of the joint description, and if a negative eigenvalue appears the pair is entangled.
• phase estimationPhase estimation, the workhorse subroutine of quantum computing, carries a guarantee, as if you read the dial at the nearest tick you're right at least four divided by pi squared of the time, a little over forty percent, however fine the dial.
• Pointer basisA measuring apparatus doesn't record what you ask it to, as it records what it can keep, and what it can keep is decided by its interaction with the surroundings and not by the experimenter.
• Poisson bracketThe Poisson bracket is the one rule that tells classical mechanics how fast any quantity changes, and the quantum commutator obeys exactly the same algebra, so that shared grammar is what lets a deterministic flow present itself in quantum form.
• Preparation regionRepeating the same experiment is a physical claim, and this is what it refers to, a region of the arena and not a single point, that the preparation procedure lands the world in.
• ProjectabilityProjectability is the one genuine postulate at the interface, that the ontic arena projects onto the space quantum mechanics is written on, and downstream of that symmetry does the choosing.
• Projective sectorQuantum mechanics is written on a curved projective space, and in CSD that space isn't fundamental, as it's the sector the arena projects onto, with its geometry forced by symmetry.
• Psi-epistemicThe quantum state is what you know and not what exists, and the hard part was always saying what it's knowledge of, so CSD's whole architecture is an answer to that.
• QBismQBism is epistemic all the way down, as the quantum state is one agent's betting book and there's nothing underneath, and CSD agrees about the state and insists on the underneath.
• Quantum channelThe most general thing that can happen to a quantum state is captured in CSD as a concrete structure, a family of operators with one completeness law, and every certificate of its physicality is proved rather than assumed.
• quantum Fourier transformThe quantum Fourier transform runs Fourier's transform as a single reversible motion of a quantum register, and it's the lens that turns hidden periods and phases into outcomes a measurement can land on.
• Ramsey interferometryTwo brief nudges separated by a long stretch of doing nothing measure a frequency more sharply than any amount of continuous pushing, and every atomic clock runs on this trick.
• Record layerA measurement is over when the world itself carries which outcome happened, and the record layer is where that fact lives, on the arena and not in anyone's notebook.
• Record light coneRecords are safe from distant meddling by theorem, as anything that happens outside the light cone can shift the outcome written into the arena's fibre by no more than a bound that collapses factorially with distance.
• reversible adderA reversible adder has to return its scratch space clean, and the carry-clean ripple-carry design does it with a single spare qubit, which is what makes arithmetic affordable inside a quantum algorithm.
• Robertson uncertainty relationRobertson's inequality is the precise form of the uncertainty principle, and in CSD the spreads it bounds are the spreads of quantities genuinely distributed over the underlying state space and not merely abstract expectation values.
• Schrodinger equationIn CSD the Schrodinger equation isn't postulated, as it's what any continuous motion that preserves the measurable relations between quantum states is forced to look like.
• Schrodinger from recordsCSD doesn't postulate the Schrodinger equation, as preserving the statistics of records forces the dynamics to be unitary, unitarity together with continuity forces a Hamiltonian, and the exponential form of the equation is a theorem at the end of that chain.
• Shor codeShor's nine-qubit code was the first proof that quantum information can be protected against any error on any single qubit without ever being read, and the corpus verifies that protection as explicit constructed operations, including the subtle case where two different errors share one repair.
• Shor's algorithmShor's algorithm factors large numbers in polynomial time on a quantum computer, and it turned quantum computing from a curiosity into a budget line and made every deployed cryptosystem provisional.
• Simon's algorithmSimon's algorithm was the exponential separation that convinced Shor, as a hidden bitwise mask, unfindable classically without exponential work, falls to a handful of quantum queries and some linear algebra.
• Single trajectoryThere's one world and it follows one path, so probability lives in how experiments are repeated and not in how the world evolves, and theorems rather than wording keep the two apart.
• Singlet contextual modelOne machine-checked theorem settles both halves of the Bell question, as an explicit model in which outcomes depend on the measurement context reproduces the singlet pair's statistics in full, and no assignment that ignores the context can.
• Spontaneous collapse (GRW)Spontaneous collapse theories change the equations of quantum mechanics and can be killed by experiment, and CSD, so far, can't be, and its own documentation says so.
• stabiliser codeA stabiliser code describes a quantum code by the measurements that leave it alone, which replaces a list of encoded states by a handful of parity checks and turns error correction into linear algebra over the two-element field.
• Steane codeSeven qubits protect one, as the Steane code was the first to correct any single- qubit error by using the same classical Hamming code twice, once for bit flips and once for phase flips.
• Stern-Gerlach experimentAtoms sent through an uneven magnetic field split into two clean beams instead of a smear, and sorting them twice along different axes undoes the first sorting, so the whole strangeness of quantum measurement sits in one 1922 apparatus.
• Stinespring dilationEvery noisy quantum process is a reversible process on a larger system with part of that system ignored, and in CSD the larger system is the constraint surface itself, so every channel the programme uses is the environment's marginal of a volume- preserving flow.
• Stone's theoremAsk only that time evolution never jumps, and differentiability, a generator and the Hamiltonian all follow for free.
• swap testThe swap test measures how alike two quantum states are without learning anything about what either one is, so it's a comparison that keeps both secrets.
• threshold theoremThe threshold theorem says imperfect components suffice, as long as each one fails below a fixed rate you can make a quantum computation as reliable as you like by encoding it inside itself repeatedly, and the price is only a power of a logarithm.
• Toffoli gateThe Toffoli gate flips its target only when both controls are set, which is enough to compute anything classically while remaining reversible, and its count is the currency in which the cost of a quantum algorithm is quoted.
• transversal gateA transversal gate computes on encoded information by acting on each physical qubit separately, so a fault in one qubit stays in one qubit and the code keeps its protection while the computation runs.
• Tsirelson boundQuantum mechanics breaks the classical limit on correlations and then stops well short of what logic alone would allow, and why it stops exactly there is a genuinely open question.
• two-level unitaryEvery quantum operation, on any number of qubits, factors exactly into operations that each touch only two levels of the state space, and a count of how many such factors are needed follows from the same elimination that produces them.
• TypicalityTypicality is probability without randomness, as the world is deterministic, you don't know which state you have, and the odds are the sizes of the possibilities.
• Typicality volumeAlmost every way the experiment could have started gives the quantum statistics, and that isn't an assumption about probability, as it's a measured volume.
• von Neumann entropyA quantum whole can be perfectly known while its parts are as uncertain as they could possibly be, and entropy is where that stops being a metaphor and becomes arithmetic.
• Wick's theoremThe bookkeeping rule at the heart of quantum field theory, which reduces any correlation of field operators to a sum over pairings, survives a finite cutoff exactly, and the threshold at which it fails is part of the theorem.
• Wigner functionThe Wigner function writes a quantum state as a distribution over position and momentum together, which reproduces every prediction of quantum mechanics and goes negative, so it's a phase-space picture that can't be a probability.
• Wigner rigidityPreserve the overlaps between quantum states and you have no freedom left, as the rearrangement must be a unitary or an anti-unitary transformation whether or not you intended it to be.
• Wigner-Araki-Yanase theoremA conservation law restricts what can be measured, as an observable that fails to commute with the conserved quantity admits no exact measurement by an interaction that conserves it, provided the apparatus pointer is blind to its own share of the charge.
• Witness and engineA working model proves that the machinery runs, and it doesn't prove that the machinery is the world, so CSD names that distinction and audits itself against it.

Questions

• Does CSD make new predictions?Not yet, and the programme doesn't pretend otherwise, as the present claim is that CSD reproduces the predictions of quantum mechanics from fewer postulates, with the reproduction machine-checked, while candidate departures are recorded as owed future work rather than asserted.
• Does CSD violate Bell's theorem?No. Bell's theorem stands, CSD proves its own versions of it, and CSD escapes its conclusion by the one route the theorem itself leaves open, measurement outcomes that depend on the measurement context, paid for openly.
• Does the excess-baggage theorem count against CSD?No. The excess-baggage theorems say any model with real underlying states beneath quantum mechanics needs a continuum of them, and CSD's constraint surface is a continuum from the outset, so the requirement is met before it's raised.
• Does the Kochen-Specker theorem rule out CSD?No. The Kochen-Specker theorem forbids giving every possible measurement a fixed answer independent of which experiment is actually performed, and CSD assigns outcomes through the measurement context by construction.
• Does the PBR theorem rule out CSD?No. For exactly prepared pure states, CSD satisfies the very conclusion the PBR theorem argues for, as two distinct states correspond to sets of underlying world- states that don't overlap at all, and that's a proved theorem rather than something arranged by hand.
• How does CSD differ from Bohmian mechanics?They're cousins rather than twins, as both theories pay the price the no-go theorems demand of any deterministic account, but Bohmian mechanics postulates its equilibrium distribution where CSD proves its measure unique, and the arenas underneath the two are different kinds of object.
• If CSD is deterministic, where do probabilities come from?They come from ignorance of the exact starting point, as the dynamics never rolls dice, and the probabilities are the sizes of the sets of microstates a preparation can't tell apart, measured with a ruler nobody was free to choose.
• Is CSD a hidden-variable theory?Yes, in the technical sense, as something definite underlies the quantum state in CSD, and the programme openly pays the two prices the no-go theorems demand, dependence on measurement context and correlations beyond what locality permits.
• Is CSD superdeterministic?No. In CSD's Bell model the distribution of hidden states is provably the same whatever settings the experimenters choose, and the escape from Bell's theorem runs through outcomes that depend on the measurement context and not through settings arranged in advance.
• Is the Born rule derived or assumed in CSD?It's derived, as the volume of a region of the underlying state space measured with the one ruler its symmetry allows, and the assumptions that remain are named posits, listed openly rather than hidden in the machinery.
• Is the wavefunction real in CSD?The wavefunction is a genuine but incomplete coordinate of a real underlying world, so it can be read off the world's actual configuration, yet it leaves out the part of that configuration which decides what a measurement will show.
• What exactly is machine-checked in CSD?Every theorem in the CSD corpus is verified by a proof assistant from zero imported axioms, and the list of what such checking can't certify is published alongside it.
• What happens during a measurement in CSD?The system stops being isolated, the joint dynamics of system and apparatus carries the underlying state into one outcome region and leaves a record there, and the famous collapse is the updating of a description, so there's one law and no switch.

Privacy policy