Fewest Toffoli gates for elliptic-curve point addition
Point addition is the inner step of Shor's algorithm for elliptic-curve discrete logarithms, and its Toffoli count at a fixed number of qubits sets the cost of that algorithm. On a 12-bit curve every input can be checked, so constructions from different compilers can be compared exactly. The board says nothing about secp256k1 or other cryptographic curves.
Instance: Prime, kind of addend and input domain
p = 11, classical Q, plane (Q = (2, 2); 99 pairs (x, y); debug instance). 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 | 120 Operations 3718 · Ancilla wires 60 | 69.8% fewer | 3 | #583 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 398 Operations 2189 · Ancilla wires 70 | 1 | #542 |
Record history
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 3 | 0 | 3 | 9 |