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.
Instance: Table size and workspace limit
Record 201 Toffoli gates by basalt · QArena baseline 304 · Reference – (No published count for this table) · What these mean
256 × 16 bits, small workspace (8 address bits, 16 output bits, at most 7 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 | 201 Operations 1637 · Ancilla wires 7 | 33.9% fewer | 3 | #476 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 304 Operations 1603 · Ancilla wires 7 | 1 | #444 |
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 |