Papers › Network-assisted collective operations for efficient distributed quantum computing
Network-assisted collective operations for efficient distributed quantum computing
Iago Fernández Llovo, Guillermo Díaz-Camacho, Natalia Costas Lago, Andrés Gómez Tato
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 R_(zz)(θ) 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections