Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Sixteen Defect Labels on an Eight-Qubit Cell

David Elliman

Published May 26, 2026• 0 citations
Publisher

Abstract

Major revision, 19 October 2026. The extended Hamming code [8,4,4] has eight distinct nonzero single-bit syndromes. Taking its rows as both X and Z checks gives a stabilizer state with sixteen distinct single-site X- or Z-error labels. These labels can be put in correspondence with a generation-sized matter table, but that correspondence does not supply gauge representations, chirality, dynamics or statistics. We retain the parity-check matrix and make its syndrome table explicit. We correct the claimed zero-syndrome sterile corner, the identification of cube faces with its bipartition, and the inference of weak charge from a parity check. The proposed derivations of Standard Model matter, fermion statistics and mass from hopping are withdrawn. Changes from earlier versions: The revision removes Standard Model emergence, mass-as-hop, statistics and lattice-chirality claims. There is no zero-syndrome corner; Y errors supply eight additional single-site labels. The revision corrects cube-face/bipartition confusion, weak-charge inference and the physical interpretation of the one-versus-three Pauli identity. Retained result: Explicit parity-check matrix, eight nonzero syndromes and sixteen selected single-site X/Z defect labels. Previously titled: Sixteen Fermions from One Cube: The Standard Model Generation as Single-Defect Excitations of a Discrete [8,4,4] CSS Code on Q3. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.

DOI
10.5281/zenodo.20394561

Related papers

A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics

David Elliman

Major revision, 19 October 2026. This revision separates three objects previously conflated: a classical [8,4,4] code, its one-code CSS stabilizer state, and a nonlinear set of 48 allowed eight-bit register words. The register admits a 32+16 partition by one generation bit. A declared evolution preserves that partition if its operators commute with the corresponding parity. This elementary conservation statement is retained; it does not establish a concatenated quantum code, a noise threshold or topological protection. The channel-friction ansatz, golden-ratio fixed point and XOR bookkeeping are given their proper conditional scope. Claims of CKM predictions and a derived particle-mass mechanism are withdrawn, as is the claim that the legacy walk is native to the corrected geometry. Changes from earlier versions: The revision removes concatenated-code/topological-protection claims and CKM/mass predictions unsupported by the declared register and retired transport law. The revision separates 16 codewords, a one-dimensional CSS stabilizer space and 48 allowed register words; the latter has Hamming distance one. The revision corrects the geodesic/line-graph count. The revision states a real recovery criterion and the hypotheses of the commutation argument. Retained result: Classical code facts, the nonlinear register count, a conditional sector-conservation proposition and explicitly conditional scalar/graph identities. Previously titled: A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.

•May 1, 2026•0 citations

The Born Rule as a Closed Record Pair: Measurement, Objectivity, and the Arrow of Time in a Quantum-Error-Correcting Substrate

David Elliman

STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. NOTE ON SCOPE (18 October 2026). Where this paper says that the Standard Model's matter content, charges or gauge structure are derived from, forced by or emerge from the eight-bit error-correcting cell, read encoded in or assigned to. The finite results themselves stand: the code, its constraints and the anomaly arithmetic are exact. But two things are premises of the framework, not consequences: the identification of codewords with particles, and the choice of the eight-bit [8,4,4] cell. In particular, the step from read/write balance to a single CSS code is not derived [R22]. The author's October 2026 review of the programme concluded that the framework's Standard-Model content is assigned rather than derived. No observation currently distinguishes the framework's account from the Standard Model itself. This revised note argues that, within the accepted complex quantum-error-correcting record substrate, the quadratic Born form arises from linear record writing, orthogonality of record sectors, and isometric normalization before any probability measure is introduced. Conditional uniqueness is treated separately through Gleason-type and refinement-stable record-sector routes. The 30 August 2026 additivity-audit revision cites Jiaxuan Zhang's analysis of five Born-rule derivations (arXiv:2603.06211) and makes the premise accounting explicit: a Gleason frame function includes orthogonal additivity, while Marko Lela's route begins with a non-negative extensive valuation on disjoint continuation bundles. The closed-record-pair route assumes neither measure-level object, but establishes the quadratic form rather than a standalone uniqueness theorem. The resulting open frontier is to obtain both form and uniqueness without importing measure-level additivity. The paper also records the minimal [8,4,4] record cell and the bare monitored service rate alpha_0 = 1/137, while retaining the deeper reconstruction question as open.

