Quantum routing with teleportation

被引：2
作者：
Devulapalli, Dhruv [1 ,2 ]
Schoute, Eddie [1 ,3 ,4 ,5 ]
Bapat, Aniruddha [1 ,2 ,6 ]
Childs, Andrew M. [1 ,4 ,5 ]
Gorshkov, Alexey, V [1 ,2 ]
机构：
[1] Univ Maryland, Joint Ctr Quantum Informat & Comp Sci, NIST, College Pk, MD 20742 USA
[2] Univ Maryland, Joint Quantum Inst, NIST, College Pk, MD 20742 USA
[3] Los Alamos Natl Lab, Comp Computat & Stat Sci Div, Los Alamos, NM 87545 USA
[4] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA
[5] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[6] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA
来源：
PHYSICAL REVIEW RESEARCH | 2024年 / 6卷 / 03期
关键词：
ENTANGLEMENT; COMPUTATION; GRAPHS;
D O I：
10.1103/PhysRevResearch.6.033313
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
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(root 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.
引用
收藏
页数：12
相关论文
共 43 条
[1]   ROUTING PERMUTATIONS ON GRAPHS VIA MATCHINGS [J].
ALON, N ;
CHUNG, FRK ;
GRAHAM, RL .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (03) :513-530
[2]   Quantum supremacy using a programmable superconducting processor [J].
Arute, Frank ;
Arya, Kunal ;
Babbush, Ryan ;
Bacon, Dave ;
Bardin, Joseph C. ;
Barends, Rami ;
Biswas, Rupak ;
Boixo, Sergio ;
Brandao, Fernando G. S. L. ;
Buell, David A. ;
Burkett, Brian ;
Chen, Yu ;
Chen, Zijun ;
Chiaro, Ben ;
Collins, Roberto ;
Courtney, William ;
Dunsworth, Andrew ;
Farhi, Edward ;
Foxen, Brooks ;
Fowler, Austin ;
Gidney, Craig ;
Giustina, Marissa ;
Graff, Rob ;
Guerin, Keith ;
Habegger, Steve ;
Harrigan, Matthew P. ;
Hartmann, Michael J. ;
Ho, Alan ;
Hoffmann, Markus ;
Huang, Trent ;
Humble, Travis S. ;
Isakov, Sergei V. ;
Jeffrey, Evan ;
Jiang, Zhang ;
Kafri, Dvir ;
Kechedzhi, Kostyantyn ;
Kelly, Julian ;
Klimov, Paul V. ;
Knysh, Sergey ;
Korotkov, Alexander ;
Kostritsa, Fedor ;
Landhuis, David ;
Lindmark, Mike ;
Lucero, Erik ;
Lyakh, Dmitry ;
Mandra, Salvatore ;
McClean, Jarrod R. ;
McEwen, Matthew ;
Megrant, Anthony ;
Mi, Xiao .
NATURE, 2019, 574 (7779) :505-+
[3]   Advantages and Limitations of Quantum Routing [J].
Bapat, Aniruddha ;
Childs, Andrew M. ;
Gorshkov, Alexey V. ;
Schoute, Eddie .
PRX QUANTUM, 2023, 4 (01)
[4]   Quantum routing with fast reversals [J].
Bapat, Aniruddha ;
Childs, Andrew M. ;
V. Gorshkov, Alexey ;
King, Samuel ;
Schoute, Eddie ;
Shastri, Hrishee .
QUANTUM, 2021, 5
[5]   Purification of noisy entanglement and faithful teleportation via noisy channels [J].
Bennett, CH ;
Brassard, G ;
Popescu, S ;
Schumacher, B ;
Smolin, JA ;
Wootters, WK .
PHYSICAL REVIEW LETTERS, 1996, 76 (05) :722-725
[6]   Surface Code Compilation via Edge-Disjoint Paths [J].
Beverland, Michael ;
Kliuchnikov, Vadym ;
Schoute, Eddie .
PRX QUANTUM, 2022, 3 (02)
[7]   Quantum communication through an unmodulated spin chain [J].
Bose, S .
PHYSICAL REVIEW LETTERS, 2003, 91 (20)
[8]   Lieb-robinson bounds and the generation of correlations and topological quantum order [J].
Bravyi, S. ;
Hastings, M. B. ;
Verstraete, F. .
PHYSICAL REVIEW LETTERS, 2006, 97 (05)
[9]   Quantum Low-Density Parity-Check Codes [J].
Breuckmann, Nikolas P. ;
Eberhardt, Jens Niklas .
PRX QUANTUM, 2021, 2 (04)
[10]   Quantum repeaters:: The role of imperfect local operations in quantum communication [J].
Briegel, HJ ;
Dür, W ;
Cirac, JI ;
Zoller, P .
PHYSICAL REVIEW LETTERS, 1998, 81 (26) :5932-5935
12345