ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout
In this paper, we propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. By exploiting the LNN topology’s symmetry, we optimize quantum circuit compilation for High Local Connectivity, Sparse Full Connectivity (HLC-SFC) algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Quantum Fourier Transform (QFT). We also utilize dangling qubits to minimize non-local interactions and reduce SWAP gates. Our approach significantly decreases compilation time, gate count, and circuit depth, improving scalability and robustness for large-scale quantum computations.
Authors
- Samuel Yen-Chi Chen (ORCID: https://orcid.org/0000-0003-0114-4826)
- Haochen Luo (ORCID: https://orcid.org/0000-0002-8846-527X)
- Zhiding Liang (ORCID: https://orcid.org/0000-0002-7568-0165)
- Yuchen Zhu (ORCID: https://orcid.org/0000-0003-1114-2293)
- Yidong Zhou (ORCID: https://orcid.org/0000-0001-6741-007X)
- Jinglei Cheng (ORCID: https://orcid.org/0000-0001-9535-6672)
- Kecheng Liu (ORCID: https://orcid.org/0009-0005-6456-5208)
- Lingjun Xiong
- Eilis Casey
Institutions
- Rensselaer Polytechnic Institute (US)
- Wells Fargo (United States) (US)
- University of Pittsburgh (US)
- Cornell University (US)
Publication Details
- Published
- 2025-05-25
- DOI
- https://doi.org/10.1109/iscas56072.2025.11044200
- Citations
- 2
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 4.96