Quantum codes
[[53,23,11]]_7
A [[53,23]] quantum code over qudits (q = 7) with minimum distance 11, one more than the 10 listed at codetables.de, where the upper bound is 16. Quantavane found it on 25 October 2026.
Checked; it goes to codetables.de with our next batch of results.
The record
| Ours | d = 11 |
|---|---|
| Previous best | d = 10 (upper bound 16) |
| Previous source | the lower bound listed at codetables.de |
| Found | 25 October 2026 |
| Status | Checked; it goes to codetables.de with our next batch of results. |
| Check | The distance was computed by the search and again by a separate program. |
It encodes 23 qudits into 53 and corrects up to 5 arbitrary errors.
How it was found and checked
A random Hermitian self-orthogonal code over GF(49). The distance was computed by the search and again by a separate program.
A quantum error-correcting code protects qubits the way a linear code protects symbols. An [[n,k]] code spreads k qubits over n, and with minimum distance d it corrects up to (d−1)/2 errors. Codes with k = 0, single entangled states of n qubits, are listed too. Markus Grassl's tables at codetables.de keep the largest d known for each n and k, for qubits and for larger dimensions q (qudits).
Questions
What is the best known [[53,23]] quantum code over qudits (q = 7)?
Ours, with minimum distance 11; codetables.de listed 10 (read 26 October 2026).
How was it built?
A random Hermitian self-orthogonal code over GF(49).
Is it on codetables.de yet?
Checked; it goes to codetables.de with our next batch of results.