{"ID":2899779,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.01090","arxiv_id":"2507.01090","title":"Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers","abstract":"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.","short_abstract":"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...","url_abs":"https://arxiv.org/abs/2507.01090","url_pdf":"https://arxiv.org/pdf/2507.01090v2","authors":"[\"Riccardo Mengoni\",\"Walter Nadalin\",\"Mathys Rennela\",\"Jimmy Rotureau\",\"Tom Darras\",\"Julien Laurat\",\"Eleni Diamanti\",\"Ioannis Lavdas\"]","published":"2025-07-01T18:00:02Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"cs.DC\"]","methods":"[]","has_code":false}