DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Quantum routing with teleportation

Journal Article · · Physical Review Research

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Sponsoring Organization:
USDOE
Grant/Contract Number:
SC0019040; SC0020312; SC0019449; SC0024220; SC0019040
OSTI ID:
2447009
Journal Information:
Physical Review Research, Journal Name: Physical Review Research Journal Issue: 3 Vol. 6; ISSN 2643-1564; ISSN PPRHAI
Publisher:
American Physical SocietyCopyright Statement
Country of Publication:
United States
Language:
English

References (34)

The finite group velocity of quantum spin systems journal September 1972
Optimal numberings and isoperimetric problems on graphs journal January 1966
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations journal November 1999
Routing entanglement in the quantum internet journal March 2019
Dual-species, multi-qubit logic primitives for Ca+/Sr+ trapped-ion crystals journal November 2019
Entanglement generation in a quantum network at distance-independent rate journal May 2022
A quantum router architecture for high-fidelity entanglement flows in quantum networks journal June 2022
Quantum supremacy using a programmable superconducting processor journal October 2019
Topological quantum memory journal September 2002
Spectral Graph Theory book January 1997
Quantum Low-Density Parity-Check Codes journal October 2021
Surface Code Compilation via Edge-Disjoint Paths journal May 2022
Advantages and Limitations of Quantum Routing journal February 2023
Quantum computation with quantum dots journal January 1998
Perfect transfer of arbitrary states in quantum spin networks journal March 2005
Quantum Circuits Assisted by Local Operations and Classical Communication: Transformations and Phases of Matter journal November 2021
‘‘Event-ready-detectors’’ Bell experiment via entanglement swapping journal December 1993
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels journal January 1996
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication journal December 1998
Quantum Communication through an Unmodulated Spin Chain journal November 2003
Lieb-Robinson Bounds and the Generation of Correlations and Topological Quantum Order journal July 2006
Entanglement bounds on the performance of quantum computing architectures journal August 2020
Long-Range Entanglement from Measuring Symmetry-Protected Topological Phases journal June 2024
Quantum LDPC Codes With Almost Linear Minimum Distance journal January 2022
Quantum Register Based on Individual Electronic and Nuclear Spin Qubits in Diamond journal June 2007
Scaling the Ion Trap Quantum Processor journal March 2013
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes journal January 2010
Routing Permutations on Graphs via Matchings journal May 1994
Optimal Bounds for Matching Routing on Trees journal January 1999
Quantum linear network coding for entanglement distribution in restricted architectures journal November 2020
Quantum routing with fast reversals journal August 2021
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth journal November 2013
Efficient implementation of quantum circuits with limited qubit interactions journal November 2017
On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity journal August 2020

Similar Records

Addendum: Dielectron production in proton-proton and proton-lead collisions at s N N = 5.02 TeV
Journal Article · 2025 · Physical Review. C · OSTI ID:2512422

Superconducting Levitated Detector of Gravitational Waves
Journal Article · 2025 · Physical Review Letters · OSTI ID:2564731

Tetraquarks from intrinsic heavy quarks
Journal Article · 2024 · Physical Review. D. · OSTI ID:2475210

Related Subjects