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:quant-ph/0402148

Generalized GHZ States and Distributed Quantum Computing

Anocha Yimsiriwattana, Samuel J. Lomonaco

Published Feb 19, 2004• 10 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0402148

Related papers

On Distributed Quantum Computing with Distributed Fan-Out Operations

Seng W. Loke

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.

quant-pharXiv:2601.14734•IEEE International Conference on Quantum Software (QSW)•Jan 22, 2026•0 citations

Distribution of Quantum Circuits Over General Quantum Networks

Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan

Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous computers impose constraints on cat-entanglement and teleportation operations that can be chosen by an algorithm. We first focus on a special case that only allows cat-entanglements and not teleportations for communication. We provide a two-step heuristic for solving this specialized setting: (i) finding an assignment of qubits to computers using Tabu search, and (ii) using an iterative greedy algorithm designed for a constrained version of the set cover problem to determine cat-entanglement operations required to execute gates locally. For the general case, which allows both forms of communication, we propose two algorithms that subdivide the quantum circuit into several portions and apply the heuristic for the specialized setting on each portion. Teleportations are then used to stitch together the solutions for each portion. Finally, we simulate our algorithms on a wide range of randomly generated quantum networks and circuits, and study the properties of their results with respect to several varying parameters.

arXiv:2206.06437•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•39 citations

Controlled Implementation of Non-local CNOT Operation Using Three-Qubit Entanglement

Libing Chen, Lu Hong, Weicheng Chen

We investigate the controlled implementation of a non-local CNOT operation using a three-qubit entangled state. Firstly, we show how the non-local CNOT operation can be implemented with unit fidelity and unit probability by using a maximally entangled GHZ state as controlled quantum channel. Then, we put forward two schemes for conclusively implementing the non-local operation with unit fidelity by employing a partially entangled pure GHZ state as quantum channel. The feature of these schemes is that a third side is included, who may participate the process of quantum non-local implementation as a supervisor. Furthermore, when the quantum channel is partially entangled, the third one can rectify the state distorted by imperfect quantum channel. In addition to the GHZ class state, the W class state can also be used to implement the same non-local operation probabilistically. The probability of successful implementation using the W class state is always less than that using the GHZ class state.

Communications in Theoretical Physics•Jun 1, 2005•2 citations

Generation and Distribution of GHZ States in Quantum Networks

Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan

In quantum networks, multipartite entangled states distributed over the network are useful in implementing and supporting many quantum network applications for communications, sensing, and computing. The focus of our work is to de-velop techniques to efficiently generate distributed Greenberger-Horne-Zeilinger (GHZ) states, a special class of multipartite entanglement states. Prior works on generating GHZ states have focused on the objective of minimizing the number of maximally entangled (bipartite) pairs (EPs), while ignoring the stochastic nature of quantum processes and assuming uniform network links for generating EPs. In contrast, in our work, we take into consideration the stochastic nature of quantum networks, and focus on maximizing the expected generated rate of the GHZ states under given fidelity constraints. In this context, we develop two efficient generation schemes, viz., Fusion - Retain - only and General Fusion, comprised of optimal or near-optimal sub-steps. Both schemes, at a high-level, first determine a way to “connect” the nodes over which the GHZ state is to distributed, and then, determine a sequence of fusion operations on the EPs created over the connections. Using extensive simulations over a quantum network simulator (NetSquid), we demonstrate the effectiveness of our developed techniques and show that our schemes outperform prior work as well as a simple centralized approach by up to orders of magnitude while generating GHZ states of tolerable fidelity.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•14 citations

Entanglement-efficient bipartite-distributed quantum computing

Jun-Yi Wu, Kosuke Matsui, Tim Forrer +5 more

In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.

arXiv:2212.12688•Quantum•Dec 5, 2023•32 citations

An N-Qubit Teleportation Protocol with a Generalized GHZ State

Abdelrahman E. Ahmed

Quantum teleportation is a cornerstone protocol for future quantum networks and distributed quantum com- puting. However, scaling teleportation to an arbitrary N- qubit state using conventional methods, which require N separate Bell pairs, presents a significant challenge in terms of both quantum and classical resource overhead. This paper introduces a novel and resource-efficient protocol for tele- porting an arbitrary N-qubit state using a single, pre-shared (N+1)-qubit Greenberger-Horne-Zeilinger (GHZ) state. Our approach reduces the required entangled channel qubits and classical communication bits from O(2N) to N+1, offering a substantial improvement in communication efficiency. The protocol mechanism involves a sequence of local and non-local CNOT gates performed by the sender (Alice), followed by local measurements on her N+1 qubits. The N+1 classical measurement outcomes are then transmitted to the receiver (Bob), who recovers the original quantum state by applying a specific corrective unitary transformation U-f, followed by a set of conditional Pauli gates. We provide a high-level proof of the protocol’s correctness and show that the corrective trans- formation U-f can be implemented efficiently using only local operations on the receiver’s side. Recognizing the practical difficulty of implementing non-local quantum gates between spatially separated nodes, we also propose a modified scheme to enhance near-term feasibility. This practical approach re- locates the non-local operations to a co-located preparation phase, thereby trading the formidable challenge of non-local interactions for a high-fidelity quantum memory requirement. This work analyzes the critical trade-offs between communication efficiency and operational complexity, presenting a vi- able alternative for designing scalable and resource-optimized quantum communication systems.

