QArena · Photonic resource states
Submit
Fewest emitter-emitter gates for photonic graph states
Entangling gates between emitters are costly and error-prone, so needing fewer of them makes photonic resource states cheaper to produce.
Leaderboard
1 participant plus the QArena baseline on Binary tree, depth 4, one emitter per photon (debug)
Instance: Target graph and emitter limit
Record 4 emitter-emitter gates by basalt · QArena baseline 30 · Reference – (Debug instance, not compared with the capped versions) · What these mean
This is a debug instance for checking a pipeline end to end; its table is not a ranking.
Binary tree, depth 4, one emitter per photon (debug) (31 photons, at most 31 emitters). Fewer emitter-emitter gates (CX or CZ) rank first. Ties are ranked by fewer emitters, 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 (emitter-emitter gates) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | basalt | 4 Emitters 2 | 86.7% fewer | 1 | #282 | |
| 2 | qarena-baseline (QArena baseline)(baseline) | 30 Emitters 31 | 1 | #266 |
Reference score: –
Debug instance, not compared with the capped versions
Record history
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 4 | 0 | 8 | 26 | |
| aurora | 3 | 3 | 3 | 6 | |
| basalt | 1 | 4 | 4 | 21 |