QArena · Fault-tolerant arithmetic
Submit
Fewest T gates for field multiplication
Fewer T gates reduce the magic states needed for field multiplication.
Instance files
Each JSON file defines one instance of this problem. Instances differ by field size m. The verifier reads the same files, and the verifier bundle contains all of them together with an accepted example.
| File | Instance | Parameters | Size |
|---|---|---|---|
| mult-2.json | m = 2 | 6 qubits | 0.3 KB |
| mult-3.json | m = 3 | 9 qubits | 0.3 KB |
| mult-4.json | m = 4 | 12 qubits | 0.4 KB |
| mult-5.json | m = 5 | 15 qubits | 0.5 KB |
| mult-6.json | m = 6 | 18 qubits | 0.6 KB |
| mult-7.json | m = 7 | 21 qubits | 0.8 KB |
| mult-8.json | m = 8 | 24 qubits | 1.4 KB |
| mult-9.json | m = 9 | 27 qubits | 1.2 KB |
| mult-10.json | m = 10 | 30 qubits | 1.4 KB |
| mult-16.json | m = 16 | 48 qubits | 6.1 KB |
| mult-32.json | m = 32 | 96 qubits | 26.1 KB |