Shortcuts to quantum network routing
Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis,, Stephanie Wehner

TL;DR
This paper introduces an abstraction for quantum network routing that leverages entanglement as virtual links, proposing hierarchical algorithms for efficient qubit routing in ring and sphere topologies.
Contribution
It develops a new quantum network abstraction and presents hierarchical routing schemes requiring minimal qubit storage and efficient decision-making for quantum communication.
Findings
Routing algorithms require O(log N) qubits per node.
Algorithms operate in O(polylog N) time and space.
Efficient entanglement replenishment in O(log N) timesteps.
Abstract
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
