REVIEW 4 cited by
Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Dynamically field-programmable qubit arrays based on neutral atoms feature high fidelity and highly parallel gates for quantum computing. However, it is challenging for compilers to fully leverage the novel flexibility offered by such hardware while respecting its various constraints. In this study, we break down the compilation for this architecture into three tasks: scheduling, placement, and routing. We formulate these three problems and present efficient solutions to them. Notably, our scheduling based on graph edge-coloring is provably near-optimal in terms of the number of two-qubit gate stages (at most one more than the optimum). As a result, our compiler, Enola, reduces this number of stages by 3.7x and improves the fidelity by 5.9x compared to OLSQ-DPQA, the current state of the art. Additionally, Enola is highly scalable, e.g., within 30 minutes, it can compile circuits with 10,000 qubits, a scale sufficient for the current era of quantum computing. Enola is open source at https://github.com/UCLA-VAST/Enola
Forward citations
Cited by 4 Pith papers
-
Quantum circuits as a game: A reinforcement learning agent for quantum compilation and its application to reconfigurable neutral atom arrays
A transformer-based reinforcement learning agent learns to reconfigure atoms in neutral atom arrays and reduces estimated logarithmic infidelity by up to about 20% on benchmark circuits, including unseen ones.
-
AC/DC: Automated Compilation for Dynamic Circuits
A numerical optimization framework automatically synthesizes dynamic quantum circuits for state and unitary preparation, achieving shallower circuits at the cost of extra ancillas and mid-circuit measurement errors.
-
Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
An SMT-based scheduler generates optimal state-preparation schedules for logical arrays on zoned neutral atom hardware, and shielding idle qubits in storage zones improves estimated fidelity.
-
Quantum Compiler Design for Qubit Mapping and Routing: A Cross-Architectural Survey of Superconducting, Trapped-Ion, and Neutral Atom Systems
A cross-architectural survey that categorizes qubit mapping and routing compilers for superconducting, trapped-ion, and neutral atom quantum hardware.
Discussion (0). Continue with ORCID to comment.