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, small workspace
Instance: Table size and workspace limit
Record 2,410 Toffoli gates by basalt · QArena baseline 4,226 · Reference – (No published count for this table) · What these mean
4,096 × 32 bits, small workspace (12 address bits, 32 output bits, at most 11 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 | 2,410 Operations 53888 · Ancilla wires 11 | 43.0% fewer | 2 | #485 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 4,226 Operations 37839 · Ancilla wires 11 | 1 | #446 |
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 |