•Jun 20, 2026•0 citations

Parity Strings and Exchange Algebra in a Finite Register Model

David Elliman

Major revision, 19 October 2026. A total ordering of tensor-product sites permits the standard Jordan-Wigner construction of anticommuting dressed operators. We retain the explicit exchange-sign calculation and the finite K_3 colour-label matrix identity, while separating both from particle statistics and colour confinement. An ordering-dependent parity string does not by itself select a physical fermionic algebra or local transport law. The earlier same-register product of orthogonal colour projectors is not a baryon creation operator, and the symmetric vector of a three-colour label space is not an SU(3) singlet. Fermionic matter remains an explicit premise in the later framework; the calculation is a conditional representation of exchange algebra, not a derivation of the spin-statistics connection. Changes from earlier versions: The revision withdraws derivation of baryon statistics, local fermion transport and colour confinement from XOR closure. The revision distinguishes Hermitian Majorana-like operators from nilpotent creation operators; a product of orthogonal same-register colour projectors is zero. A symmetric three-colour vector is not an SU(3) singlet; an anti-Hermitian square is not an energy argument. Retained result: Finite Jordan-Wigner anticommutation calculation and K3 matrix identities. Previously titled: Pauli Antisymmetry from F2 XOR-Closure: A Discrete-Geometric Derivation of Composite Baryon Statistics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.

•May 12, 2026•0 citations

Exact Syndrome Measurement Budgets for Quantum Erasure Correction: Stabilizer-Code Rank Profiles, Distance Bounds, and Linear-Time Surface-Code Check Selection

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.

•Oct 30, 2026•0 citations

Fano Geometry as a Unifying Language for Quantum Error Correction: Stabiliser Codes, Magic States, and Self-Testing from a Single Projective Plane

Ian Richard C Buckley

PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The Fano plane PG(2,2) — seven points, seven lines, three points per line — appears three times in quantum error correction: as the stabiliser geometry of the 3-qubit GHZ state, as the parity-check matrix of the 7-qubit Steane ⟦7,1,3⟧ code, and as the constraint graph of a device-independent self-testing protocol. We prove that these three appearances are facets of a single geometric object. The central result is a three-way identification: the non-trivial elements of the GHZ stabiliser group (Z₂)³\{0} are canonically bijective with the 7 points of PG(2,2) = GF(2)³\{0}, which are the columns of the [7,4,3] Hamming parity-check matrix. The 3-qubit GHZ stabiliser group generates the 7-qubit Steane code's parity-check matrix. We prove an orbit decomposition of 3-qubit phase space: PG(5,2)\PG(2,2) = ⊔_{L=0}^{6} O_L, seven orbits of eight phase-space points (one per Fano line), giving a new Clifford-invariant magic label {p_L} that refines Wigner negativity into seven independent channels. The Fano game — measuring the seven GHZ stabilisers — achieves quantum maximum w=1, classical bound w≤5/7, and self-testing robustness C=7/8. The value 7/8 = |PG(2,2)|/2³ is a Fano-geometric invariant. Three practical tools follow: a device-independent GHZ certification protocol, the orbit-label magic invariant for magic state distillation, and a hardware coupling specification for a Fano-structured quantum processor (6 of 7 Fano lines at full coupling, one at r≈0.18, matching the FMO efficiency η≈0.1825). Keywords: quantum error correction, Fano plane, Steane code, GHZ state, magic states, self-testing, Wigner function, orbit decomposition, stabiliser codes, device-independent, PSL(2,7), quantum computing

•Jun 4, 2026•0 citations

Experimental supplement: three-qubit, three-gate repetition-code noise tomography

Long Huang

