Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Routing

Rodney Van Meter

Published Apr 14, 2014• 0 citations
Publisher

Abstract

In a complex network of heterogeneous links, selection of a path between the two communicating nodes is an important problem. This chapter examines a form of Dijkstra's algorithm adapted for repeater networks. It investigates critical problems in the use of purify-and swap repeater networks. The focus has been on the path selection and the need for a routing algorithm. An acceptable routing algorithm is an easy-to-calculate metric that reliably chooses a reasonable, if not optimal, path. The chapter discusses the differences between quantum and classical networks and the difficulties encountered. After defining the problems in path selection and proposing several solutions, the chapter evaluates those solutions via simulations that answer a series of specific questions about the behavior of quantum repeater networks. The results show that, despite many important differences, quantum repeater networks behave similarly to classical networks in useful ways, but the classical principles cannot be applied without thought.

DOI
10.1002/9781118648919.ch14

Related papers

Routing in Non-Isotonic Quantum Networks

Maxwell Tang, Garrett Hinkley, Kenneth Goodenough +2 more

Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility functions that are isotonic, meaning that the ordering of two paths does not change when extending both with the same edge. However, we show that utility functions that take into account both the rate and quality of the entanglement generation (e.g., the secret-key rate) are often non-isotonic. This makes pathfinding difficult as classical algorithms such as Dijkstra's become unsuitable, with the state of the art for quantum networks being an exhaustive search over all possible paths. In this work we present improved algorithms. First, we present two best-first-search algorithms that use destination-aware merit functions for faster convergence. One of these provably finds the best path, while the other uses heuristics to achieve an effectively sublinear scaling of the query count in the network size while in practice always finding a close-to-optimal path. Second, we present metaheuristic algorithms (simulated annealing and a genetic algorithm) that enable tuning a tradeoff between path quality and computational overhead. While we focus on swap-ASAP quantum repeaters for concreteness, our algorithms are readily generalized to different repeater schemes and models.

quant-pharXiv:2511.20628•IEEE Transactions on Quantum Engineering•Nov 26, 2025•0 citations

Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

Sara Santos, Francisco A. Monteiro, Bruno Coelho Coutinho +1 more

A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest-path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.

IEEE Access•Jan 1, 2023•21 citations

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations

Quantum Network on Graph

Savo Glisic, Beatriz Lorenzo

This chapter addresses the optimal routing problem for generic quantum network architectures comprising repeaters operating through single atoms in optical cavities. It discusses a stochastic framework to model entanglement generation. The chapter presents the closed-form expression of the end-to-end entanglement rate for an arbitrary path and an efficient algorithm for entanglement rate computation. It also presents a routing protocol and discusses its optimality when used in conjunction with the entanglement rate as a routing metric. Quantum state transfer from one location to another is a significant problem for quantum information processing systems. Quantum state transfer is an important part of quantum computer design. The chapter provides the discussion on quantum perfect state transfer by considering a quantum walk in the network represented by a symmetric graph. The discrete-time model of quantum random walks is only one way to intersperse quantum effects with random walks.

Wiley eBooks•Feb 14, 2022•0 citations

Overview

Rodney Van Meter

This book builds an understanding of quantum information, quantum repeaters and classical networking thorough enough to propose and evaluate quantum internet architecture, including writing the classical software implementing the protocols. This chapter provides an overview of quantum information, quantum repeaters and network architectures. To understand teleportation and distributed quantum information in principle, only a few concepts are required: superposition, measurement, interference, entanglement, no-signaling and no-cloning. The chapter discusses the physical components that make up a link, before moving to arranging multiple links into a chain, then a network. It discusses some of the difficult problems in networks as they scale up in the number of nodes and links: heterogeneity, autonomy of management, naming, resource management and path selection and control. The quantum internet, once realized, will allow us to exploit entanglement over long distances for new computational capabilities and for new physical capabilities such as eavesdropping detection.

Wiley eBooks•Apr 14, 2014•0 citations

Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters

Vinay Kumar

The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations. This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information. At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed. Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.

