[Paper Review] Shortcuts to quantum network routing

Eddie Schoute, Laura Mančinska+3 more|arXiv (Cornell University)|Oct 17, 2016

Quantum Information and CryptographyComputer Science14 references86 citations

TL;DR

This paper introduces a novel abstraction for quantum networks using virtual quantum links (VQLs) formed via pre-shared entanglement, enabling efficient qubit routing through hierarchical algorithms. It presents routing schemes for ring and sphere topologies that require only O(log N) qubit storage per node, O(polylog N) time and space for routing decisions, and O(log N) timesteps to replenish entanglement, offering scalable, practical solutions for quantum network management with minimal quantum resources.

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 order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.

Motivation & Objective

• To address the challenge of efficient qubit routing in quantum networks with limited qubit storage and noisy, one-time-use entangled links.
• To develop practical routing protocols that minimize quantum resource usage while enabling long-distance quantum communication.
• To abstract quantum network operations using virtual quantum links (VQLs) as reusable shortcuts formed via entanglement swapping and teleportation.
• To design hierarchical routing algorithms that scale efficiently with network size, particularly for ring and sphere topologies.
• To model entanglement replenishment and dynamic link management to maintain network robustness under resource constraints.

Proposed method

• Abstracts quantum networks as graphs where physical links connect nearby nodes and virtual quantum links (VQLs) are created via entanglement swapping between neighboring nodes.
• Models VQLs as one-time-use virtual channels formed from pre-shared EPR pairs, enabling quantum teleportation of qubits across long distances.
• Designs hierarchical routing algorithms that use local information and labeling schemes to compute shortest paths in O(polylog N) time and space.
• Introduces a dynamic model for entanglement replenishment, where VQLs are re-established in O(log N) timesteps after use.
• Uses weighted graphs to model link costs, assigning infinite weight to used VQLs until replenished, enabling collision avoidance.
• Applies graph-theoretic abstractions—such as recursive subdivision of squares for sphere approximation—to construct scalable routing graphs.

Experimental results

Research questions

• RQ1 How can quantum networks be abstracted using virtual quantum links (VQLs) to simplify routing while respecting quantum constraints like one-time use and no cloning?
• RQ2 What is the minimal quantum resource cost (qubit storage, time, and space) required to implement scalable routing in structured quantum network topologies?
• RQ3 How can entanglement be efficiently replenished after use to maintain network throughput and minimize latency?
• RQ4 Can hierarchical routing schemes achieve logarithmic scaling in storage and computation time for quantum networks of size N?
• RQ5 How can classical network concepts like shortest path routing and dynamic link weighting be adapted to the quantum domain with unique constraints such as irreversible link usage?

Key findings

• The proposed routing algorithms require only O(log N) qubits of storage per network node, significantly reducing resource demands for large-scale quantum networks.
• Routing decisions are computed in O(polylog N) time and space, enabling efficient, scalable operation even in large networks.
• Entanglement replenishment is achieved in O(log N) timesteps, ensuring rapid recovery of virtual quantum links after use.
• For ring and sphere topologies, the hierarchical routing schemes achieve optimal path selection using shortest path algorithms on abstracted VQL graphs.
• The model successfully captures classical network abstractions—such as dynamic link weighting and path cost minimization—while respecting quantum constraints like irreversible link usage and no quantum cloning.
• The framework supports practical implementation by focusing on basic quantum operations (entanglement swapping, teleportation) and avoiding complex multi-node entanglement, which is fragile and resource-intensive.