.png){kind=icon}
.png){kind=icon}
Return
EDDQC: Enhanced Dynamical Distributing Quantum Compilation
.png){kind=icon}
PRE
AI
DOI：10.1109/TVLSI.2025.3600096.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Dangling qubit
distributed quantum computing (DQC)
linear compiler
linear nearest neighbor (LNN)
quantum switch
Journal
I
IF:
3.1
Papers:
440
Citations:
7.3K
Organization
View more organizations