Experimental supplement to arXiv:2611.08310, a companion manuscript on gate-optimal recovery designs (2026). This supplement specifies a concrete experiment for measuring the eleven-parameter small-angle coherent noise of a three-qubit register with three single-qubit Pauli gates, using a distance-three repetition code in both orientations. It gives the branch structure, the syndrome-to-Pauli look-up table for the three-gate design, the fixed sixteen-setting measurement table, shot and wall-clock budgets for three platform classes, a calibration and systematics checklist, an analysis pipeline, and a symptom-to-cause table. Two sections price the alternatives: a fixed recovery that does not resolve the syndrome saves a factor three in circuits and loses a factor five in precision floor, and a coherent unitary recovery keeps the circuit saving but replaces each single-qubit Pauli by a multi-controlled gate that every branch must compile. At three qubits no design in the scanned budget loses rank, so identifiability does not separate the gate counts; what depends on the working point is which three gates to use, not how many. The organising point is that the recovery gate count is a resource: three gates attain the lowest precision floor, the standard six-gate decoder is 22 times worse at a small-angle operating point and 2.3 times worse at the well-conditioned point of arXiv:2610.19779, and the ordering is stable over forty sampled working points while the size of the factor is not. The ordering survives when the look-up is compiled rather than measured, and the margin then widens from 5.6 to 7.7 in wall clock, because a compiled table charges every entry in every branch. A section added in version 1.5 asks whether that answer depends on the platform. A second device archetype -- a tunable coupler or iSWAP-style gate, whose always-on term is the exchange J(XX+YY)/2 -- carries one more parameter per bond, thirteen in all, and the two clusters are not nested: XX and YY commute, and ZZ is orthogonal to their plane. Enumerating all 64 design pairs at n=3 and all 3969 at n=5 gives the same gate budget for both archetypes, zero gates to reach full rank at n=3 and one at n=5; that count is a lower bound on the budget, not a recommended design, since the precision optimum is the three gates of the main text, where zero gates is 18 times worse at the median and 379 times worse at the certified point. At matched per-layer coherent infidelity the thirteen-parameter cluster is not worse (101.0 against 88.9 mrad on the local angles at 10^5 shots), and at the three-gate optimum the comparison widens (41.7 against 32.2 mrad). Choosing the wrong cluster is a bias, not a variance: the correct family leaves a residual of exactly zero, the wrong one leaves 0.4-0.6% in the fingerprint and moves the nine local angles by a quarter to a half, while its Cramer-Rao bound looks better. The decoded logical error cannot arbitrate at that bias level -- 200 random perturbations of the same total variation spread it over a factor 43 -- so the model family must be chosen by the residual. The same section closes with a composition law: a per-gate composition of Pauli probabilities is elementwise in the Walsh eigenvalues and therefore under-counts the coherent part of the depth-L noise by exactly L (measured slopes 1.98 for the generator against 0.99 for the per-gate rule). A closing section fixes the size of the gain and asks how far it extends. An exact prior removes 19.3% of the logical error at d=3, which is 4.3e-5 errors per code cycle; a three-gate fit captures 83, 96.5 and 99.5% of that share on the three platform classes. That share, not the accuracy of the estimate, is where every prior-based protocol stops, because 94% of the residual is weight-two aliasing. It is not a limit set by using Pauli probabilities: the same prior decodes both the coherent channel and its twirled version, so the drop from 19.3% to 11.6% under twirling prices the device rather than the estimate, and composing per-gate twirls changes at most two of the 256 decoder decisions. A generator rather than a channel is what additionally allows the coherent part to be inverted and the prior to be extrapolated to unmeasured working points. Carrying the same three-qubit fit to d=5 or d=7 obeys a closed form, G_d = G_3^((d+1)/4), so no extra precision is needed at larger distance: a 6.4 mrad rms on the eleven parameters moves the d=7 gain by 8.5%. What does not transport is the truncated part of the model---the 2(d-1)^2 three-body positions a d x d patch adds, none of which a chain fit covers---which costs 5% of the gain at d=5 and 10% at d=7; site-to-site spread costs another 3%. The law itself is a property of the decoder and applies to any prior, so this is a bound on what a three-qubit run can claim, not an advantage over Pauli-statistics protocols. Measuring at the target size instead of transporting avoids the truncation count but pays conditioning: a factor 68 from three to seven qubits. All numbers are model-level: no device data are reported, and the floors assume a calibration residual of 1e-3. Contents (v1.5): 1 What the experiment measures · 2 The three branches · 3 Syndrome decoding · 4 Settings and shot arithmetic · 5 Budget on three platforms · 6 Why the syndromes must be resolved · 7 What does and does not depend on the gate count · 8 Does the platform change the answer? · 9 How large the gain is, and how far it extends · 10 Calibration and systematics · 11 Analysis pipeline · 12 Diagnostics · 13 Checklist.

