.png){kind=icon}
.png){kind=icon}
Return
Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-026-00513-y.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Just as classical computing relies on distributed systems, the quantum computing era requires new kinds of infrastructure and software tools. Quantum networks will become the backbone of hybrid, quantum-augmented data centers, in which quantum algorithms are distributed over a local network of quantum processing units (QPUs) interconnected via shared entanglement. In this context, it is crucial to develop methods and software that minimize the number of inter-QPU communications. Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost, measured by the number of entangled pairs required to distribute a monolithic quantum circuit using gate teleportation protocols. In particular, we focus on the crucial role of a preprocessing stage based on gate reordering strategies, achieving a notable reduction of the distribution cost compared to a baseline approach.
Keywords:
Distributed quantum computing
Quantum circuit compilation
Modular architectures
Gate reordering
Quantum-augmented data centers
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.6
Papers:
529
Citations:
1.1K