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

arXiv:2607.07539 · PRX Quantum

A Dynamic Multiplexing Policy for a Quantum Repeater

Jeroen Grimbergen, Sounak Kar, Michal van Hooft, Conor Bradley, Stephanie Wehner

quant-phSubmitted Jul 8, 2026• Announced Jul 9, 2026• 0 citations
arXivHTMLPDF

Abstract

We consider a multiplexed quantum repeater that distributes entanglement between two end nodes. Multiplexing is achieved through optical integration of many quantum chips. Each chip hosts an optically addressable communication qubit and a separate memory qubit. The communication qubit serves as an entanglement generation interface between different quantum chips, and the memory qubit can be used to store entanglement. The quantum chips on the repeater are interconnected using a reconfigurable router, which makes it possible to dynamically assign quantum chips for entanglement generation with either of the two end nodes in every end-to-end communication cycle. We propose a dynamic multiplexing policy in which after an entangled link has been established with one of the end nodes, all remaining quantum chips are assigned to the opposite end node. We compare this dynamic policy to a policy in which the assignment of quantum chips to end nodes is fixed. We consider a parameter regime where on average less than one entangled link is generated per end-to-end communication cycle, which is the relevant regime for near-term quantum networks. We show that in this regime, the dynamic multiplexing policy can lead to a significant improvement in fidelity over a fixed policy, while marginally improving the rate. Moreover, even though the dynamic multiplexing policy requires a deeper, and hence, more lossy, router than the fixed policy, it can still achieve higher secret key rates in the parameter regime studied. This makes dynamic multiplexing with a many-quantum-chip repeater especially relevant for the development of near-term quantum networks.

Related papers

Balancing Quantum Memories in Asymmetric Repeaters for High-Fidelity Entanglement Distribution

Karim S. Elsayed, Amr Rizk

At the core of the quantum Internet lie quantum repeaters that enable remote end-to-end entanglement generation. Fundamentally, the entanglement generation rate and fidelity of quantum repeaters constitute the bottleneck for end-to-end performance. To achieve high rates, quantum repeaters employ quantum memory multiplexing. In a high-rate standard repeater, each memory sequentially generates an entanglement with its neighboring nodes and then applies entanglement swapping. This, however, results in low fidelity due to decoherence of the first-formed entanglement in the sequential generation process. By allocating different numbers of memories to simultaneously form entanglements with the left and right adjacent nodes, quantum repeaters reduce high waiting times and achieve high fidelity. In such a repeater, a mismatch problem arises due to the difference between the probabilistic number of generated entanglements on both sides. Consequently, some entanglements remain stored until opposite entanglements are available. The mismatch problem reduces the repeater rate and particularly the entanglement fidelity. In this paper, we consider the mismatch problem in an asymmetric repeater with different distances to its adjacent nodes. To mitigate the mismatch problem, we derive a dynamic optimal memory allocation. Under the optimal allocation, we derive statistical lower bounds on the achievable rate and fidelity. We demonstrate that the optimal allocation significantly improves the fidelity while maintaining a comparable rate to the standard repeater. In contrast, our results show that fixed memory allocation may be detrimental to the fidelity.

quant-pharXiv:2604.24554•Apr 28, 2026•1 citation

A quantum router architecture for high-fidelity entanglement flows in quantum networks

Yuan Lee, Eric A. Bersin, Axel Dahlberg +2 more

Abstract The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but an open challenge is to maintain entanglement fidelity over long-distance links. Here, we address this with a quantum router architecture comprising many quantum memories connected in a photonic switchboard to broker entanglement flows across quantum networks. We compute the rate and fidelity of entanglement distribution under this architecture using an event-based simulator, finding that the router improves the entanglement fidelity as multiplexing depth increases without a significant drop in the entanglement distribution rate. Specifically, the router permits channel-loss-invariant fidelity, i.e. the same fidelity achievable with lossless links. Furthermore, this scheme automatically prioritizes entanglement flows across the full network without requiring global network information. The proposed architecture uses present-day photonic technology, opening a path to near-term deployable multi-node quantum networks.

