QArena · Quantum simulation
Submit
Fewest CX gates for a Hubbard Trotter step of Pauli rotations
On current hardware, two-qubit gates take most of the time and cause most of the errors of a Hamiltonian-simulation circuit. A product-formula step is repeated many times, so a CX saved in one step is saved in every step.
Leaderboard
0 participants plus the QArena baseline on 3-qubit parity example (debug)
Instance: Lattice size
Record 4 CX gates by qarena-baseline · QArena baseline 4 · Reference – (Hand-built example of the specification; 4 CX is the minimum) · What these mean
This is a debug instance for checking a pipeline end to end; its table is not a ranking.
3-qubit parity example (debug) (debug instance, 3 qubits, 2 rotations (Z Z I, then Z Z Z)). Fewer CX gates rank first. Ties are ranked by fewer operations in total (single-qubit gates and rotations included), then 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 (CX gates) | vs QArena baseline | Submissions | Last | Best submission |
|---|---|---|---|---|---|---|
| 1 | qarena-baseline (QArena baseline)(baseline) | 4 Operations 6 | 1 | #554 |
Reference score: –
Hand-built example of the specification; 4 CX is the minimum
Record history
Record history as a table
| Submitted | Participant | Record | Submission |
|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 4 CX gates | #554 |
Participants across all instances
| Participant | Records held | Instances beating baseline | Instances entered | Submissions | Latest |
|---|---|---|---|---|---|
| qarena-baseline (QArena baseline)(baseline) | 3 | 0 | 3 | 4 |