REVIEW 8 cited by
Generalized GHZ States and Distributed Quantum Computing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 8 Pith papers
-
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...
-
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-...
-
Adaptive Quantum Computers: decoding and state preparation
Adaptive quantum computers, mixing quantum circuits with classical parity processing, provably separate from classical shallow circuits on Hadamard list decoding and also prepare standard quantum states more efficiently.
-
A Class of Multipartite Entangled States Based on State Transitions
T states defined by transition counts are proven unitarily equivalent to Dicke states using CX operations.
-
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.
-
Towards an Optimally Distributed Quantum Fourier Transform Circuit
Presents an optimal gate-packing partitioning scheme for the QFT that aims to minimize e-bit count in distributed quantum systems and validates it on hardware.
-
Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors
A window-based circuit partitioning heuristic with dynamic one-way teleportation reduces EPR pairs versus a static baseline, and a structured QFT distribution uses nm/2 EPR pairs on m processors.
-
Experimental Quantification of Layered Error Suppression in Fiber-Interconnected Quantum Data Centers
Experiments on fiber-interconnected superconducting QPUs show over 20% operational fidelity gain via layered error mitigation under realistic noise.
Discussion (0). Continue with ORCID to comment.