arXiv:2005.01852•npj Quantum Information•Jun 29, 2022•125 citations

Scalable entanglement distribution using encoded hybrid repeater chains

Stav Haldar, Saikat Guha, Don Towsley +1 more

Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the $[[7,1,3]]$ Steane code, and the $[[9,1,3]]$ Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.

quant-pharXiv:2609.19783•Sep 18, 2026•0 citations

Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies

Stav Haldar, Pratik J. Barge, Xiang Cheng +5 more

Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation strategies for long-distance entanglement distribution. In this work, we focus on quasi-local policies for multiplexed quantum repeater chains. In fully-local policies, nodes use the knowledge of only their own states, whereas more efficient global policies use knowledge of the entire network state. The classical communication costs of using this knowledge have not been explored in existing literature. We show that quasi-local policies not only obtain improved performance over local policies, but also reduce classical communication costs considerably. Our policies also outperform the widely studied nested purification and doubling policy in practical parameter regimes. We identify parameter regimes where distillation is useful and address the question: “Should we distill before swapping, or vice versa?” Finally, we propose an implementation scheme for a multiplexed repeater chain, experimentally demonstrate the key element, a high-dimensional biphoton frequency comb, and evaluate its anticipated performance using our multiplexing-based policies. Fast and reliable entanglement distribution in quantum networks requires multiplexing to enhance rates and distillation to compensate the loss in fidelity. Classical communication latency associated with both swapping and distillation protocols is a significant hurdle, which the authors address by proposing a class of quasi-local entanglement distribution policies for multiplexed repeater chains.

arXiv:2401.13168•Communications Physics•Apr 1, 2025•30 citations

Entanglement Routing Over Networks With Time Multiplexed Repeaters

Emily A. Van Milligen, Eliana Jacobson, Ashlesha Patil +3 more

Quantum networks will enable long-distance entanglement distribution through repeater nodes capable of both generating external Bell pairs with their neighbors—independently and identically distributed (i.i.d.) with probability p—and performing internal Bell State Measurements (BSMs), which succeed with probability q. These probabilities depend on the specific experimental parameters of the network. While global link state knowledge can maximize entanglement generation rates between any two consumers, it is often impractical due to the network's dynamic nature. This work evaluates a multipath routing protocol based on local link state knowledge, designed for time-multiplexed repeaters that can perform BSMs across different time steps. We employ simulations across various network topologies to characterize how consumer placement and network topology influence the utility of dynamic and static routing strategies. Results show that increasing the time multiplexing block length, k, enhances the average entanglement generation rate, though at the cost of higher initial latency. When a step-function memory decoherence model is introduced—where qubits are stored in quantum memory for a time that follows an exponential distribution—an optimal k emerges. As p decreases or the average memory lifetime increases, this optimal k grows, reflecting a trade-off where the advantages of time multiplexing must be balanced against the heightened risk of losing previously established entangled pairs.

arXiv:2308.15028•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•12 citations

Complete analysis of a realistic fiber-based quantum repeater scheme

Adam Kinos, Andreas Walther, Stefan Kröll +1 more

