ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912099466215424 |
|---|---|
| author | Liu, Kecheng Zhou, Yidong Luo, Haochen Xiong, Lingjun Zhu, Yuchen Casey, Eilis Cheng, Jinglei Chen, Samuel Yen-Chi Liang, Zhiding |
| author_facet | Liu, Kecheng Zhou, Yidong Luo, Haochen Xiong, Lingjun Zhu, Yuchen Casey, Eilis Cheng, Jinglei Chen, Samuel Yen-Chi Liang, Zhiding |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23857 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout Liu, Kecheng Zhou, Yidong Luo, Haochen Xiong, Lingjun Zhu, Yuchen Casey, Eilis Cheng, Jinglei Chen, Samuel Yen-Chi Liang, Zhiding Quantum Physics Distributed, Parallel, and Cluster Computing 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. |
| title | ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout |
| topic | Quantum Physics Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2410.23857 |