QArena · Error correction
Submit
Most efficient weight-6 qLDPC codes with exact distance
A quantum memory needs many logical qubits, each protected by a high distance, from as few physical qubits as possible. The efficiency k·d²/n measures that trade-off for codes whose checks hardware can measure with short circuits.
Instance: Physical qubit limit
Record 14.22222222 efficiency k·d²/n by qarena-baseline · QArena baseline 14.22222222 · Reference 14.22222222 (Published code) · What these mean
n ≤ 288 (d ≤ 32). Higher efficiency k·d²/n ranks first, compared as exact fractions. Ties are ranked by fewer physical qubits, then lower maximum qubit degree, then submission number (lower first). Each participant appears once, with their best accepted submission. Scores are public; a participant can keep the file itself private.
| # | Participant | Score (efficiency k·d²/n) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | qarena-baseline (QArena baseline)(baseline) | 14.22222222 Logical qubits 16 · Distance 16 · Physical qubits 288 · Maximum qubit degree 6 | 1 | #433 |
Reference score: 14.22222222
Published code, Lee 2026, [[288,16,16]] two-block code
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 14.22222222 efficiency k·d²/n | #433 |
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 3 | 0 | 3 | 3 |