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 0 Toffoli gates by qarena-baseline · QArena baseline 0 · Reference 0 (Proved optimum) · What these mean
This is a debug instance for checking a pipeline end to end; its table is not a ranking.
4 entries (debug) (2 address bits, 2 output bits, at most 1 workspace qubit). 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 | qarena-baseline (QArena baseline)(baseline) | 0 Operations 3 · Ancilla wires 0 | 1 | #443 |
Reference score: 0
Proved optimum, the table is linear, so CNOT gates suffice
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 0 Toffoli gates | #443 |
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 |