Generalized GHZ States and Distributed Quantum Computing
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms
Adversaries perturbing shared entanglement in distributed VQAs can manipulate a new Kraus expressibility metric to keep gradients large but steer training to incorrect solutions.
-
dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers
dSABRE cuts geometric-mean EPR consumption by 41-44% versus TeleSABRE on 18 benchmark circuits through intra-core priority, a five-term teleportation scorer with capacity penalty, proactive congestion relief, and BFS-...
-
Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit
A tunable parallel amplitude estimation algorithm achieves near-Heisenberg query scaling and logarithmic depth via GHZ states and quantum signal processing, with a near-optimality proof using the parallel quantum adve...
-
Transversal Fault Tolerant Distributed Quantum Computing Operations
Simulations show non-local CNOT achieves up to 10x lower logical error than teleportation and distributed qLDPC needs d≈11 at p=10^{-4} or d≈29 at p=10^{-3} (with p_ebit=10p) for <10^{-12} error.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.