We present a quantum repeater protocol for distributing entanglement over long distances, where a dedicated communication stage enables trial rates not limited by the travel time between repeater nodes. To accomplish this, each node contains several qubits that can couple to one single-photon emitter. Photons from the emitters in neighboring nodes generate heralded entanglement between qubits in these nodes. The protocol leaves the emitters disentangled from the rest of the system immediately after emitting the photons, thus allowing them to be reused to entangle other qubits without waiting for the repeater link round-trip time. This time multiplexing increases the protocol trial rate by up to an order of magnitude. The protocol is then combined with conventional deterministic entanglement swapping and heralded entanglement purification to extend the entanglement distance and reduce the entanglement error, respectively. We perform a complete protocol analysis by considering all relevant error sources, such as initialization, two-qubit gate, and qubit measurement errors, as well as the exponential decoherence of the qubits with time. The latter is particularly important since we analyze the protocol performance for a broad range of experimental parameters and obtain secret key rates ranging from 1 to 1000 Hz at a distance of 1000 km. Our results suggest that it is important to reach a qubit memory coherence time of around 1 s, and two-qubit gate and measurement errors on the order of 10 − 3 to obtain reasonable secret key rates over distances longer than achievable with direct transmission. While this work focuses on optimizing secret key rates, the protocol can also be used for Einstein-Podolsky-Rosen pair generation and is thus also relevant for, e.g., distributed quantum computing.

