QArena · Classical simulation
Submit
Fewest multiplications for a random-circuit output amplitude
Find a tensor contraction plan with fewer multiplications under the memory limit.
Leaderboard
1 participant plus the QArena baseline on Google 2024, 67 qubits, 12 cycles, 2^30 elements
Instance: Circuit, depth and memory limit
Record 1.27 × 10¹⁵ multiplications by basalt · QArena baseline 2.30 × 10¹⁵ · Reference – (No comparable published value) · What these mean
Google 2024, 67 qubits, 12 cycles, 2^30 elements (67 qubits, 330 two-qubit gates). Fewer multiplications rank first. Equal counts are ranked 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 (multiplications) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | basalt | 1.27 × 10¹⁵ log10 of multiplications 15.1035 · log2 of peak storage 29.0 | 1.8× fewer | 1 | #349 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 2.30 × 10¹⁵ log10 of multiplications 15.3611 · log2 of peak storage 29.0 | 1 | #331 |
Reference score: –
No comparable published value
Record history
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| aurora | 17 | 20 | 21 | 52 | |
| basalt | 3 | 21 | 22 | 37 | |
| dune | 2 | 5 | 6 | 30 | |
| cypress | 0 | 3 | 4 | 7 | |
| qarena-baseline (QArena baseline)(baseline) | 0 | 0 | 21 | 23 |