quant-pharXiv:2606.22316•Jun 23, 2026•1 citation
In a complex network of heterogeneous links, selection of a path between the two communicating nodes is an important problem. This chapter examines a form of Dijkstra's algorithm adapted for repeater networks. It investigates critical problems in the use of purify-and swap repeater networks. The focus has been on the path selection and the need for a routing algorithm. An acceptable routing algorithm is an easy-to-calculate metric that reliably chooses a reasonable, if not optimal, path. The chapter discusses the differences between quantum and classical networks and the difficulties encountered. After defining the problems in path selection and proposing several solutions, the chapter evaluates those solutions via simulations that answer a series of specific questions about the behavior of quantum repeater networks. The results show that, despite many important differences, quantum repeater networks behave similarly to classical networks in useful ways, but the classical principles cannot be applied without thought.
Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility functions that are isotonic, meaning that the ordering of two paths does not change when extending both with the same edge. However, we show that utility functions that take into account both the rate and quality of the entanglement generation (e.g., the secret-key rate) are often non-isotonic. This makes pathfinding difficult as classical algorithms such as Dijkstra's become unsuitable, with the state of the art for quantum networks being an exhaustive search over all possible paths. In this work we present improved algorithms. First, we present two best-first-search algorithms that use destination-aware merit functions for faster convergence. One of these provably finds the best path, while the other uses heuristics to achieve an effectively sublinear scaling of the query count in the network size while in practice always finding a close-to-optimal path. Second, we present metaheuristic algorithms (simulated annealing and a genetic algorithm) that enable tuning a tradeoff between path quality and computational overhead. While we focus on swap-ASAP quantum repeaters for concreteness, our algorithms are readily generalized to different repeater schemes and models.
A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure based on quantum repeaters and with a finite number of pairs of entangled qubits available in each link. The network model considers that link purification is available such that a nested purification protocol can be applied at each link to generate entangled qubits with higher fidelity than the original ones. A low-complexity multi-objective routing algorithm to find the shortest path between any two given nodes is proposed and assessed for random networks, using a fairly general path extension mechanism that can fit a large family of particular technological requirements. Different types of quantum protocols require different levels of fidelity for the entangled qubit pairs. For that reason, the proposed algorithm identifies the shortest path between two nodes that assures an end-to-end fidelity above a specified threshold. The minimum requirements for the end-to-end entanglement fidelity depend on the whole extension of the paths, and cannot be looked at as a local property of each link. Moreover, one needs to keep track not only of the shortest path, but also of longer paths holding more entangled qubits than the shorter paths in order to satisfy the fidelity criterion. Thus, standard single parameter shortest-path algorithms do not necessarily converge to the optimal solution. The problem of finding the best path in a network subject to multiple criteria (known as multi-objective routing) is, in general, an NP-hard problem due to the rapid growth of the number of stored paths. This work proposes a metric that identifies and discards paths that are objectively worse than others. By doing so, the time complexity of the proposed algorithm scales near-to-linearly with respect to the number of nodes in the network, showing that the shortest-path problem in quantum networks can be solved with a complexity very close to the one of the classical counterparts. That is analytically proved for the case where all the links of a path have the same fidelity (homogeneous model). The algorithm is also adapted to a particular type of path extension, where different links along a path can be purified to different degrees, asserting its flexibility and near-to-linearity even when heterogeneous fidelities along the sections of a path are considered.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.
This chapter addresses the optimal routing problem for generic quantum network architectures comprising repeaters operating through single atoms in optical cavities. It discusses a stochastic framework to model entanglement generation. The chapter presents the closed-form expression of the end-to-end entanglement rate for an arbitrary path and an efficient algorithm for entanglement rate computation. It also presents a routing protocol and discusses its optimality when used in conjunction with the entanglement rate as a routing metric. Quantum state transfer from one location to another is a significant problem for quantum information processing systems. Quantum state transfer is an important part of quantum computer design. The chapter provides the discussion on quantum perfect state transfer by considering a quantum walk in the network represented by a symmetric graph. The discrete-time model of quantum random walks is only one way to intersperse quantum effects with random walks.
This book builds an understanding of quantum information, quantum repeaters and classical networking thorough enough to propose and evaluate quantum internet architecture, including writing the classical software implementing the protocols. This chapter provides an overview of quantum information, quantum repeaters and network architectures. To understand teleportation and distributed quantum information in principle, only a few concepts are required: superposition, measurement, interference, entanglement, no-signaling and no-cloning. The chapter discusses the physical components that make up a link, before moving to arranging multiple links into a chain, then a network. It discusses some of the difficult problems in networks as they scale up in the number of nodes and links: heterogeneity, autonomy of management, naming, resource management and path selection and control. The quantum internet, once realized, will allow us to exploit entanglement over long distances for new computational capabilities and for new physical capabilities such as eavesdropping detection.
The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations. This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information. At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed. Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.