EDDQC: Enhanced Dynamical Distributing Quantum Compilation

This article presents enhanced dynamical distributing quantum compilation (EDDQC), an optimized method for distributed quantum computing (DQC) using linear nearest neighbor (LNN) architecture integrated with quantum switches. By leveraging the symmetry of LNN topology and designating dangling qubits as communication links, our approach optimizes compilation for high local connectivity, sparse full connectivity algorithms (HLC-SFC) like quantum approximate optimization algorithm (QAOA) and quantum Fourier transform (QFT). Experimental results demonstrate significant performance improvements over traditional methods, including reductions in cross-group swaps by up to 67.2%, gate count by 43.8%, and total execution cycles by up to 40%. We also utilize the area law of entanglement entropy to limit entanglement growth in our 1-D system. Our comprehensive approach combines LNN chains’ efficiency with reconfigurable network flexibility, enhancing scalability and robustness for large-scale quantum computations.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Published
2025-08-29
DOI
https://doi.org/10.1109/tvlsi.2025.3600096
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

EDDQC: Enhanced Dynamical Distributing Quantum Compilation

Samuel Yen-Chi Chen, Haochen Luo, Zhiding Liang, Yidong Zhou et al.
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Quantum Computing Algorithms and Architecture
article

EDDQC: Enhanced Dynamical Distributing Quantum Compilation

Samuel Yen-Chi Chen, Haochen Luo, Zhiding Liang, Yidong Zhou, Jinglei Cheng, Kecheng Liu, Yuchen Zhu, Lingjun Xiong, Eilis Casey
article en

Abstract

This article presents enhanced dynamical distributing quantum compilation (EDDQC), an optimized method for distributed quantum computing (DQC) using linear nearest neighbor (LNN) architecture integrated with quantum switches. By leveraging the symmetry of LNN topology and designating dangling qubits as communication links, our approach optimizes compilation for high local connectivity, sparse full connectivity algorithms (HLC-SFC) like quantum approximate optimization algorithm (QAOA) and quantum Fourier transform (QFT). Experimental results demonstrate significant performance improvements over traditional methods, including reductions in cross-group swaps by up to 67.2%, gate count by 43.8%, and total execution cycles by up to 40%. We also utilize the area law of entanglement entropy to limit entanglement growth in our 1-D system. Our comprehensive approach combines LNN chains’ efficiency with reconfigurable network flexibility, enhancing scalability and robustness for large-scale quantum computations.

IEEE Transactions on Very Large Scale Integration (VLSI) SystemsVol. 34(1)
Rensselaer Polytechnic Institute (US), Wells Fargo (United States) (US), University of Pittsburgh (US), Cornell University (US)
Openalex Percentile: Top 88%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

EDDQC: Enhanced Dynamical Distributing Quantum Compilation — Samuel Yen-Chi Chen, Haochen Luo, et al. · IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2025) | TGRS Research Map | TGRS