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