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.
Instance files
Each JSON file defines one instance of this problem. Instances differ by lattice size. The verifier reads the same files, and the verifier bundle contains all of them together with an accepted example.
| File | Instance | Parameters | Size |
|---|---|---|---|
| pn-parity3.json | 3-qubit parity example (debug) | debug instance, 3 qubits, 2 rotations (Z Z I, then Z Z Z) | 0.1 KB |
| pn-hub4.json | 4 × 4 Hubbard lattice | 32 qubits, 112 rotations | 4.0 KB |
| pn-hub6.json | 6 × 6 Hubbard lattice | 72 qubits, 276 rotations | 20.4 KB |
| pn-hub8.json | 8 × 8 Hubbard lattice | 128 qubits, 512 rotations | 65.6 KB |