Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling

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

To appear in 0th Asia and South Pacific Design Automation Conference (ASP-DAC 2025)

References in corpus (14)

• Logical quantum processor based on reconfigurable atom arrays
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Quantum Low-Density Parity-Check Codes
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Quantum Circuit Placement
• Optimal Layout Synthesis for Quantum Computing
• Optimality Study of Existing Quantum Computing Layout Synthesis Tools
• Supercharged two-dimensional tweezer array with more than 1000 atomic qubits
• Scalable multilayer architecture of assembled single-atom qubit arrays in a three-dimensional Talbot tweezer lattice
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
• Exact and practical pattern matching for quantum circuit optimization
• Optimal Qubit Mapping with Simultaneous Gate Absorption
• Depth-Optimal Addressing of 2D Qubit Array with 1D Controls Based on Exact Binary Matrix Factorization

Cited by in corpus (5)

• Optimal State Preparation for Logical Arrays on Zoned Neutral Atom Quantum Computers
• Generating Compilers for Qubit Mapping and Routing
• Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing
• Compilation of QCrank Encoding Algorithm for a Dynamically Programmable Qubit Array Processor
• Suppressing crosstalk for Rydberg quantum gates