Network-Assisted Collective Operations for Efficient Distributed Quantum Computing

Distributed quantum computing relies on coordinated operations between remote quantum processing units (QPUs), yet most existing work either assumes full connectivity, unrealistic for large networks, or relies on entanglement swapping. To mitigate the overhead of communication, we propose a scheme for the distribution of collective quantum operations among remote quantum processing units by exploiting distributed fan-out operations to a central node in network architectures similar to those used for high-performance computing, which requires only pre-shared entanglement, local operations and classical communication. We show that a general diagonal gate can be distributed among any number of nodes and provide the ebit cost bounds. For a single distributed multicontrolled gate, this amounts to a single additional Bell pair over the theoretically optimal calculation with all-to-all pre-shared entanglement, demonstrating better scalability when compared to current proposals based on entanglement swapping through a network. We provide a recipe for the lumped distribution of gates such as arbitrarily-sized Toffoli and multicontrolled Z, and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$R_{zz}(\theta)$</tex-math></inline-formula> gates. Finally, we provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit, with Bell pair cost growing linearly with the number of Grover iterations and the number of partitions, and show how these techniques can be applied to other algorithms such as QAOA. Our results show that alternative approaches to entanglement swapping can provide major benefits in distributed quantum computing, pointing to promising avenues for future research.