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.
Instance: Target graph and emitter limit
Record 2 emitter-emitter gates by qarena-baseline · QArena baseline 2 · Reference 2 (Proved optimum) · What these mean
Binary tree, depth 3 (15 photons, at most 4 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 | qarena-baseline (QArena baseline)(baseline) | 2 Emitters 2 | 1 | #265 |
Reference score: 2
Proved optimum, one gate cannot make this graph and the baseline uses 2, see the problem statement
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 2 emitter-emitter gates | #265 |
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 |