Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
复制标题
DOI：
10.22331/q-2024-03-14-1281
复制
发表时间：
2023-06
期刊：
影响因子：
--
通讯作者：
D. Tan;D. Bluvstein;M. Lukin;J. Cong
中科院分区：
文献类型：
--
作者：
D. Tan;D. Bluvstein;M. Lukin;J. Cong
动态现场可编程的量子阵列（DPQA）最近成为量子信息处理的有前途的平台。在DPQA中，原子量子位有选择地加载到可以在计算本身过程中重新配置的光学陷阱阵列。利用量子运输和并行，纠缠量子操作，不同的Qubit对，甚至最初遥远的量子，甚至可以在量子程序执行的不同阶段纠缠。这种可重构性和非本地连接性提出了汇编的新挑战，尤其是在布局综合步骤中，将Qubits和安排在大门上。在本文中，我们考虑了包含多个阵列的DPQA体系结构，并支持2D数组运动，代表了尖端的实验平台。在此体系结构中，我们将状态空间离散并将布局综合作为令人满意的模型理论问题，可以通过电路深度最佳地解决现有求解器来解决。对于具有复杂连接性的随机图生成的一组基准电路，与固定平面体系结构相比，与最佳编译相比，我们的编译器OLSQ-DPQA将小问题实例上的两Q Quit纠缠门的两倍纠缠门的数量减少了1.7倍。为了进一步提高该方法的可伸缩性和实用性，我们引入了一种贪婪的启发式，该敏捷的启发式是受经典集成电路路由中迭代剥离方法的启发。使用将贪婪和最佳方法结合在一起的混合方法，我们证明了与网格固定结构相比，基于DPQA的编译电路的缩放缩放率降低了缩放开销，从而减少了5.1倍的90 Qubit量子量子电路。这些方法可通过中性原子量子计算机启用可编程，复杂的量子电路，并告知未来的编译器和未来的硬件选择。
Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.