Published October 18, 2026 | Version v1

The gross code's syndrome circuit has circuit-level distance 10: an exhaustive lower bound

Authors/Creators

Description

This deposit shows that the syndrome-measurement circuit of Bravyi et al. for the [[144,12,12]] gross code has circuit-level distance 10 in both memory bases, for 12 noisy syndrome cycles followed by 2 noiseless ones. No set of 9 or fewer faults goes undetected while flipping a logical qubit, and 10 faults suffice.

Bravyi et al. (arXiv:2308.07915) proved the upper bound 10 and conjectured that it is the true value. Cross, He, Rall and Yoder (arXiv:2407.18393) gave numerical evidence for 10. We found no earlier exhaustive proof of the lower bound.

The same value 10 holds for the CZ-compiled version of the circuit in the Tesseract decoder's test files (quantumlib/tesseract-decoder, arXiv:2503.10988). For both versions of the [[108,8,10]] circuit the distance is 8. The values 6 and 8 for the [[72,12,6]] and [[90,8,10]] circuits, found earlier by MaxSAT, are reproduced as controls.

Method: an exhaustive branch-and-bound search, made small by three reductions that preserve the distance (projection onto one fault type, anchoring by lattice translations, anchoring by time shifts). Two separately written programs, one in Python and one in C, ran it. The hypotheses of the reductions are checked by computer on every input before each search. All witnesses replay in a fault simulation. There is no machine-checkable certificate, so this is a search-based result; LIMITATIONS.md lists what a reviewer should check.

Contents: a short technical note (PDF and LaTeX source), the circuit files, both programs, the DEM builders, all witnesses and run logs, and verify.sh. "verify.sh light" rebuilds every DEM, replays the witnesses and reruns all the smaller cases in about 15-30 minutes on one idle core. "verify.sh full" also reruns the eight gross-code searches (about 2.5-4 hours).

The general lower bound of Strikis, Browne and Beverland (arXiv:2603.05481, Proposition 3) applies to this circuit but gives only 8 for the gross code and 6 for [[108,8,10]], so the values here do not follow from it.

Credits: S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall and T. J. Yoder for the circuit, the fault model and the conjecture; L. A. Beni, O. Higgott and N. Shutty and the tesseract-decoder project for the circuit files (Apache 2.0) and the control values; M. Webster, A. Jacob and O. Higgott for earlier detector-type filtering of the DEM.

The computations and programs were produced by AI agents (Claude, Anthropic) under the author's direction, with checks in separate agent sessions and hostile reviews by Claude and ChatGPT.

License: code MIT; text and data CC BY 4.0; the Tesseract circuit files Apache 2.0.

Files

circuit_distance_gross.pdf

Files (1.0 MB)

Name Size
md5:9e207254b33a32ad7f690686c13cd5b6
231.0 kB Preview Download
md5:9b7a6c440b6d023d83abe156adaef83b
802.9 kB Preview Download

Additional details