arXiv:2309.04151•Physical Review Research•Aug 5, 2025•5 citations
We consider a multiplexed quantum repeater that distributes entanglement between two end nodes. Multiplexing is achieved through optical integration of many quantum chips. Each chip hosts an optically addressable communication qubit and a separate memory qubit. The communication qubit serves as an entanglement generation interface between different quantum chips, and the memory qubit can be used to store entanglement. The quantum chips on the repeater are interconnected using a reconfigurable router, which makes it possible to dynamically assign quantum chips for entanglement generation with either of the two end nodes in every end-to-end communication cycle. We propose a dynamic multiplexing policy in which after an entangled link has been established with one of the end nodes, all remaining quantum chips are assigned to the opposite end node. We compare this dynamic policy to a policy in which the assignment of quantum chips to end nodes is fixed. We consider a parameter regime where on average less than one entangled link is generated per end-to-end communication cycle, which is the relevant regime for near-term quantum networks. We show that in this regime, the dynamic multiplexing policy can lead to a significant improvement in fidelity over a fixed policy, while marginally improving the rate. Moreover, even though the dynamic multiplexing policy requires a deeper, and hence, more lossy, router than the fixed policy, it can still achieve higher secret key rates in the parameter regime studied. This makes dynamic multiplexing with a many-quantum-chip repeater especially relevant for the development of near-term quantum networks.
At the core of the quantum Internet lie quantum repeaters that enable remote end-to-end entanglement generation. Fundamentally, the entanglement generation rate and fidelity of quantum repeaters constitute the bottleneck for end-to-end performance. To achieve high rates, quantum repeaters employ quantum memory multiplexing. In a high-rate standard repeater, each memory sequentially generates an entanglement with its neighboring nodes and then applies entanglement swapping. This, however, results in low fidelity due to decoherence of the first-formed entanglement in the sequential generation process. By allocating different numbers of memories to simultaneously form entanglements with the left and right adjacent nodes, quantum repeaters reduce high waiting times and achieve high fidelity. In such a repeater, a mismatch problem arises due to the difference between the probabilistic number of generated entanglements on both sides. Consequently, some entanglements remain stored until opposite entanglements are available. The mismatch problem reduces the repeater rate and particularly the entanglement fidelity. In this paper, we consider the mismatch problem in an asymmetric repeater with different distances to its adjacent nodes. To mitigate the mismatch problem, we derive a dynamic optimal memory allocation. Under the optimal allocation, we derive statistical lower bounds on the achievable rate and fidelity. We demonstrate that the optimal allocation significantly improves the fidelity while maintaining a comparable rate to the standard repeater. In contrast, our results show that fixed memory allocation may be detrimental to the fidelity.
Abstract The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but an open challenge is to maintain entanglement fidelity over long-distance links. Here, we address this with a quantum router architecture comprising many quantum memories connected in a photonic switchboard to broker entanglement flows across quantum networks. We compute the rate and fidelity of entanglement distribution under this architecture using an event-based simulator, finding that the router improves the entanglement fidelity as multiplexing depth increases without a significant drop in the entanglement distribution rate. Specifically, the router permits channel-loss-invariant fidelity, i.e. the same fidelity achievable with lossless links. Furthermore, this scheme automatically prioritizes entanglement flows across the full network without requiring global network information. The proposed architecture uses present-day photonic technology, opening a path to near-term deployable multi-node quantum networks.
Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the [[7,1,3]][[7,1,3]][[7,1,3]] Steane code, and the [[9,1,3]][[9,1,3]][[9,1,3]] Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.
Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation strategies for long-distance entanglement distribution. In this work, we focus on quasi-local policies for multiplexed quantum repeater chains. In fully-local policies, nodes use the knowledge of only their own states, whereas more efficient global policies use knowledge of the entire network state. The classical communication costs of using this knowledge have not been explored in existing literature. We show that quasi-local policies not only obtain improved performance over local policies, but also reduce classical communication costs considerably. Our policies also outperform the widely studied nested purification and doubling policy in practical parameter regimes. We identify parameter regimes where distillation is useful and address the question: “Should we distill before swapping, or vice versa?” Finally, we propose an implementation scheme for a multiplexed repeater chain, experimentally demonstrate the key element, a high-dimensional biphoton frequency comb, and evaluate its anticipated performance using our multiplexing-based policies. Fast and reliable entanglement distribution in quantum networks requires multiplexing to enhance rates and distillation to compensate the loss in fidelity. Classical communication latency associated with both swapping and distillation protocols is a significant hurdle, which the authors address by proposing a class of quasi-local entanglement distribution policies for multiplexed repeater chains.
Quantum networks will enable long-distance entanglement distribution through repeater nodes capable of both generating external Bell pairs with their neighbors—independently and identically distributed (i.i.d.) with probability p—and performing internal Bell State Measurements (BSMs), which succeed with probability q. These probabilities depend on the specific experimental parameters of the network. While global link state knowledge can maximize entanglement generation rates between any two consumers, it is often impractical due to the network's dynamic nature. This work evaluates a multipath routing protocol based on local link state knowledge, designed for time-multiplexed repeaters that can perform BSMs across different time steps. We employ simulations across various network topologies to characterize how consumer placement and network topology influence the utility of dynamic and static routing strategies. Results show that increasing the time multiplexing block length, k, enhances the average entanglement generation rate, though at the cost of higher initial latency. When a step-function memory decoherence model is introduced—where qubits are stored in quantum memory for a time that follows an exponential distribution—an optimal k emerges. As p decreases or the average memory lifetime increases, this optimal k grows, reflecting a trade-off where the advantages of time multiplexing must be balanced against the heightened risk of losing previously established entangled pairs.
We present a quantum repeater protocol for distributing entanglement over long distances, where a dedicated communication stage enables trial rates not limited by the travel time between repeater nodes. To accomplish this, each node contains several qubits that can couple to one single-photon emitter. Photons from the emitters in neighboring nodes generate heralded entanglement between qubits in these nodes. The protocol leaves the emitters disentangled from the rest of the system immediately after emitting the photons, thus allowing them to be reused to entangle other qubits without waiting for the repeater link round-trip time. This time multiplexing increases the protocol trial rate by up to an order of magnitude. The protocol is then combined with conventional deterministic entanglement swapping and heralded entanglement purification to extend the entanglement distance and reduce the entanglement error, respectively. We perform a complete protocol analysis by considering all relevant error sources, such as initialization, two-qubit gate, and qubit measurement errors, as well as the exponential decoherence of the qubits with time. The latter is particularly important since we analyze the protocol performance for a broad range of experimental parameters and obtain secret key rates ranging from 1 to 1000 Hz at a distance of 1000 km. Our results suggest that it is important to reach a qubit memory coherence time of around 1 s, and two-qubit gate and measurement errors on the order of 10 − 3 to obtain reasonable secret key rates over distances longer than achievable with direct transmission. While this work focuses on optimizing secret key rates, the protocol can also be used for Einstein-Podolsky-Rosen pair generation and is thus also relevant for, e.g., distributed quantum computing.