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 15.24705882 efficiency k·d²/n by qarena-baseline · QArena baseline 15.24705882 · Reference 15.24705882 (Published construction) · What these mean
n ≤ 512 (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) | 15.24705882 Logical qubits 16 · Distance 18 · Physical qubits 340 · Maximum qubit degree 6 | 1 | #434 |
Reference score: 15.24705882
Published construction, Liang et al. 2025, [[340,16,18]] twisted-torus code
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 15.24705882 efficiency k·d²/n | #434 |
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 3 | 0 | 3 | 3 |