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 files
Each JSON file defines one instance of this problem. Instances differ by table size and workspace limit. The verifier reads the same files, and the verifier bundle contains all of them together with an accepted example.
| File | Instance | Parameters | Size |
|---|---|---|---|
| gray2-a1.json | 4 entries (debug) | 2 address bits, 2 output bits, at most 1 workspace qubit | 0.2 KB |
| pair08-b16-small.json | 256 × 16 bits, small workspace | 8 address bits, 16 output bits, at most 7 workspace qubits | 1.4 KB |
| pair08-b16-wide.json | 256 × 16 bits, wide workspace | 8 address bits, 16 output bits, at most 71 workspace qubits | 1.4 KB |
| pair12-b32-small.json | 4,096 × 32 bits, small workspace | 12 address bits, 32 output bits, at most 11 workspace qubits | 36.6 KB |
| pair12-b32-wide.json | 4,096 × 32 bits, wide workspace | 12 address bits, 32 output bits, at most 139 workspace qubits | 36.6 KB |
| pair16-b16-small.json | 65,536 × 16 bits, small workspace | 16 address bits, 16 output bits, at most 15 workspace qubits | 247.0 KB |
| pair16-b16-wide.json | 65,536 × 16 random bits, wide workspace | 16 address bits, 16 output bits, at most 79 workspace qubits | 373.3 KB |