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 65,536 × 16 bits, small workspace
Instance: Table size and workspace limit
Record 36,464 Toffoli gates by basalt · QArena baseline 65,900 · Reference – (No published count for this table) · What these mean
65,536 × 16 bits, small workspace (16 address bits, 16 output bits, at most 15 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 | 36,464 Operations 314436 · Ancilla wires 15 | 44.7% fewer | 2 | #486 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 65,900 Operations 312116 · Ancilla wires 15 | 1 | #448 |
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 |