Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Q-Pilot: Field Programmable Qubit Array Compilation with Flying Ancillas

Q-Pilot: Field Programmable Qubit Array Compilation with Flying Ancillas

Thumbnail Image
Download
Name

3649329.3658470.pdf

Size

1.03 MB

Format

Adobe PDF

Checksum (MD5)

e2fb09bcaf02c1885f7a08043a88950c

Download all files submitted through automated deposit
3649329.3658470.zip (1.01 MB)
Author(s)
Wang, Hanrui
•
Tan, Daniel Bochen
•
Liu, Pengyu
•
Liu, Yilian
•
Gu, Jiaqi
•
Cong, Jason
•
Han, Song
Date Issued
June 23, 2024
Publisher
ACM|61st ACM/IEEE Design Automation Conference
Citation
Wang, Hanrui, Tan, Daniel Bochen, Liu, Pengyu, Liu, Yilian, Gu, Jiaqi et al. 2024. "Q-Pilot: Field Programmable Qubit Array Compilation with Flying Ancillas."
Version
Final published version
Abstract
Neutral atom arrays, particularly the reconfigurable field programmable qubit arrays (FPQA) with atom movement, show strong promise for quantum computing. FPQA has a dynamic qubit connectivity, facilitating cost-effective execution of long-range gates, but it also poses new challenges in the compilation. Inspired by the FPGA compilation strategy, we develop a router, Q-Pilot, that leverages flying ancillas to implement 2-Q gates between data qubits mapped to fixed atoms. Equipped with domain-specific routing techniques, Q-Pilot achieves 1.4×, 27.7×, and 6.7× reductions in circuit depth for 100-qubit random, quantum simulation, and QAOA circuits, respectively, compared to alternative fixed atom array architectures.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/157759
DOI of Published Version
https://doi.org/10.1145/3649329.3658470
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.