Novel Intelligent and Leading Emerging Sciences Conference (NILES)•Oct 25, 2025•0 citations
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.
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.
Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous computers impose constraints on cat-entanglement and teleportation operations that can be chosen by an algorithm. We first focus on a special case that only allows cat-entanglements and not teleportations for communication. We provide a two-step heuristic for solving this specialized setting: (i) finding an assignment of qubits to computers using Tabu search, and (ii) using an iterative greedy algorithm designed for a constrained version of the set cover problem to determine cat-entanglement operations required to execute gates locally. For the general case, which allows both forms of communication, we propose two algorithms that subdivide the quantum circuit into several portions and apply the heuristic for the specialized setting on each portion. Teleportations are then used to stitch together the solutions for each portion. Finally, we simulate our algorithms on a wide range of randomly generated quantum networks and circuits, and study the properties of their results with respect to several varying parameters.
We investigate the controlled implementation of a non-local CNOT operation using a three-qubit entangled state. Firstly, we show how the non-local CNOT operation can be implemented with unit fidelity and unit probability by using a maximally entangled GHZ state as controlled quantum channel. Then, we put forward two schemes for conclusively implementing the non-local operation with unit fidelity by employing a partially entangled pure GHZ state as quantum channel. The feature of these schemes is that a third side is included, who may participate the process of quantum non-local implementation as a supervisor. Furthermore, when the quantum channel is partially entangled, the third one can rectify the state distorted by imperfect quantum channel. In addition to the GHZ class state, the W class state can also be used to implement the same non-local operation probabilistically. The probability of successful implementation using the W class state is always less than that using the GHZ class state.
In quantum networks, multipartite entangled states distributed over the network are useful in implementing and supporting many quantum network applications for communications, sensing, and computing. The focus of our work is to de-velop techniques to efficiently generate distributed Greenberger-Horne-Zeilinger (GHZ) states, a special class of multipartite entanglement states. Prior works on generating GHZ states have focused on the objective of minimizing the number of maximally entangled (bipartite) pairs (EPs), while ignoring the stochastic nature of quantum processes and assuming uniform network links for generating EPs. In contrast, in our work, we take into consideration the stochastic nature of quantum networks, and focus on maximizing the expected generated rate of the GHZ states under given fidelity constraints. In this context, we develop two efficient generation schemes, viz., Fusion - Retain - only and General Fusion, comprised of optimal or near-optimal sub-steps. Both schemes, at a high-level, first determine a way to “connect” the nodes over which the GHZ state is to distributed, and then, determine a sequence of fusion operations on the EPs created over the connections. Using extensive simulations over a quantum network simulator (NetSquid), we demonstrate the effectiveness of our developed techniques and show that our schemes outperform prior work as well as a simple centralized approach by up to orders of magnitude while generating GHZ states of tolerable fidelity.
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by entanglement-assisted local operations and classical communication. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. To this end, we extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] implementing each nonlocal controlled-unitary gate locally with one maximally entangled pair to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally using one maximally entangled pair. In particular, two types of packing processes are introduced as the building blocks, namely the distributing processes and embedding processes. Each distributing process distributes corresponding gates locally with one entangled pair. The efficiency of entanglement is then enhanced by embedding processes, which merge two non-sequential distributing processes and hence save the entanglement cost. We show that the structure of distributability and embeddability of a quantum circuit can be fully represented by the corresponding packing graphs and conflict graphs. Based on these graphs, we derive heuristic algorithms for finding an entanglement-efficient packing of distributing processes for a given quantum circuit to be implemented by two parties. These algorithms can determine the required number of local auxiliary qubits in the DQC. We apply these algorithms for bipartite DQC of unitary coupled-cluster circuits and find a significant reduction of entanglement cost through embeddings. This method can determine a constructive upper bound on the entanglement cost for the DQC of quantum circuits.
Quantum teleportation is a cornerstone protocol for future quantum networks and distributed quantum com- puting. However, scaling teleportation to an arbitrary N- qubit state using conventional methods, which require N separate Bell pairs, presents a significant challenge in terms of both quantum and classical resource overhead. This paper introduces a novel and resource-efficient protocol for tele- porting an arbitrary N-qubit state using a single, pre-shared (N+1)-qubit Greenberger-Horne-Zeilinger (GHZ) state. Our approach reduces the required entangled channel qubits and classical communication bits from O(2N) to N+1, offering a substantial improvement in communication efficiency. The protocol mechanism involves a sequence of local and non-local CNOT gates performed by the sender (Alice), followed by local measurements on her N+1 qubits. The N+1 classical measurement outcomes are then transmitted to the receiver (Bob), who recovers the original quantum state by applying a specific corrective unitary transformation U-f, followed by a set of conditional Pauli gates. We provide a high-level proof of the protocol’s correctness and show that the corrective trans- formation U-f can be implemented efficiently using only local operations on the receiver’s side. Recognizing the practical difficulty of implementing non-local quantum gates between spatially separated nodes, we also propose a modified scheme to enhance near-term feasibility. This practical approach re- locates the non-local operations to a co-located preparation phase, thereby trading the formidable challenge of non-local interactions for a high-fidelity quantum memory requirement. This work analyzes the critical trade-offs between communication efficiency and operational complexity, presenting a vi- able alternative for designing scalable and resource-optimized quantum communication systems.