QArena · Fault-tolerant arithmetic
Submit
Fewest Toffoli gates for coherent table lookup
Table lookups are a large part of the cost of fault-tolerant chemistry and simulation algorithms, and Toffoli gates dominate that cost.
Leaderboard
1 participant plus the QArena baseline on 4,096 × 32 bits, wide workspace
Instance: Table size and workspace limit
Record 893 Toffoli gates by basalt · QArena baseline 2,430 · Reference – (No published count for this table) · What these mean
4,096 × 32 bits, wide workspace (12 address bits, 32 output bits, at most 139 workspace qubits). Fewer Toffoli gates rank first. Equal counts are ranked by fewer gates in total, then by fewer workspace qubits, then by 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 (Toffoli gates) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | basalt | 893 Operations 30223 · Ancilla wires 125 | 63.3% fewer | 2 | #481 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 2,430 Operations 63446 · Ancilla wires 137 | 1 | #447 |
Reference score: –
No published count for this table
Record history
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| basalt | 6 | 6 | 6 | 13 | |
| qarena-baseline (QArena baseline)(baseline) | 0 | 0 | 6 | 7 |