Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918243807002624 |
|---|---|
| author | Mengoni, Riccardo Nadalin, Walter Rennela, Mathys Rotureau, Jimmy Darras, Tom Laurat, Julien Diamanti, Eleni Lavdas, Ioannis |
| author_facet | Mengoni, Riccardo Nadalin, Walter Rennela, Mathys Rotureau, Jimmy Darras, Tom Laurat, Julien Diamanti, Eleni Lavdas, Ioannis |
| contents | 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. We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_01090 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers Mengoni, Riccardo Nadalin, Walter Rennela, Mathys Rotureau, Jimmy Darras, Tom Laurat, Julien Diamanti, Eleni Lavdas, Ioannis Quantum Physics Distributed, Parallel, and Cluster Computing 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. We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach. |
| title | Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers |
| topic | Quantum Physics Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2507.01090 |