Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.14734 · IEEE International Conference on Quantum Software (QSW)

On Distributed Quantum Computing with Distributed Fan-Out Operations

Seng W. Loke

quant-phcs.DCSubmitted Jan 21, 2026• Announced Jan 22, 2026• 3 citations
arXivHTMLPDF

Abstract

We compare different circuits implementing distributed versions of quantum computations, using entangled pairs only, and using distributed fan-out operations (using GHZ states). We highlight the advantages of using distributed fan-out operations in terms of reductions in circuit depth and (possibly) entanglement resources. We note that distributed fan-out operations (or notably, distributed GHZ states) could be a ``primitive'' building block for distributed quantum operations in the same way as entangled pairs are, if distributed GHZ states could be realized efficiently.

Comments
5 pages, 8 figures

Related papers

Distributed Quantum Computing with Fan-Out Operations and Qudits: the Case of Distributed Global Gates

Seng W. Loke

Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a single shot, removing the need to generate multipartite entangled states using many entangled pairs. This paper looks at how multipartite entanglement resources (e.g., GHZ states) can be useful for distributed fan-out operations; we also consider the use of qudits of dimension four for distributed quantum circuit compression. In particular, we consider how such fan-out operations and qudits can be used to implement circuits which are challenging for distributed quantum computation, involving pairwise qubit interactions, i.e., what has been called global gates (a.k.a. global Mølmer-Sørensen gates). Such gates have been explored to possibly yield more efficient computations via reduced circuit depth, and can be carried out efficiently in some types of quantum hardware (e.g., trapped-ion quantum computers); we consider this as an exploration of an ``extreme'' case for distribution given the global qubit-qubit interactions. We also conclude with some implications for future work on quantum circuit compilation and quantum data centre design.

quant-pharXiv:2512.03685•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Dec 4, 2025•0 citations

Generalized GHZ states and distributed quantum computing

Anocha Yimsiriwattana, Samuel J. Lomonaco

A key problem in quantum computing is finding a viable technological path toward the creation of a scalable quantum computer. One possible approach toward solving part of this problem is distributed computing, which provides an effective way of utilizing a network of limited capacity quantum computers. In this paper, we present two primitive operations, cat-entangler and cat-disentangler, which in turn can be used to implement non-local operations, e.g. non-local CNOT and quantum teleportation. We also show how to establish an entangled pair, and use entangled pairs to efficiently create a generalized GHZ state. Furthermore, we present procedures which allow us to reuse channel qubits in a sequence of non-local operations. These non-local operations work on the principle that a cat-like state, created by cat-entangler, can be used to distribute a control qubit among multiple computers. Using this principle, we show how to efficiently implement non-local control operations in many situation, including a parallel implementation of a certain kind of unitary transformation. Finally, as an example, we present a distributed version of the quantum Fourier transform.

arXiv:quant-ph/0402148•Contemporary mathematics - American Mathematical Society•Jan 1, 2005•129 citations

Advantage in distributed quantum computing with slow interconnects

Evan E Dobbs, Nicolas Delfosse, Aharon Brodutch

The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QPUs connected through slow interconnects can outperform a monolithic architecture made with a single QPU. We consider a distributed quantum computing model with the following assumptions: (1) each QPU is linked to only two other QPUs, (2) each link produces only one Bell pair at a time, (3) the time to generate a Bell pair is $τ_e$ times longer than the gate time. We propose a distributed version of the CliNR partial error correction scheme respecting these constraints and we show through circuit level simulations that, even if the entanglement generation time $τ_e$ is up to five times longer than the gate time, distributed CliNR can achieve simultaneously a lower logical error rate and a shorter depth than both the direct implementation and the monolithic CliNR implementation of random Clifford circuits. In the asymptotic regime, we relax assumption (2) and we prove that links producing $O(t/\ln t)$ Bell pairs in parallel, where $t$ is the number of QPUs, is sufficient to avoid stalling distributed CliNR, independently of the number of qubits per QPU. This demonstrates the potential of distributed CliNR for near-term multi-QPU devices. Moreover, we envision a distributed quantum superiority experiment based on the conjugated Clifford circuits of Bouland, Fitzsimons and Koh implemented with distributed CliNR.

quant-pharXiv:2512.10693•Dec 12, 2025•2 citations

Network-Assisted Collective Operations for Efficient Distributed Quantum Computing

Iago F. Llovo, Guillermo Díaz-Camacho, Natalia Costas +1 more

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}(\theta)$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.

arXiv:2502.19118•IEEE Transactions on Quantum Engineering•Jan 1, 2025•4 citations

Distributed quantum computing: a distributed Shor algorithm

Anocha Yimsiriwattana, Samuel J. Lomonaco

We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large capacity quantum computer. In this paper, entanglement is used as a resource for implementing non-local operations between two or more quantum computers. These non-local operations are used to implement a distributed factoring circuit with polynomially many gates. This distributed version of Shor's algorithm requires an additional overhead of O((log N)^2) communication complexity, where N denotes the integer to be factored.

arXiv:quant-ph/0403146•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•139 citations

APPLICATIONS OF ATOMIC ENSEMBLES IN DISTRIBUTED QUANTUM COMPUTING

