QArena · Fault-tolerant arithmetic
Submit
Fewest Toffoli gates for adding a constant
Adding a known constant modulo 2^n is the inner step of modular exponentiation in Shor's algorithm and of many other arithmetic circuits, and spare qubits are expensive, so the Toffoli count at a fixed number of spare qubits decides the cost.
Instance: Register width, constant, control and spare-wire limit
Record 192 Toffoli gates by aurora · QArena baseline 522 · Reference – (No published exact score for this instance) · What these mean
20 bits, 1 spare (adds 879451; at most 1 spare wire). Fewer Toffoli (CCX) gates rank first. Ties are ranked by fewer operations in total, then fewer declared spare wires, then 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 | aurora | 192 Operations 378 · Ancilla wires 1 | 63.2% fewer | 2 | #373 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 522 Operations 1061 · Ancilla wires 1 | 1 | #308 |
Reference score: –
No published exact score for this instance
Record history
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| aurora | 8 | 8 | 8 | 19 | |
| basalt | 0 | 2 | 2 | 4 | |
| qarena-baseline (QArena baseline)(baseline) | 0 | 0 | 8 | 10 |