•Nov 6, 2026•3 citations
Major revision, 19 October 2026. The extended Hamming code [8,4,4] has eight distinct nonzero single-bit syndromes. Taking its rows as both X and Z checks gives a stabilizer state with sixteen distinct single-site X- or Z-error labels. These labels can be put in correspondence with a generation-sized matter table, but that correspondence does not supply gauge representations, chirality, dynamics or statistics. We retain the parity-check matrix and make its syndrome table explicit. We correct the claimed zero-syndrome sterile corner, the identification of cube faces with its bipartition, and the inference of weak charge from a parity check. The proposed derivations of Standard Model matter, fermion statistics and mass from hopping are withdrawn. Changes from earlier versions: The revision removes Standard Model emergence, mass-as-hop, statistics and lattice-chirality claims. There is no zero-syndrome corner; Y errors supply eight additional single-site labels. The revision corrects cube-face/bipartition confusion, weak-charge inference and the physical interpretation of the one-versus-three Pauli identity. Retained result: Explicit parity-check matrix, eight nonzero syndromes and sixteen selected single-site X/Z defect labels. Previously titled: Sixteen Fermions from One Cube: The Standard Model Generation as Single-Defect Excitations of a Discrete [8,4,4] CSS Code on Q3. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
Major revision, 19 October 2026. This revision separates three objects previously conflated: a classical [8,4,4] code, its one-code CSS stabilizer state, and a nonlinear set of 48 allowed eight-bit register words. The register admits a 32+16 partition by one generation bit. A declared evolution preserves that partition if its operators commute with the corresponding parity. This elementary conservation statement is retained; it does not establish a concatenated quantum code, a noise threshold or topological protection. The channel-friction ansatz, golden-ratio fixed point and XOR bookkeeping are given their proper conditional scope. Claims of CKM predictions and a derived particle-mass mechanism are withdrawn, as is the claim that the legacy walk is native to the corrected geometry. Changes from earlier versions: The revision removes concatenated-code/topological-protection claims and CKM/mass predictions unsupported by the declared register and retired transport law. The revision separates 16 codewords, a one-dimensional CSS stabilizer space and 48 allowed register words; the latter has Hamming distance one. The revision corrects the geodesic/line-graph count. The revision states a real recovery criterion and the hypotheses of the commutation argument. Retained result: Classical code facts, the nonlinear register count, a conditional sector-conservation proposition and explicitly conditional scalar/graph identities. Previously titled: A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
STATUS (18 October 2026). The physics programme that motivated this work was concluded in October 2026 and its claim of a unified derivation withdrawn. The results in this paper do not depend on that programme and stand as stated. NOTE ON SCOPE (18 October 2026). Where this paper says that the Standard Model's matter content, charges or gauge structure are derived from, forced by or emerge from the eight-bit error-correcting cell, read encoded in or assigned to. The finite results themselves stand: the code, its constraints and the anomaly arithmetic are exact. But two things are premises of the framework, not consequences: the identification of codewords with particles, and the choice of the eight-bit [8,4,4] cell. In particular, the step from read/write balance to a single CSS code is not derived [R22]. The author's October 2026 review of the programme concluded that the framework's Standard-Model content is assigned rather than derived. No observation currently distinguishes the framework's account from the Standard Model itself. This revised note argues that, within the accepted complex quantum-error-correcting record substrate, the quadratic Born form arises from linear record writing, orthogonality of record sectors, and isometric normalization before any probability measure is introduced. Conditional uniqueness is treated separately through Gleason-type and refinement-stable record-sector routes. The 30 August 2026 additivity-audit revision cites Jiaxuan Zhang's analysis of five Born-rule derivations (arXiv:2603.06211) and makes the premise accounting explicit: a Gleason frame function includes orthogonal additivity, while Marko Lela's route begins with a non-negative extensive valuation on disjoint continuation bundles. The closed-record-pair route assumes neither measure-level object, but establishes the quadratic form rather than a standalone uniqueness theorem. The resulting open frontier is to obtain both form and uniqueness without importing measure-level additivity. The paper also records the minimal [8,4,4] record cell and the bare monitored service rate alpha_0 = 1/137, while retaining the deeper reconstruction question as open.
Major revision, 19 October 2026. A total ordering of tensor-product sites permits the standard Jordan-Wigner construction of anticommuting dressed operators. We retain the explicit exchange-sign calculation and the finite K_3 colour-label matrix identity, while separating both from particle statistics and colour confinement. An ordering-dependent parity string does not by itself select a physical fermionic algebra or local transport law. The earlier same-register product of orthogonal colour projectors is not a baryon creation operator, and the symmetric vector of a three-colour label space is not an SU(3) singlet. Fermionic matter remains an explicit premise in the later framework; the calculation is a conditional representation of exchange algebra, not a derivation of the spin-statistics connection. Changes from earlier versions: The revision withdraws derivation of baryon statistics, local fermion transport and colour confinement from XOR closure. The revision distinguishes Hermitian Majorana-like operators from nilpotent creation operators; a product of orthogonal same-register colour projectors is zero. A symmetric three-colour vector is not an SU(3) singlet; an anti-Hermitian square is not an energy argument. Retained result: Finite Jordan-Wigner anticommutation calculation and K3 matrix identities. Previously titled: Pauli Antisymmetry from F2 XOR-Closure: A Discrete-Geometric Derivation of Composite Baryon Statistics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The Fano plane PG(2,2) — seven points, seven lines, three points per line — appears three times in quantum error correction: as the stabiliser geometry of the 3-qubit GHZ state, as the parity-check matrix of the 7-qubit Steane ⟦7,1,3⟧ code, and as the constraint graph of a device-independent self-testing protocol. We prove that these three appearances are facets of a single geometric object. The central result is a three-way identification: the non-trivial elements of the GHZ stabiliser group (Z₂)³\{0} are canonically bijective with the 7 points of PG(2,2) = GF(2)³\{0}, which are the columns of the [7,4,3] Hamming parity-check matrix. The 3-qubit GHZ stabiliser group generates the 7-qubit Steane code's parity-check matrix. We prove an orbit decomposition of 3-qubit phase space: PG(5,2)\PG(2,2) = ⊔_{L=0}^{6} O_L, seven orbits of eight phase-space points (one per Fano line), giving a new Clifford-invariant magic label {p_L} that refines Wigner negativity into seven independent channels. The Fano game — measuring the seven GHZ stabilisers — achieves quantum maximum w=1, classical bound w≤5/7, and self-testing robustness C=7/8. The value 7/8 = |PG(2,2)|/2³ is a Fano-geometric invariant. Three practical tools follow: a device-independent GHZ certification protocol, the orbit-label magic invariant for magic state distillation, and a hardware coupling specification for a Fano-structured quantum processor (6 of 7 Fano lines at full coupling, one at r≈0.18, matching the FMO efficiency η≈0.1825). Keywords: quantum error correction, Fano plane, Steane code, GHZ state, magic states, self-testing, Wigner function, orbit decomposition, stabiliser codes, device-independent, PSL(2,7), quantum computing
Experimental supplement to arXiv:2611.08310, a companion manuscript on gate-optimal recovery designs (2026). This supplement specifies a concrete experiment for measuring the eleven-parameter small-angle coherent noise of a three-qubit register with three single-qubit Pauli gates, using a distance-three repetition code in both orientations. It gives the branch structure, the syndrome-to-Pauli look-up table for the three-gate design, the fixed sixteen-setting measurement table, shot and wall-clock budgets for three platform classes, a calibration and systematics checklist, an analysis pipeline, and a symptom-to-cause table. Two sections price the alternatives: a fixed recovery that does not resolve the syndrome saves a factor three in circuits and loses a factor five in precision floor, and a coherent unitary recovery keeps the circuit saving but replaces each single-qubit Pauli by a multi-controlled gate that every branch must compile. At three qubits no design in the scanned budget loses rank, so identifiability does not separate the gate counts; what depends on the working point is which three gates to use, not how many. The organising point is that the recovery gate count is a resource: three gates attain the lowest precision floor, the standard six-gate decoder is 22 times worse at a small-angle operating point and 2.3 times worse at the well-conditioned point of arXiv:2610.19779, and the ordering is stable over forty sampled working points while the size of the factor is not. The ordering survives when the look-up is compiled rather than measured, and the margin then widens from 5.6 to 7.7 in wall clock, because a compiled table charges every entry in every branch. A section added in version 1.5 asks whether that answer depends on the platform. A second device archetype -- a tunable coupler or iSWAP-style gate, whose always-on term is the exchange J(XX+YY)/2 -- carries one more parameter per bond, thirteen in all, and the two clusters are not nested: XX and YY commute, and ZZ is orthogonal to their plane. Enumerating all 64 design pairs at n=3 and all 3969 at n=5 gives the same gate budget for both archetypes, zero gates to reach full rank at n=3 and one at n=5; that count is a lower bound on the budget, not a recommended design, since the precision optimum is the three gates of the main text, where zero gates is 18 times worse at the median and 379 times worse at the certified point. At matched per-layer coherent infidelity the thirteen-parameter cluster is not worse (101.0 against 88.9 mrad on the local angles at 10^5 shots), and at the three-gate optimum the comparison widens (41.7 against 32.2 mrad). Choosing the wrong cluster is a bias, not a variance: the correct family leaves a residual of exactly zero, the wrong one leaves 0.4-0.6% in the fingerprint and moves the nine local angles by a quarter to a half, while its Cramer-Rao bound looks better. The decoded logical error cannot arbitrate at that bias level -- 200 random perturbations of the same total variation spread it over a factor 43 -- so the model family must be chosen by the residual. The same section closes with a composition law: a per-gate composition of Pauli probabilities is elementwise in the Walsh eigenvalues and therefore under-counts the coherent part of the depth-L noise by exactly L (measured slopes 1.98 for the generator against 0.99 for the per-gate rule). A closing section fixes the size of the gain and asks how far it extends. An exact prior removes 19.3% of the logical error at d=3, which is 4.3e-5 errors per code cycle; a three-gate fit captures 83, 96.5 and 99.5% of that share on the three platform classes. That share, not the accuracy of the estimate, is where every prior-based protocol stops, because 94% of the residual is weight-two aliasing. It is not a limit set by using Pauli probabilities: the same prior decodes both the coherent channel and its twirled version, so the drop from 19.3% to 11.6% under twirling prices the device rather than the estimate, and composing per-gate twirls changes at most two of the 256 decoder decisions. A generator rather than a channel is what additionally allows the coherent part to be inverted and the prior to be extrapolated to unmeasured working points. Carrying the same three-qubit fit to d=5 or d=7 obeys a closed form, G_d = G_3^((d+1)/4), so no extra precision is needed at larger distance: a 6.4 mrad rms on the eleven parameters moves the d=7 gain by 8.5%. What does not transport is the truncated part of the model---the 2(d-1)^2 three-body positions a d x d patch adds, none of which a chain fit covers---which costs 5% of the gain at d=5 and 10% at d=7; site-to-site spread costs another 3%. The law itself is a property of the decoder and applies to any prior, so this is a bound on what a three-qubit run can claim, not an advantage over Pauli-statistics protocols. Measuring at the target size instead of transporting avoids the truncation count but pays conditioning: a factor 68 from three to seven qubits. All numbers are model-level: no device data are reported, and the floors assume a calibration residual of 1e-3. Contents (v1.5): 1 What the experiment measures · 2 The three branches · 3 Syndrome decoding · 4 Settings and shot arithmetic · 5 Budget on three platforms · 6 Why the syndromes must be resolved · 7 What does and does not depend on the gate count · 8 Does the platform change the answer? · 9 How large the gain is, and how far it extends · 10 Calibration and systematics · 11 Analysis pipeline · 12 Diagnostics · 13 Checklist.