Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
Here's what this paper means for actual humans: WHAT THIS IS ABOUT. The two companion papers established, for a system split into TWO parts, that you can certify what a quantum device's subsystems are from remarkably little: two generic operations, their statistics, two sampling times. Real devices have many parts. This paper carries the entire theory from two parts to many, and closes the last open corner of the two-part theory on the way. WHAT WE FOUND, IN PLAIN TERMS. Four things. (1) A LAW FOR EVERY CUT AT ONCE. Any wrong choice of parts distorts the family of unentangled states, and for many parts we derive exactly how much, for every way of cutting the device in two and every pattern of deformation across the parts: one closed formula whose weights land on exact fractions (verified to nine decimal places with a sampling-free method). The two-part law is literally the corner case. A structural surprise falls out: with many parts, rigidity is unavoidably direction-dependent; the meaningful object is a weight function over subsets of parts, not a single constant. (2) THE DIAGNOSTIC TOOLKIT GOES FULLY CLOSED-FORM. The standard "how wrong is this factorization" measures turn out to be exact linear functions of just two matrix norms of the frame (the same matrices behind textbook entanglement tests), with coefficients we give in closed form at every pair of dimensions, validated blind on dimension pairs the fit never saw. The two-part frontier constant decomposes into per-side constants with a clean derived formula, and the worst-case ratio of scrambling to visible distortion is computed exactly at three dimension pairs (28/11, 5/2, 265/138), each achieved at an exact-integer point by an explicit saved transformation. (3) CERTIFICATION IS PER-NODE. For many parts, which structure you pin down depends on which operations you certify, node by node on the lattice of ways to partition the device: a node is pinned exactly when your certified operations generate that node's algebra of local actions. Certify only one cut and the interior of a block stays COMPLETELY free (we exhibit an explicit transformation that passes every certificate while maximally scrambling the interior); add one more operation inside the block and it is still free; add two and everything locks. Counting operations is meaningless; per-node generation is everything. (4) A WEAK SECTOR BLINDS THE WHOLE DEVICE. The sampling-time blind spots found in the two-part theory (times at which certification passes while revealing nothing) survive with a sharper lesson: a forgery built for two resonant qubits, simply tensored with "do nothing" on the rest, passes every certificate of the full device while scrambling every cut that touches those qubits. On all-qubit hardware the dangerous sampling times are therefore a property of the whole machine, set by its calibration scale. The known fix (sample at two times, one generic) carries over unchanged. WHY IT MATTERS. For hardware: certifying a large device decomposes into certifying lattice nodes, each with a concrete requirement (generation-complete operations, non-resonant sampling), and the paper says exactly what an uncertified block costs you: everything inside it. For theory: the two-part identifiability program is now a special case of a lattice theory with closed-form constants throughout. HOW MUCH TO TRUST IT. Every quantitative claim was pre-registered in the companion scripts before its run. The appendix ledger lists every prediction: the hits, five failed predictions with their mechanisms, and one computation we invalidated ourselves before it could ship. Negative results rest on exact constructive witnesses, not on searches failing. All code, data, saved transformations, and working notes are in the deposit, seeded for exact reproduction, and every external reference was verified against a live source before citation. WHO AND HOW. A human-AI collaboration: research direction and standards of evidence by Ryan Cardwell (Crystalline Labs); design, code, derivations, and drafting by Claude (Anthropic), operating autonomously under a written research charter. The full arc, from empty directory to this draft, ran in one day of charter-governed iterations.
Version 4 (2026-08-25). Two additions from the correction campaign, carried as dated in-body correction records. The (2,5) entry, printed as a prediction in v3, is now census-exact -- and it was the wall law's first divergence test. At the constructed maximal-wall stratum point the stiff transverse count is exactly 10, so alpha_stratum(2,5) = 5; a fresh 60k ensemble's calibrated read is consistent with 5, with alpha = 10 (the superseded single-wall count's prediction) excluded at p = 0.000 and demonstrated power ~ 1; and a stratum-conditional paired ladder tracks the exact rank-10 Hessian form to <= 0.002 while a rank-20 comparator separates by >= 2.7 on identical draws. The law m_C(2,d) = 2(d-1) is census-exact at d = 3, 4, 5, now including the first point where it diverges (by 2x) from the superseded count. The (3,4) entry, printed open in v3, is now a PAIR of statements, and neither alone is alpha(3,4). The posted product-wall counting landed census-exact (alpha_stratum(3,4) = 5, so the asymptotic exponent satisfies alpha(3,4) <= 5), while the accessible window at n = 3e4 is steeper (calibrated 90 percent set [5.4, 6.9], with the previously read 4.0-4.1 excluded at power ~ 1): the codim-10 stratum's prefactor has not engaged at reachable depth, and window and asymptote have visibly decoupled. This is the scope lesson of the (d >= 3) x (d' > d) regime -- census plus conditional ladder measure the law, global windows measure the pre-asymptotic shoulder -- and it retro-explains the earlier fresh-seed ladders' instability as shoulder reads. Version 3 (2026-08-20). One SUPERSESSION: the qutrit-qutrit exponent closes. Versions 1 and 2 left alpha(3,3) open, v1 by a small-sample fit reading 3.25 and v2 by the bracket [2.3, 3.0] read off a descending window ladder. Both readings were artifacts of the estimator problem for which the pair-type table was already corrected in v2. The descent is attenuation tracking sample count rather than tail depth: an ensemble drawn from an EXACT alpha = 3.0 law descends by 0.62 across the ladder against the real data's 0.34, so a descending ladder is evidence FOR a constant exponent, not against one. Replacing the window fit with a calibrated Monte-Carlo test and inverting it over candidate exponents gives alpha(3,3) = 3.0 at p = 0.517 with a 90 percent confidence set [2.75, 3.10]; v1's 3.25 is excluded at p = 0.017. Power against alternatives is 0.990 / 0.590 / 0.120 / 0.575 / 0.990 / 1.000 at true alpha = 2.50 / 2.75 / 3.00 / 3.25 / 3.50 / 4.00. An independent re-audit at n = 10^4 reads flat near three on two seeds. Disclosed defect, carried in the paper: the test's own calibration row missed at the low edge (rejection rate 0.207 at a nominal 0.10 when the truth is alpha = 2.50, 4.4 standard errors high), so the lower end of the confidence set is softer than printed. This ensemble separates 3.0 from 3.25 with about 58 percent power and has none to separate 3.0 from 2.95. The (3,3) CARRIER family remains unattributed: the exponent is settled, the stratum that carries the accessible tail there is not. Version 2 (2026-08). Changes from v1: the pair-type exponent table is corrected (v1's alpha(2,4) = 2.08 was a 50-sample order-statistics fluctuation, placed at the 0.15th percentile of its own estimator's sampling distribution; three independent codebases now agree on the wall law alpha(2,d) = d, census-exact at d = 3 and 4); the transverse constant 1/12 is derived in closed form (diagonal cost 1/6, halved by the congruent partner's equal-cost correction); the (2,3) tail's carrier stratum is fully attributed (an isotropic-intertwiner family sharing the exponent 3); the qutrit-qutrit exponent is honestly bracketed open at [2.3, 3.0]; and the dispersion rule (tail-exponent fits print bootstrap dispersion or do not print) is adopted. The v2 ledger appendix carries the correction anatomy. Why is the multipartite certification constant heavy-tailed, where does the tail live, and what kills it? Localization: the credential pencil is exactly block-diagonal over party-subset supports; the tail is the worst pair; geometry statistics reconstruct from pair statistics (14/14 factor-band comparisons). The law: a frame-congruence theorem: whenever the two parties' operation frames subtend equal Bloch angles, the rotation intertwining them is an exact common kernel direction; the zero set is codimension one at generic angles, transverse growth is universally quadratic (mu = (Delta theta)^2/12), and the qubit-pair tail exponent is exactly 1/2 (the previously measured 0.39 is the finite-window slope of this law). The dichotomy: pairs containing a d >= 3 party measure exponents 2.08 to 3.69 because higher-dimensional operation pairs carry many local invariants that must all match: freedom helps the certifier. Engineering: heterogeneous dimension profiles tame the tail; qubit-pair presence splits all measured geometries into two clean classes; screening is a five-minute two-party calculation. Pre-registered; two entry gates that caught wrong conventions and all deaths ledgered.
Here's what this paper means for actual humans: WHAT THIS IS ABOUT. When you build or use a quantum device, everything rests on knowing what its parts are: which degrees of freedom are "qubit 1," which are "qubit 2." The companion paper ("Forged Frames") showed that simple mathematical criteria cannot certify this; convincing fakes exist. This paper answers the question that result leaves standing: what is the MINIMUM experimental information that genuinely pins down a system's subsystem structure, and when can that information silently fail? WHAT WE FOUND, IN PLAIN TERMS. Four things. (1) EXACT LAWS INSTEAD OF MEASUREMENTS. Any wrong choice of parts must visibly distort the family of unentangled states, and we derive exactly how much, at every system size: closed-form constants (verified to seven decimal places), an explicit error bound, and a surprise. The two natural ways to measure "wrongness" (state distortion versus operator scrambling) turn out to be literally the same measurement, up to a fixed number, whenever the two parts have equal size. Wrongness cannot hide. (2) THE TWO-OPERATION THRESHOLD. You can pin down what your subsystems are by implementing just TWO generic operations and checking their statistics, while a THOUSAND mutually commuting operations tell you nothing at all. Diversity of control, not volume of control, is what fixes what your qubits are. The residual uncertainty is proportional to your measurement tolerance, with a constant we derive exactly and show how to compute in advance, so an experimenter can screen candidate operation pairs and pick a strong one (random pairs are typically several times worse, occasionally catastrophically so). (3) THE ALIASING LIMIT: CERTIFICATION CAN PASS WHILE TELLING YOU NOTHING. If you sample your certification data at special "resonant" times (set by the operations' energy scales), a maximally wrong assignment of subsystems passes the test perfectly. What your qubits are depends on when you looked. We characterize these blind spots exactly (for qubits they are universal and computable in advance; the danger windows shrink with the square root of your tolerance), and the fix costs almost nothing: sample at two different times, at least one away from the resonant set. With that, certification is restored; we prove it exactly and measure it. (4) REAL-LAB BUDGETS. We work out what certification costs in actual measurement shots (the error falls off unusually fast, inversely with the total number of shots rather than with its square root), how hardware noise floors the procedure, and how a simple reference measurement removes that floor to first order. A single seven-row table in the paper is effectively a lab protocol: it shows, condition by condition, which kinds of experimental access identify the subsystem structure (two generic operations: yes; one operation, commuting operations, resonant sampling: no). WHY IT MATTERS. For quantum hardware: this is a concrete recipe for certifying that the qubits you think you have are the qubits you physically have, with explicit tolerances, a sampling-time warning that is a real failure mode on calibrated hardware, and shot budgets. For foundations: the contested question "does physics determine its own subsystems?" gets a quantitative operational answer. Physics determines an operational subsystem CLASS (not one preferred coordinate representation of it), and that class is fixed by two operations sampled at two times, and by nothing less that we tested. WHAT IT OPENS UP. The seven-row identifiability table is a blueprint for a tabletop experiment on any small quantum platform; running it on hardware would move this from simulation to laboratory fact. On the theory side the paper leaves sharply posed open problems: the exact global constants when the two parts differ in size, the number-theoretic structure of long-time sampling (the failure times form a small-divisor hierarchy), and the extension from two parts to many. METHODS NOTE, BECAUSE IT MATTERS FOR TRUST. Every quantitative claim was pre-registered in the companion scripts before its run. The full ledger, including predictions that failed and one published-in-note constant that our own later theory overturned, is an appendix of the paper. All code, data, and working notes are in the deposit, seeded for exact reproduction. WHO AND HOW. A human-AI collaboration: research direction and standards of evidence by Ryan Cardwell (Crystalline Labs); design, code, derivations, and drafting by Claude (Anthropic), including autonomous sessions under the program's pre-registration rules, with adversarial reviews by other AI models incorporated and credited.
Every tool of quantum computing is one of three moves on two sliding rings marked with the sixty last digits of the Fibonacci numbers. A setting is a value read off one placement of the rings. A fold is a product turned into a sum by the half-angle law. A turn is a shift of position that carries a digit with it. Every gate is a setting, its entries cos(θ/2) and sin(θ/2) the half-distances of the rings at crossing separation θ, and the Hadamard, CZ and CNOT are quarter and half turns. Born's rule is the fold, amplitudes read at position k and expectation values at 2k. Every gradient is a quarter turn, because the parameter-shift rule is the ring's derivative law, its two shifts the ×7 and ×3 laws, with four eighth turns where a Givens gate needs them. A complete variational run is worked on a two-qubit number-conserving Hamiltonian. The energy is the ring shifted ten positions, the ground state the vesica setting at position 20, the optimizer three readings and a gnomon with nothing to tune, its convergence one line. Noise is the radius of the rings, and the square inside the ring, the stabilizer octahedron, says when the noise has cost a magic state. Phase estimation, Shor's classical end, Grover's search, Trotter chains, QAOA, Bell tests, teleportation, error mitigation, benchmarking and the [[4,2,2]] and [[5,1,3]] codes each reduce to the same three moves, forty tools on one page, and because every unitary is a finite product of rotation gates, the list is open and the three moves are closed. A checksum rides every classical number of the loop, the digits under the crossings on each setting, the addition law on each sum, the quarter-turn law on each gradient, the symmetry identity ⟨XX⟩ = ⟨YY⟩ on the measured data with its alarm threshold read off the setting, every one-, two- and three-bit upset of a 32-bit phase word and every burst of up to fifteen bits caught by three rings in lockstep, every corruption of any kind caught by the ladder, and the decoder table of the perfect code built on the four quarter turns of the net, any four simultaneous faults in an entry restored. The guard stands on every classical register of the loop, and the code space stands on the qubits. Thirty-one jobs on three IBM machines close the paper. A clean run on a 156-qubit machine had every compiled angle certified, the injected bit flip flagged at over a hundred standard errors, the clean checksum inside its line, the radius reading the noise, and the Bell value above 2, and one bit flipped in a phase word before submission, four ways, caught by the guard every time, turning the ground state into the top of its number sector and, from the entangler word, into the top of the whole spectrum when sent unguarded. The same words were corrupted up to all ten at once, by any change up to every bit inverted, and read both ways in four runs, unguarded and through the guard, and every setting word of a many-qubit tower was corrupted past any real error rate, caught and rebuilt in place, and read right on the machine. Every number is verified by the script in the appendix on explicit matrices and states, and the hardware readings are checked against the result files.
Quantum mechanics does two things with a two-level system. It turns it, and it entangles it. Both live on the two-ring instrument. Dynamics first. The Schrödinger equation for any two-level Hamiltonian is precession. The Bloch vector rotates about the axis of the energy splitting at the rate the splitting sets, so time evolution on the rings is the setting moving, certified at every instant. Larmor precession is the pure turn at γB, 42.577 million turns a second for a proton in one tesla. The Rabi oscillation is the energy lever swept in time, the ground and excited shares cos² and sin² of one accumulated setting. The Ramsey fringe is two settings and a fold, the most precise frequency measurement in physics read as d/2. The spin echo is the half turn against drift. Entanglement second. For any pure two-qubit state the two qubits' rings carry the same radius, and that radius is set by the concurrence, r = √(1 − C²), full radius for a product state and zero for a Bell pair. Entanglement is two rings forced to share one radius. Generating it is the energy-sloshing lever of the companion papers read between rings. Under the exchange interaction the concurrence grows as sin Ωt while both radii shrink as cos Ωt, and the pair is a Bell state at the quarter period, when both radii vanish. The second part is then made into instruments. The entanglement monitor reads the concurrence of a running experiment from one qubit's statistics, one measurement setting for the exchange family and three for any pure state, against nine for tomography. The certified entanglement clock reads the slosh tick by tick, the calibration, the diagnostics and the ledger of an entangling gate. And the classical line is drawn where correlation stops being classical. The radius is blind on the whole Werner family, and the witness |⟨XX⟩| + |⟨YY⟩| + |⟨ZZ⟩| = 1, the fold read beside the correlation in the pair's own frame, draws the line the radius cannot. The same identity passed a real machine's clean run at 1.01 standard errors and flagged an injected fault at 112. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
The Topological Basis Realization for Six Qubits and the Corresponding Heisenberg Spin − 1 2 −21 Chain Model