2025/07/01 by Mengoni, Riccardo, Nadalin, Walter, Rennela, Mathys +5 · 5 citations
#Distributed #FOS: Computer and information sciences #FOS: Physical sciences #Parallel #Quantum Physics (quant-ph) #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.2507.01090
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.