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
2 participants plus the QArena baseline on Google 2024, 70 qubits, 26 cycles (ABCD pattern), 2^42 elements
Instance: Circuit, depth and memory limit
Record 2.30 × 10²⁴ multiplications by aurora · QArena baseline 3.19 × 10²⁷ · Reference – (No comparable published value) · What these mean
Google 2024, 70 qubits, 26 cycles (ABCD pattern), 2^42 elements (70 qubits, 755 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 | aurora | 2.30 × 10²⁴ log10 of multiplications 24.3615 · log2 of peak storage 41.585 | 1.4e+03× fewer | 1 | #593 | |
| 2 | basalt | 2.71 × 10²⁷ log10 of multiplications 27.4328 · log2 of peak storage 41.0 | 1.2× fewer | 1 | #466 | |
| 3 | qarena-baseline (QArena baseline)(baseline) | 3.19 × 10²⁷ log10 of multiplications 27.5035 · log2 of peak storage 41.0 | 1 | #339 |
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 |