Marcin Zwierz, Pieter Kok

Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust and scalable machine. In the case of many qubits which may interact with the environment and their neighbors, protection against decoherence becomes quite a challenging task. The scalability and decoherence issues are the main difficulties addressed by the distributed model of quantum computation. A distributed quantum computer consists of a large quantum network of distant nodes — stationary qubits which communicate via flying qubits. Quantum information can be transferred, stored, processed and retrieved in decoherence-free fashion by nodes of a quantum network realized by an atomic medium — an atomic quantum memory. Atomic quantum memories have been developed and demonstrated experimentally in recent years. With the help of linear optics and laser pulses, one is able to manipulate quantum information stored inside an atomic quantum memory by means of electromagnetically induced transparency and associated propagation phenomena. Any quantum computation or communication necessarily involves entanglement. Therefore, one must be able to entangle distant nodes of a distributed network. In this article, we focus on the probabilistic entanglement generation procedures such as well-known DLCZ protocol. We also demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of inherently distributed quantum states so-called cluster states. In the protocol, atomic ensembles serve as single qubit systems. Hence, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultra-cold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single stepQ-qubit GHZ states with success probability psuccess ~ ηQ/2, where η is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. The GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.

International Journal of Quantum Information•Feb 1, 2010•4 citations
We compare different circuits implementing distributed versions of quantum computations, using entangled pairs only, and using distributed fan-out operations (using GHZ states). We highlight the advantages of using distributed fan-out operations in terms of reductions in circuit depth and (possibly) entanglement resources. We note that distributed fan-out operations (or notably, distributed GHZ states) could be a ``primitive'' building block for distributed quantum operations in the same way as entangled pairs are, if distributed GHZ states could be realized efficiently.
Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a single shot, removing the need to generate multipartite entangled states using many entangled pairs. This paper looks at how multipartite entanglement resources (e.g., GHZ states) can be useful for distributed fan-out operations; we also consider the use of qudits of dimension four for distributed quantum circuit compression. In particular, we consider how such fan-out operations and qudits can be used to implement circuits which are challenging for distributed quantum computation, involving pairwise qubit interactions, i.e., what has been called global gates (a.k.a. global Mølmer-Sørensen gates). Such gates have been explored to possibly yield more efficient computations via reduced circuit depth, and can be carried out efficiently in some types of quantum hardware (e.g., trapped-ion quantum computers); we consider this as an exploration of an ``extreme'' case for distribution given the global qubit-qubit interactions. We also conclude with some implications for future work on quantum circuit compilation and quantum data centre design.
A key problem in quantum computing is finding a viable technological path toward the creation of a scalable quantum computer. One possible approach toward solving part of this problem is distributed computing, which provides an effective way of utilizing a network of limited capacity quantum computers. In this paper, we present two primitive operations, cat-entangler and cat-disentangler, which in turn can be used to implement non-local operations, e.g. non-local CNOT and quantum teleportation. We also show how to establish an entangled pair, and use entangled pairs to efficiently create a generalized GHZ state. Furthermore, we present procedures which allow us to reuse channel qubits in a sequence of non-local operations. These non-local operations work on the principle that a cat-like state, created by cat-entangler, can be used to distribute a control qubit among multiple computers. Using this principle, we show how to efficiently implement non-local control operations in many situation, including a parallel implementation of a certain kind of unitary transformation. Finally, as an example, we present a distributed version of the quantum Fourier transform.
The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QPUs connected through slow interconnects can outperform a monolithic architecture made with a single QPU. We consider a distributed quantum computing model with the following assumptions: (1) each QPU is linked to only two other QPUs, (2) each link produces only one Bell pair at a time, (3) the time to generate a Bell pair is τeτ_eτe​ times longer than the gate time. We propose a distributed version of the CliNR partial error correction scheme respecting these constraints and we show through circuit level simulations that, even if the entanglement generation time τeτ_eτe​ is up to five times longer than the gate time, distributed CliNR can achieve simultaneously a lower logical error rate and a shorter depth than both the direct implementation and the monolithic CliNR implementation of random Clifford circuits. In the asymptotic regime, we relax assumption (2) and we prove that links producing O(t/ln⁡t)O(t/\ln t)O(t/lnt) Bell pairs in parallel, where ttt is the number of QPUs, is sufficient to avoid stalling distributed CliNR, independently of the number of qubits per QPU. This demonstrates the potential of distributed CliNR for near-term multi-QPU devices. Moreover, we envision a distributed quantum superiority experiment based on the conjugated Clifford circuits of Bouland, Fitzsimons and Koh implemented with distributed CliNR.
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, andRzz(θ)R_{zz}(\theta)Rzz​(θ)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.
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large capacity quantum computer. In this paper, entanglement is used as a resource for implementing non-local operations between two or more quantum computers. These non-local operations are used to implement a distributed factoring circuit with polynomially many gates. This distributed version of Shor's algorithm requires an additional overhead of O((log N)^2) communication complexity, where N denotes the integer to be factored.
Thesis chapter. The fragility of quantum information is a fundamental constraint faced by anyone trying to build a quantum computer. A truly useful and powerful quantum computer has to be a robust and scalable machine. In the case of many qubits which may interact with the environment and their neighbors, protection against decoherence becomes quite a challenging task. The scalability and decoherence issues are the main difficulties addressed by the distributed model of quantum computation. A distributed quantum computer consists of a large quantum network of distant nodes — stationary qubits which communicate via flying qubits. Quantum information can be transferred, stored, processed and retrieved in decoherence-free fashion by nodes of a quantum network realized by an atomic medium — an atomic quantum memory. Atomic quantum memories have been developed and demonstrated experimentally in recent years. With the help of linear optics and laser pulses, one is able to manipulate quantum information stored inside an atomic quantum memory by means of electromagnetically induced transparency and associated propagation phenomena. Any quantum computation or communication necessarily involves entanglement. Therefore, one must be able to entangle distant nodes of a distributed network. In this article, we focus on the probabilistic entanglement generation procedures such as well-known DLCZ protocol. We also demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of inherently distributed quantum states so-called cluster states. In the protocol, atomic ensembles serve as single qubit systems. Hence, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultra-cold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single stepQ-qubit GHZ states with success probability psuccess ~ ηQ/2, where η is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. The GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.