Certifying quantum code and circuit distances at scale
quant-ph
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 73 pages (18 pages main text, 55 pages Supplementary Information), 8 figures. Code and data: https://github.com/Fanerst/tropidist
Code: https://github.com/Fanerst/tropidist
License: http://creativecommons.org/licenses/by/4.0/
The gist: Code and circuit distances characterize how strongly quantum error correction suppresses logical errors and guide code comparisons, schedule choices and resource estimates.
Abstract
Code and circuit distances characterize how strongly quantum error correction suppresses logical errors and guide code comparisons, schedule choices and resource estimates. Yet many published distances are only upper bounds from heuristic searches. Here, we express both distances as tropical partition functions and evaluate them with rank-based dynamic programming and weight-bounded search. Circuit reductions and relaxations shrink the problems, and proved lower bounds with explicit logical errors of matching weight certify exact values. On two benchmarks, our method certifies more instances than all other tested exact solvers combined. We certify distances for codes with up to 31,200 qubits, such as Google's modular hyperbolic codes, and for memory circuits with up to 8 times10 5 fault mechanisms, such as those of high-rate Cornucopia codes. Our audit of 26 recent papers identifies overestimated distances and non-tight upper bounds in 10 papers, with a maximum discrepancy of at least eight. Certified distances also guide circuit design and show which defective chips remain usable. In particular, we certify circuit distance 16 for IBM's two-gross memory circuits with the standard schedule, not the assumed 18, whereas redesigned schedules reach 18 at one noisy cycle, at the cost of one more timestep per cycle. At 99.98% junction yield, keeping gross-code memory blocks with dead checks that are certified at distance 10 or more raises the estimated usable share from 53% for perfect blocks alone to 94% with an improved schedule.
Sources
- Assessing requirements to scale to practical quantum advantage
- How to factor 2048 bit RSA integers with less than a million noisy qubits
- Tour de gross: A modular quantum computer based on bivariate bicycle codes
- Tesseract: A Search-Based Decoder for Quantum Error Correction
- Distance-Finding Algorithms for Quantum Codes and Circuits
- Exact Maximum Likelihood Decoding beyond Treewidth via Rank-Decomposition Dynamic Programming
- High-performance syndrome extraction circuits for quantum codes
- Ultra-high-distance quantum memories from amplified qLDPC codes
- Low-Overhead Quantum Error Correction with Boundary-Connected Planar Modules
- High-rate qLDPC processors
- Quantum error correction at ultra-low overhead
- Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity
- Time-Dynamic Circuits for Fault-Tolerant Shift Automorphisms in Quantum LDPC Codes
- Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
- Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
- Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
- Multivariate Multicycle Codes for Complete Single-Shot Decoding
- A modular quantum computer based on Cornucopia codes
- SSIP: automated surgery with quantum LDPC codes
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements