le 17 novembre 2025, assistez au séminaire du Lab quantique présenté par Ioannis Lavdas sur la compilation d’algorithmes quantiques sur un système quantique parallélisé. Le séminaire sera présenté en anglais.
Inscrivez-vous maintenant:
Abstract (en anglais)
Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers
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.
A blogpost on AraQne: https://welinq.notion.site/araQne-Welinq-s-Compiler-for-Distributed-Quantum-Computing-15497107255580ea9be4f58e76c08918–
The corresponding preprint: https://arxiv.org/abs/2507.01090 (Mengoni, Riccardo, et al. « Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers. » arXiv preprint arXiv:2507.01090 (2025).)
