Distance bounds for qubit stabilizer codes

A qubit stabilizer code stores k logical qubits in n physical qubits. Its distance is the minimum weight of a nontrivial logical Pauli operator, counting the qubits on which it acts. For each n and k, how large can that distance be?

Why it matters and what counts as progress

Why it matters: Larger distance lets a code detect more errors at the same storage cost. Tables of known bounds show where better codes might still exist.

What counts as progress: Construct a code with greater certified distance at a fixed length and dimension, or prove that no code can exceed a stated distance. Identify the table snapshot used for comparison.

How the problem developed

  1. 4 Nov 2026 · Reference lower bounds [3][2]

    Markus Grassl The comparison uses the qubit-code bounds published in the 4 November table snapshot.

  2. 5 Nov 2026 · 192 explicit distance improvements [1][2]

    Marin Girard with AI agents Reported explicit codes that raise 1,873 lower-bound entries after standard propagation.

AI contribution

Random encoders and expurgation improve 1,873 entries of the Grassl qubit code tables

Marin Girard

Girard reports 192 explicit binary stabilizer codes with lengths from 53 to 254 and distances from 5 to 13. At their own lengths and dimensions, 161 raise the listed lower bound by one and 31 by two. Standard lengthening and dimension reduction propagate these gains to 1,873 entries with positive dimension in the 4 November 2026 Grassl table snapshot.

AI involvementAI-centered
ImportanceNotable
Technical verificationFormal (exact computation)
Human understandingExplained
Paper date:

Sources

  1. Random encoders and expurgation improve 1,873 entries of the Grassl qubit code tables
  2. Pinned codes, distance certificates and comparison scripts
  3. Markus Grassl’s quantum code tables
Publication history