We give an explicit pure ((7,2,4))_4 quantum code (equivalently an additive [[7,1/2,4]]_4 stabilizer code): a binary graph state on 14 physical qubits grouped into seven ququarts, with one reference qubit. Exact binary cut-rank computations show that every error supported on at most three ququarts is detected; an explicit weight-four Pauli operator shows the distance is exactly four. Every code of distance at least four that contains the first codeword has dimension at most two, and hence equals the displayed code. Conditional on the published exclusion of stabilizer [[7,1,4]]_4 codes (Ball–Moreno–Simoens, arXiv:2401.06618), dimension two is the largest additive dimension at these parameters. Nothing is claimed about codes not containing the displayed codeword, other than the additive case. Status: not peer reviewed. The author has reviewed the mathematics personally; no independent review by another party has been carried out. Initial searches of the literature did not turn up this code (standard tables list integer k, so a K=2 code would not appear in them); more extensive checks are being carried out. Priority and novelty are pending verification and are not claimed. Files: note (PDF and TeX), graph file, verification script (python3 pure_7_2_4_4_code_verify.py pure_7_2_4_4_code_graph.json), README.
We give an explicit pure ((7,2,4))_4 quantum code (equivalently an additive [[7,1/2,4]]_4 stabilizer code): a binary graph state on 14 physical qubits grouped into seven ququarts, with one reference qubit. Exact binary cut-rank computations show that every error supported on at most three ququarts is detected; an explicit weight-four Pauli operator shows the distance is exactly four. Every code of distance at least four that contains the first codeword has dimension at most two, and hence equals the displayed code. Conditional on the published exclusion of stabilizer [[7,1,4]]_4 codes (Ball–Moreno–Simoens, arXiv:2401.06618), dimension two is the largest additive dimension at these parameters. Nothing is claimed about codes not containing the displayed codeword, other than the additive case. Status: not peer reviewed. The author has reviewed the mathematics personally; no independent review by another party has been carried out. Initial searches of the literature did not turn up this code (standard tables list integer k, so a K=2 code would not appear in them); more extensive checks are being carried out. Priority and novelty are pending verification and are not claimed. Files: note (PDF and TeX), graph file, verification script (python3 pure_7_2_4_4_code_verify.py pure_7_2_4_4_code_graph.json), README.
We prove that no binary qubit stabilizer code with parameters [[14,3,d>=5]] exists, settling the remaining distance gap for stabilizer codes encoding three qubits into fourteen. The proof first applies a signed affine-shadow inequality and an integrality congruence to restrict low-weight stabilizer words. Exact split-shadow infeasibility certificates then exclude weight-two words and all configurations with three weight-four checks, leaving a unique weight-four check. That check yields a ten-coordinate binary-additive code of size 1,024, minimum distance at least five, and symplectic hull dimension four. We reconstruct all 37 relevant equivalence classes by exhaustive lengthening: 25 have the wrong hull dimension, and the other twelve violate a necessary 64-coset capacity bound. Together with the known [[14,3,4]] construction, this proves d_max(14,3)=4 for binary stabilizer codes.
Computing the distance of a stabilizer code is NP-hard, yet certifying the distance of a given code needs no search at all — only two one-sided certificates that meet. An upper bound is a single explicit logical operator: one vector, checked in milliseconds against the actual check matrix — it commutes with every stabilizer, it is provably outside their span, and it acts on exactly w qubits. A lower bound is a universal statement — no logical operator lives below weight w — discharged by a finite scan whose completeness is itself a theorem, not a convention: a reconstruction lemma proves that every light Pauli vector appears in the scanned list, so the scan quantifies over the whole space rather than over a table someone chose. When the two certificates touch, the distance is exact, and the receipt can be replayed by a referee who trusts neither the authors nor their software. We build this bracket calculus over the binary symplectic carrier, close it exactly on the classical menagerie — the five-qubit perfect code, Steane, Shor, the distance-three rotated surface code, and the 3 × 3 toric code — and report an instructive refutation: our own frozen reference data claimed distance at least 2 for a punctured code fragment, and the certificate layer produced an explicit weight-one logical operator. Puncturing buys a logical qubit and leaves it bare; the count and the distance are independent shadows of the same subgroup lattice. The same prover-proposes/kernel-disposes architecture certifies logical counts at bivariate-bicycle scale (k = 12 at n = 144) from change-of-basis rank certificates checked in linear time, and every number in the system wears a two-valued trust badge whose semantics is an event, not a citation: no kernel run on your instance, no badge. The results are proved in a machine-checked formal kernel. Published by The Institute for Applied Ontological Mathematics.
The Pauli-ball discrepancy, a quadratic discrepancy summed over all error radii, measures how uniformly the Pauli error images of a K-dimensional quantum code cover the d-dimensional Hilbert space. At parameters attaining equality in the quantum Singleton bound with minimum code distance ≥3, or in the one-error Hamming bound with prime-power local dimension, the discrepancy of every projector of the prescribed rank equals an explicit benchmark plus an exact nonnegative remainder, which vanishes precisely for pure quantum maximum-distance-separable codes and nondegenerate perfect codes, respectively. For a Pauli ball of radius e below half the target distance and size Ve, this remainder linearly bounds the squared Hilbert--Schmidt distance of the error-image Gram matrix from the identity. When KVe≤d, it linearly bounds the diamond error and entanglement infidelity of a noise-independent polar recovery under any noise in that ball's span. For five qubits, we obtain the sharp rank-two Gram constant and exact logical channels of rotated codes attaining this linear order in diamond error. For pure states, the discrepancy equals a pure-state benchmark plus a positive weighted sum of marginal-purity defects, so absolutely maximally entangled states, when they exist, are exactly the minimizers.
We prove, with computer assistance, that the optimal minimum distance of abinary stabilizer code on 14 qubits encoding 3 logical qubits is 4.Equivalently, no binary quantum stabilizer code with parameters$\code{14,3,5}$ exists, including degenerate codes. In the binary symplecticmodel, this is equivalent to the nonexistence of an 11-dimensional isotropicsubspace $C\subseteq\F_2^{28}$ satisfying$\min\{\wt(v):v\in C^{\perps}\setminus C\}\ge 5$.The argument separates the two cases determined by the parity of thestabilizer weights. MacWilliams identities and integrality eliminate theall-even case. In the odd case, the shadow enumerator of Rains is combined withtwo averages over the 135 self-dual extensions of the code: one for theirweight enumerators and one for their shadows. An incidence computation inan eight-dimensional orthogonal geometry of plus type then forces threelow-weight stabilizer profiles. Integrality and a collision count amongweight-three shadow words eliminate these profiles. All parameter-specificcalculations are finite and exact, and reproducible source code accompanies the paper.The nonexistence theorem is additionally formalized and machine-checked inLean~4 over mathlib, with an axiom audit reporting only standard foundationalprinciples.
The codeword-stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [see A. Cross et al., e-print arXiv:0708.1021], but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimensions) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ substantially from the binary case, even for prime dimensions. In particular, we identify specific structure patterns of stabilizer groups, based on which efficient constructions might be possible for codes that encode more dimensions than any stabilizer codes of the same length and distance; similar methods cannot be applied in the binary case. Understanding of these structural properties can help prune the search space and facilitate the identification of good nonbinary CWS codes.
Computing the minimum distance of a quantum LDPC code is easy in one direction and expensive in the other: exhibiting a light logical operator is a search, while proving that no lighter one exists is what actually decides the parameter. This note proves an orbit reduction for the second half. If a group of code automorphisms acts on the qubits with r orbits, the minimum distance is the smallest of r restricted problems, one per orbit representative, so the number of solver calls is the number of orbits and not one. We give the a priori condition under which restricting to a single qubit is legitimate, namely transitivity on all qubits, and a counterexample showing what happens without it: on a hypergraph product code with n = 27 and d = 3, the widely used tool dist-m4ri prints a pair of equal bounds, which its own documentation calls a confirmed exact distance, and that value is 6. The reduction is coupled to a proof producing pipeline in which every nonexistence claim is re-verified by an independent checker, drat-trim or, for the largest closure, cake_lpr, whose soundness is proved inside CakeML. This closes with replayable certificates the distances of the five smaller bivariate bicycle codes of Bravyi et al., up to and including the code with n = 288 and d = 18, whose exactness was published with no replayable artifact and is established here at both ends. For the two larger codes it yields the first lower bounds a third party can re-check from the deposited files: d at least 18 for the code with n = 360, against a published upper bound of 24 and against d at least 11 for the best previously re-executable method, and a first lower bound of any kind for the code with n = 756. A separate and much cheaper ingredient, a sweep over logical operators supported on unions of cosets of a subgroup, tightens two upper bounds printed in a recent table of two block group algebra codes. The code printed there as [[140, 8, at most 16]] carries a logical operator of weight 14; the code printed as [[144, 10, at most 16]] has distance exactly 12, established at both ends and so closed four below the published bound. Both witnesses are re-checked outside any solver by two rank computations over the field with two elements, so neither of these two upper bounds rests on a solver at all. Both entries are printed with the inequality sign in that reference, which states no method for the tables they sit in; nothing it proves is contradicted here, and no error of its authors is corrected. What is improved are two bounds they offered as bounds. Finally we show that the two instance form of the reduction is a consequence of commutativity and not of the two block structure. On two block group algebra codes over non-abelian groups, taken from the published catalogue, the translation subgroup has two orbits for one code and twelve for another, so the number of solver calls has to be computed from the group before any search rather than assumed. On three such codes we certify the minimum distance. The argument that makes one orientation enough in the abelian case does not apply there, and we check that it does not, so both orientations are certified separately rather than assumed equal; on these three codes the two turn out to coincide, which is a measured fact about each code and not a consequence of that argument. The published values for these codes come from randomised search, and a certificate of nonexistence a reader can replay is, to our knowledge, new for non-abelian codes of this family. What this work does not claim is stated explicitly in the note: the restriction itself is not our idea, it is an option of dist-m4ri present since 2020; a machine checkable chain covering a symmetry breaking step is not a first; our proofs are checked by an independent checker and not by the kernel of a proof assistant; and the encoding step is not formally verified. A public question asking whether the orbit reduction is already in the literature was posted on MathOverflow on 28 August 2026 and carried no answer at the time of deposit. Every table of numbers in the note is generated from the deposited artifacts by a script that refuses to emit a row it cannot source. 27 pages. Verification scripts and certificate digests included as separate archives. MSC 2020: 81P73, 94B05, 68Q25, 20C05.