This isn't quantum buzzword soup. Falsify it.
Circuit is a quantum-inspired additive synth: an N-qubit state vector evolved by the same gate alphabet you'd find in Nielsen & Chuang §4.2, with each basis amplitude voicing its own partial. The thirty-two rows below recompute, on your CPU, the laws those gates obey — Hadamard / Pauli / CNOT involutions, Grover's 1996 closed-form amplitude, the M-generalized multi-marked extension, the Bennett 1993 teleportation fidelity, the Daley 2014 bit-flip channel superoperator, the Shor 1995 / NC §10.2 3-qubit repetition code corrected fidelity, the Aaronson-Gottesman 2004 stabilizer tableau, the C.8 cleanness-lattice 5-row battery operationalizing the Grover recurrence ladder + off-peak leakage shape, the C.9 algorithm-gateway pair pinning Coppersmith 1994 QFT unitarity + Kitaev 1995 phase-estimation deterministic recovery, the C.10 Hamiltonian-engine pair pinning Lloyd 1996 Lie-Trotter / Suzuki 1990 product-formula scaling and the transverse-field Ising commutator-norm closed form, and the C.11 Sessions A + B + C + D QEC code library — three QEC codes, one from each major family, plus the cross-code logical-qubit observable that reads off the encoded payload from each — pinning the Shor 1995 / NC §10.3 Box 10.3 9-qubit CONCATENATED code (the first quantum error-correcting code that corrects any single-qubit Pauli error at substrate-ULP via the distance-3 [[9, 1, 3]] property), the Steane 1996 / NC §10.4.3 7-qubit [[7, 1, 3]] self-dual CSS code (the second multi-error-correcting code, admitting transversal application of every single-qubit Clifford gate via the self-dual CSS structure), the Fowler 2012 / Kitaev 2003 rotated distance-3 TOPOLOGICAL surface code on 9 data qubits (8 plaquette stabilizers on a 2-D rotated lattice with logical-operator distance d = 3 — the entry point for large-scale fault-tolerant quantum computation), and the Nielsen-Chuang §10.5 / Knill 2005 cross-code logical-Z / logical-X observable that reads back the encoded payload at unit fidelity across all three codes (the C.11 closer / C.12 enabler — the cross-engine joint observable the Phase III bridge needs to read a logical-qubit payload off the Circuit-side encoded state), and the C.12 Phase III bridge — the Stinespring 1955 dilation cross-pin (DOI 10.1090/S0002-9939-1955-0069403-4) on the typed JointObservable surface + entangleWithSharedRegister helper, pinning the Nielsen-Chuang §2.4.3 partial-trace identity, the no-signalling lemma, and the Daley 2014 / NC §8.3.4 bit-flip channel dilation to CNOT(anc → sys) — the substrate the C.13 Jaynes-Cummings cross-engine cavity QED preset rides through — and the C.13 first cross-engine algebraic milestone — the Jaynes-Cummings 1963 / Cummings 1965 Rabi-frequency ladder Ω_n = 2g·√(n+1) (DOI 10.1109/PROC.1963.1664) read off the C.12 joint-observable surface, with Wavefunction's pre-existing jaynesCummings.ts closed forms (vacuum-Rabi splitting, bipartite dressed-state integrator) IMPORTED verbatim so the two engines share a single canonical derivation — and the V1.5 open-system channels: amplitude damping (Nielsen-Chuang §8.3.1) and thermal relaxation (Lindblad 1976, DOI 10.1007/BF01608499), the first NON-UNITAL noise channels in the battery, pinning the (1−γ)^k excited-population decay and the n̄/(2n̄+1) thermal steady-state occupation — and the V1.5 Wave 2 larger-N lattice row, the first n=8 (N=256) Grover cleanness check, pinning the magic cardinality M=24 (k* = 2, closed-form peak prob ≈ 0.99978) — the cleanest large-cardinality chord, a cleanness point that cannot exist at n=6 where 24 marked states over-saturate the 64-state register — and the V1.5 Wave 3 amplitude-amplification row, pinning the Brassard-Høyer-Mosca-Tapp 2002 generalization (DOI 10.1090/conm/305/05215) that Grover 1996 is the A = H^⊗n special case of: the BHMT good-subspace closed form sin²((2k+1)·arcsin(√a)) reduces byte-for-byte to the shipped Grover probability, and the function-driven phase oracle is byte-identical to the precomputed diagonal-phase marked-set oracle (the substrate the deferred audible phase-oracle chord-morph builds on) — and the V1.5 Wave 4 Solovay-Kitaev gate-compilation row, pinning the Dawson-Nielsen 2006 universal Clifford+T decomposition (DOI 10.48550/arXiv.quant-ph/0505030) in pure SU(2) 2×2 matrix algebra (zero state vector): the recursion SK_n = V·W·V†·W†·SK_{n-1} contracts the worst-case approximation error as the cited 3/2 power ε_{n+1} ≤ c_approx·ε_n^(3/2), the balanced group-commutator decomposition reproduces the residual EXACTLY, and the compiled Clifford+T word reconstructs the target to its theoretical accuracy — and the V1.5 Wave 5 surface-code-scaling row, scaling the rotated surface code from d=3 to d=5 structurally (a 25-data-qubit patch is 225 amplitudes, far past the substrate cap, so no state vector is allocated): the cited Fowler 2012 / Kitaev 2003 d² − 1 = 24 stabiliser count (12 X + 12 Z) with anti-commute count = 0 EXACT, and the code distance d = 5 EXACT computed by CSS coset minimisation over the 4096-element X/Z stabiliser subgroups rather than a brute-force over all 250 Paulis — with a d=7 counts-only assessment to 48 generators — and the V1.5 Wave 6 Strand⊗Circuit braid row, the first cross-engine Strand⊗Circuit row, bridging the Braids instrument's combinatorial braid group to Circuit via a unitary representation: the Nayak 2008 §IV.B / Freedman-Kitaev-Larsen-Wang 2003 Fibonacci- anyon generators σ1 = R, σ2 = F·R·F on the 2-dimensional 3-anyon fusion space (one topological logical qubit) are genuinely unitary and satisfy the defining braid relation σ1σ2σ1 = σ2σ1σ2 EXACT — the B3representation certificate — so a braid word (Braids' canonical crossings) drives a Circuit logical qubit through apply1q as an honest invertible gate, with the cited R-symbol phases e−4πi/5 / e+3πi/5exactly the Yang-Baxter solution — and check them against external textbook anchors rather than against our own expectation. A proof that can't be shown to fail isn't one, so the tamper toggle below the rows lets you perturb one matrix entry per row and watch only that row turn red. Zero server calls; the only request the page issues is the static /worklets/circuit-engine.js bundle your browser already loaded for the instrument. Open DevTools → Network and check.
the thirty-two proof rows · each checked against a published anchor
- hadamard-involution‖H·H − I‖_F (Frobenius residual)· cite: Nielsen & Chuang §4.2 · doi:10.1017/CBO9780511976667
- pauli-involution‖X·X − I‖_F (Frobenius residual)· cite: Nielsen & Chuang §4.2 · doi:10.1017/CBO9780511976667
- cnot-involution‖CNOT·CNOT − I⊗I‖_F (Frobenius residual)· cite: Nielsen & Chuang §4.2 · doi:10.1017/CBO9780511976667
- grover-optimal-ksin(13·arcsin(1/8)) at n=6, w=42· cite: Grover STOC 1996 · doi:10.1145/237814.237866
- multi-marked-grover-closed-formsin(7·arcsin(√(3/64))) at n=6, M=3, W={0,4,7}· cite: Grover STOC 1996 §3 / NC §6.1.4 · doi:10.1145/237814.237866
- teleportation-fidelity-1993|⟨ψ_in|ψ_out at qubit 2⟩|² = 1 EXACT (Theorem 1)· cite: Bennett, Brassard, Crépeau, Jozsa, Peres, Wootters 1993 · doi:10.1103/PhysRevLett.70.1895
- bit-flip-channel-superoperatorleading linear-in-p coefficient: E[fidelity] = 1 − 1·p· cite: Daley 2014 / NC §8.3.4 · doi:10.1080/00018732.2014.933502
- bit-flip-repetition-codeleading p² coefficient: corrected fidelity = 1 − 3·p² + 2·p³· cite: Shor 1995 / NC §10.2 Eq. 10.7 · doi:10.1103/PhysRevA.52.R2493
- stabilizer-clifford-conjugationstructural identity: H · Z · H = X (row count) — 1 indicates the load-bearing rule matches Table I· cite: Aaronson & Gottesman 2004 Table I · doi:10.1103/PhysRevA.70.052328
- stabilizer-measurement-born-ruleBorn-rule anti-commuting-Pauli outcome probability = 0.5 EXACT· cite: Born 1926 / Aaronson-Gottesman 2004 §III Lemma 3 · doi:10.1103/PhysRevA.70.052328
- grover-dim7-k15-recurrence-closuresin²(31·arcsin(1/4)) at n=6, M=4, k=15 (the cited 'glassy' recurrence-closure)· cite: Grover STOC 1996 §3 / CircuitExploration §1 · doi:10.1145/237814.237866
- grover-whole-tone-hex-k2-closuresin²(5·arcsin(√(6/64))) at n=6, M=6, k*=2 (cited cleanest small-M rounding, distance 0.021)· cite: Grover STOC 1996 §3 / CircuitExploration §2 · doi:10.1145/237814.237866
- grover-cleanness-monotonicityargmax_M P_peak(M) over M ∈ {1..12} at n=6 = 6 (cited whole-tone hexachord)· cite: Grover STOC 1996 §3 / CircuitExploration §2 · doi:10.1145/237814.237866
- grover-recurrence-lattice-dim7groverClosedFormProb(6, 15, 4) — cited CircuitPurityDial 'glassy' anchor (k=15 near-closure on the dim7 cleanness ladder)· cite: Grover STOC 1996 §3 / CircuitExploration §1+§3.3 · doi:10.1145/237814.237866
- grover-off-peak-leakage-spectrumcos(7·arcsin(1/4))/√60 — cited per-index leakage amplitude at dim7 k=3 (the cited uniform spectral shape)· cite: Grover STOC 1996 §3 / CircuitExploration §3.4 · doi:10.1145/237814.237866
- qft-unitarity‖QFT_8† · QFT_8 − I‖_F (Frobenius residual at n=3, cited Vandermonde Plancherel)· cite: Coppersmith 1994 / Nielsen & Chuang §5.1 · doi:10.48550/arXiv.quant-ph/0201067
- phase-estimation-eigenvaluePr(measured estimator = m | φ = m/2^n) = 1 EXACT (n=4 estimator qubits)· cite: Kitaev 1995 / Nielsen & Chuang §5.2 Eq. 5.23 · doi:10.48550/arXiv.quant-ph/9511026
- trotter-suzuki-error-bound½·Δt²·‖[X, Z]‖_op = Δt² at Δt = 0.05 — cited Lloyd 1996 1st-order Lie-Trotter per-step bound· cite: Lloyd 1996 / Suzuki 1990 / Childs-Su 2019 · doi:10.1126/science.273.5278.1073
- transverse-field-ising-commutatorΣ_{j<k} ‖[T_j, T_k]‖_op = 12 EXACT at TFIM n=4, J=h=1, open chain — cited Pauli symplectic anticommute count· cite: Sachdev 2011 §1.2 / Aaronson-Gottesman 2004 Theorem 3 · doi:10.1103/PhysRevA.70.052328
- shor-nine-corrected-fidelityC(9, 2) = 36 EXACT (leading p² coefficient of the corrected ensemble fidelity under depolarizing noise — Shor 1995 / NC §10.3 Eq. 10.16)· cite: Shor 1995 / Nielsen & Chuang §10.3 Box 10.3 · doi:10.1103/PhysRevA.52.R2493
- steane-seven-transversal-cliffordC(7, 2) = 21 EXACT (leading p² coefficient of the corrected ensemble fidelity under depolarizing noise — Steane 1996 / NC §10.4.3 distance-3 [[7, 1, 3]] property)· cite: Steane 1996 / Nielsen & Chuang §10.4.3 Table 10.5 · doi:10.1098/rspa.1996.0136
- surface-code-d3-stabilizer-countd² − 1 = 8 EXACT (stabilizer generator count for the rotated distance-3 surface code on 9 data qubits — Fowler 2012 §II.A: 4 X-plaquettes + 4 Z-plaquettes)· cite: Fowler, Mariantoni, Martinis, Cleland 2012 / Kitaev 2003 · doi:10.1103/PhysRevA.86.032324
- cross-code-logical-observable⟨+_L|X_L|+_L⟩ = +1 EXACT across all 3 codes (Shor 9 / Steane 7 / surface-d3) — the cross-code logical-qubit X-basis +1 eigenvector identity, the C.12 enabler· cite: Nielsen & Chuang §10.5 / Knill 2005 · doi:10.1038/nature03350
- joint-observable-partial-tracemax |Tr(Z · ρ_sys) − (1 − 2p)| over Stinespring p ∈ {0.05, 0.2, 0.4} via shared clean GATE_CNOT (substrate-ULP module-load anchor)· cite: Stinespring 1955 / Nielsen & Chuang §2.4.3 + §8.2 · doi:10.1090/S0002-9939-1955-0069403-4
- joint-rabi-frequencyΩ_1 = 2·g·√(n+1) at (g=0.05, n=1) = 0.1·√2 ≈ 0.14142 — cited Cummings 1965 √(n+1) Rabi-frequency ladder at the single-Fock anchor (Wave C.13 first cross-engine algebraic milestone)· cite: Jaynes & Cummings 1963 / Cummings 1965 / Walls & Milburn §10 · doi:10.1109/PROC.1963.1664
- amplitude-damping-population-decayleading linear-in-γ coefficient: E[|amp₁|²] on |1⟩ = 1 − 1·γ (single step) → (1−γ)^k after k steps· cite: Nielsen & Chuang §8.3.1 / Daley 2014 · doi:10.1080/00018732.2014.933502
- thermal-relaxation-steady-statethermal steady-state excited population n̄/(2n̄+1) at n̄=0.5 = 0.25 (Lindblad detailed-balance fixed point)· cite: Lindblad 1976 / NC §8.3.1 · doi:10.1007/BF01608499
- grover-n8-magic-cardinalityargmax over the n=8 M-sweep of cleanest large-M peak prob = 24 (magic cardinality absent at n=6)· cite: Grover STOC 1996 §3 · doi:10.1145/237814.237866
- phase-oracle-amplitude-amplificationBHMT P_k = sin²((2k+1)·arcsin(√a)) at a=3/64, k=3 ≡ Grover triad peak ≈ 0.99790· cite: Brassard-Høyer-Mosca-Tapp 2002 · doi:10.1090/conm/305/05215
- solovay-kitaev-contractionempirical worst-case 3/2-contraction prefactor c_approx ≈ 1.74 in ε_{n+1} ≤ c_approx·ε_n^{3/2} at the depth-14 Clifford+T base net (Dawson-Nielsen 2006 accuracy contraction)· cite: Dawson & Nielsen 2006 / Kitaev 1997 / Nielsen & Chuang §4.5.3 · doi:10.48550/arXiv.quant-ph/0505030
- surface-code-d5-distancerotated distance-5 surface code: d² − 1 = 24 stabilisers (12 X + 12 Z), code distance d = 5 EXACT via CSS coset minimisation (structural-only — no 2^25 state vector)· cite: Fowler 2012 / Kitaev 2003 · doi:10.1103/PhysRevA.86.032324
- braid-fibonacci-yang-baxter‖σ₁σ₂σ₁ − σ₂σ₁σ₂‖_F — the Fibonacci-anyon Yang-Baxter residual (the B₃ representation certificate, ≈ 0 EXACT)· cite: Nayak 2008 §IV.B / Freedman-Kitaev-Larsen-Wang 2003 · doi:10.1103/RevModPhys.80.1083
tamper falsifiability — surgical, one row at a time
A proof page that can't fail isn't one. The radio below the rows perturbs one entry of the targeted row's load-bearing matrix (GATE_H[0,0], GATE_X[0,1], GATE_CNOT[2,2], the Grover loop's Hadamard, the C.8 cleanness-lattice's higher- entry H clones, a marked-set cardinality nudge, a mass- preserving state perturbation, the C.9 algorithm-gateway pair's QFT round-trip H or phase-estimation pipeline H, a local PauliGateBundle clone threading a perturbed GATE_X / GATE_Z through the Trotter step while the Taylor reference stays clean for the C.10 Hamiltonian-engine pair, or — for the C.11 Sessions A + B + C + D QEC code library — a local GATE_H[1,1] (entry 3) clone threaded through the Shor 9 encoder + decoder via the hGate parameter, a local GATE_H[0,1] (entry 1) clone threaded through the Steane 7 decoder's two transversal-Hadamard basis-change layers, a local GATE_H[1,0] (entry 2) clone threaded through the surface-d3 decoder's two transversal-Hadamard basis- change layers, or — for the cross-code logical-qubit observable closer — a local GATE_H[0,0] (entry 0) clone threaded through all three QEC decoders simultaneously via the hGate parameter, with the encoders left on the SHARED clean GATE_H singleton so the per-code Path A / B / C eigenvector anchors stay bundle-independent; or — for the C.12 Phase III bridge joint-observable row — a local GATE_CNOT[3,0] (entry 12) clone threaded through entangleWithSharedRegister's couplingUnitary parameter, breaking the Stinespring bit-flip dilation while Paths A / B (direct- amplitude entangled-state construction and shared-side Pauli sweeps, no CNOT involved) and Path C (Stinespring via the SHARED clean GATE_CNOT singleton) stay bundle-independent; or — for the C.13 first cross-engine algebraic milestone (joint Rabi-frequency row) — a local GATE_CNOT[3,1] (entry 13) clone threaded through the same couplingUnitary parameter on the Stinespring- analog absorption leg, breaking ⟨σ_z ⊗ I⟩ = 2p − 1 while Paths A (Cummings 1965 Rabi-frequency anchor) + B (n=0 doublet cross-pin) + C (bipartiteJCState via the C.12 surface yielding ⟨σ_z⟩ = −1 EXACT at the half-period) + Path D Leg 1 (multi-Fock pure-|↑,n⟩ aggregate, n ∈{0, 1, 2, 3}) stay bundle-independent — the four CNOT-tamper rows now span the full row-3 = "output |11⟩" band of the row-major CNOT matrix at entries{10, 11, 12, 13}) by a quantised ε — or, for the V1.5 Wave 2 larger-N lattice row (n=8 magic cardinality), a marked-set-push lever that grows the M=24 marked set 24 → 25 through the offline Grover loop (NOT a matrix entry — the Hadamard's four real entries are all claimed by earlier Grover-family rows) while the closed-form argmax / integrity / preset cross-pin legs stay green; or — for the V1.5 Wave 3 amplitude-amplification row (BHMT 2002) — a local GATE_H[0,1] (entry 1) clone threaded through the amplitude-amplification loop's diffuser, drifting only the LOAD-BEARING phase-oracle AA loop while the BHMT↔Grover prob cross-pin, optimal-k agreement, and phase-oracle ≡ diagonal- phase byte-identity legs stay green; or — for the V1.5 Wave 4 Solovay-Kitaev gate-compilation row (Dawson-Nielsen 2006) — a local GATE_S[1,1] (entry 3) clone (the FIRST row to tamper GATE_S, an honest lever since S is in the Clifford+T alphabet the base net is built from) threaded only through the compiled word's reconstruction, drifting the LOAD-BEARING ‖U − SK_3(U)‖ off its clean value while the base-net unitarity + covering radius, the group-commutator exactness, and the 3/2-power contraction profile (all computed on the clean net) stay green; or — for the V1.5 Wave 5 surface-code-scaling row (distance-5 rotated surface code) — a STRUCTURAL lever rather than a matrix entry: perturbGeneratorMask flips one plaquette support bit of one X-type stabiliser generator on a fresh clone of the d=5 generator set, breaking abelianness so the runtime symplectic anti-commute count jumps above 0 while the stabiliser-count, CSS coset-min distance, and d=7 counts legs (all computed on the clean generators) stay green — a documented discipline fork, since a pure-combinatorics row has no state-vector amplitude to perturb; or — for the V1.5 Wave 6 Strand⊗Circuit braid row (Fibonacci-anyon Yang-Baxter) — a row-local Rτ-phase PARAMETER lever rather than a matrix entry: nudging the cited +3π/5 R-symbol phase keeps every braid generator unitary but breaks the hexagon consistency, so the runtime braid relation ‖σ1σ2σ1 − σ2σ1σ2‖F jumps from 0 EXACT to O(ε) while the generator-unitarity, clean Yang-Baxter certificate, and F²=I / cited-phase / apply1q round-trip legs (all rebuilt from cited constants) stay green — no shared GATE_* singleton touched, no GATE_* slot consumed. Exactly ONE row flips red; the other thirty-one stay green by construction — the tamper is cross-row independent (every row builds its own local perturbed gate via perturbGateRealEntry / perturbTwoQubitGateRealEntry, never mutating the shared GATE_H / GATE_CNOT singletons; the QEC-code-library codes share H-entry slots {0, 1, 2, 3}with earlier rows, the C.12 row uses CNOT- entry 12 (distinct from cnot-involution's entry 10 and bit-flip-repetition-code's entry 11), and each row's clone is a fresh Float64Array, so the cross-row independence is structural). The substrate-ULP cited anchor on each row is a STATIC closed-form residual (GATE_H_SQUARED_RESIDUAL, et al.) computed at module load; the tamper expresses itself in the live state-vector measurements, not the cited chip.
chord-morphing axis — musical, not falsifiable
The multi-marked row pins the M-generalized closed form for a static marked set: per-w amplitude matches sin((2k+1)·arcsin(√(M/N))) / √M at every step, peak at k* = ⌊π / (4·arcsin(√(M/N)))⌋. The C.3 instrument also exposes a chord-morph axis — press Won a chord preset to swap the active marked set mid-loop. That morph breaks the simple closed form (the formula assumes the marked set stays constant across all k iterations); it's a musical chord-progression knob, not a load-bearing claim about the math. The proof above pins the static-set case; the morph is an additional gesture on top.
measurement-based axis — stochastic outcomes, deterministic closed form
The teleportation row pins Bennett 1993 Theorem 1: |⟨ψ_in|ψ_out at qubit 2⟩|² = 1 EXACT for every input |ψ⟩ AND every classical-bit outcome (c₀, c₁). Each Space trigger on the teleportation preset produces a different random (c₀, c₁) pair via mid-circuit Z-measurements; Bob's classically-conditional X^c₁ · Z^c₀ corrections deterministically cancel the randomness. The fidelity is closed-form-1 in expectation AND per-trial — the proof row asserts it across multiple input states and multiple RNG seeds. The tamper perturbs the Bell-pair prep Hadamard; the corrections no longer exactly cancel, fidelity drifts.
noise-as-substrate axis — Monte Carlo single-trajectory, cited claims hold in expectation
The bit-flip channel and 3-qubit repetition code rows are stochastic: at each trial, one Pauli per qubit per noise op is sampled from the per-voice seeded RNG and applied to the pure state — the Daley 2014 stochastic wave function method (NC §8.3.4). A density-matrix simulation would balloon storage from 2ⁿ complex amplitudes to 4ⁿ real numbers, which the state-vector substrate doesn't support; instead the cited NC §8.3.4 superoperator action and the NC §10.2 Eq. 10.7 corrected fidelity 1 − 3p² + 2p³ hold in expectationover the seeded RNG ensemble. The proof rows assert empirical convergence within the Bernoulli 4σ standard-error band at N seeded trials per p, backed by a deterministic anchor leg (p=0 round trip / p=1 full-flip) at substrate-ULP tolerance — that's where the tamper expresses itself first. The V1.5 open-system rows extend this axis to the first NON-UNITAL channels: amplitude damping relaxes population toward |0⟩ (so on |+⟩ it drives ⟨Z⟩ to +γ, a signature no Pauli channel can produce) and thermal relaxation adds a bath raising channel that drives the qubit to the cited n̄/(2n̄+1) detailed-balance occupation — each backed by a deterministic σ⁻ / σ⁺ jump anchor at substrate-ULP where the tamper lands.
Falsifiable Proof
recomputed live in your browser · zero server calls
tamper · perturb one matrix entry, watch one row flip
instrument anchors
cleanness lattice
algorithm gateway
hamiltonian engine
qec code library
joint observable
cross-engine cavity qed
open-system channels
larger-n lattice
amplitude amplification
gate compilation
surface-code scaling
topological braiding
no perturbation — all 32 rows GREEN
honest scope
This is a simulation: a quantum-inspired additive synth, not a physical quantum device. The claim is narrow and exact — the shipped code reproduces the cited Nielsen-Chuang §4.2 involutions + Grover's 1996 closed-form amplitude to the printed substrate-ULP tolerances, and the lib ↔ worklet kernels stay byte-identical (verified at npm run test:circuit · gates.test.ts §6 + circuitParity.test.ts RMS-0 freeze gate). No claim is made about quantum supremacy, hardware, or anything a Nobel committee would care about. Every number above was computed by your CPU from the shipped modules; break any of it with the tamper toggle.