Quantum Routing with Teleportation
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929509957107712 |
|---|---|
| author | Devulapalli, Dhruv Schoute, Eddie Bapat, Aniruddha Childs, Andrew M. Gorshkov, Alexey V. |
| author_facet | Devulapalli, Dhruv Schoute, Eddie Bapat, Aniruddha Childs, Andrew M. Gorshkov, Alexey V. |
| contents | 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(\sqrt{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_04185 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Quantum Routing with Teleportation Devulapalli, Dhruv Schoute, Eddie Bapat, Aniruddha Childs, Andrew M. Gorshkov, Alexey V. Quantum Physics 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(\sqrt{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. |
| title | Quantum Routing with Teleportation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2204.04185 |