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

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

Stav Haldar, Pratik J. Barge, Xiang Cheng, Kai-Chi Chang, Brian T. Kirby, Sumeet Khatri, Chee Wei Wong, Hwang Lee

Published Jun 13, 2024• 6 citations
Publisher

Abstract

Abstract Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation. In this work, we introduce "quasi-local" policies for multiplexed quantum repeater chains. In fully-local policies, nodes make decisions based only on knowledge of their own states. In our quasi-local policies, nodes have increased knowledge of state of the repeater chain, but not necessarily global knowledge. Our policies exploit the observation that for most decisions the nodes have to make, they only need to have information about the connected region of the chain they belong to, and not the entire chain. In this way, we not only obtain improved performance over local policies, but we reduce the classical communication (CC) costs inherent to global-knowledge policies. Our policies also outperform the well-known and widely studied nested purification and doubling swapping policy in practically relevant parameter regimes. Via analytical and numerical results, we also identify the parameter regimes in which distillation makes sense and is useful. We also address the question: "Should we distill before swapping, or vice versa?'' Finally, we propose an experimental implementation of a multiplexing-based repeater chain, and experimentally demonstrate the key element, a high-dimensional biphoton frequency comb, and evaluate its anticipated performance.

DOI
10.21203/rs.3.rs-4397221/v1

Related papers

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•11 citations

Advantages of Global Entanglement-Distillation Policies in Quantum Repeater Chains

Iftach Yakar, Michael Ben-Or

Quantum repeaters are essential for achieving long-distance quantum communication due to photon loss, which grows exponentially with the channel distance. Current quantum repeater generations use entanglement distillation protocols, where the decision of when to perform distillation depends on either local or global knowledge. Recent approaches for quantum repeaters, such as Mantri et al. (arXiv:2409.06152), consider using deterministic local decision policies for entanglement distillation. We ask whether global deterministic policies outperform local ones in terms of communication rate. We simulate equidistant repeater chains, assisted by two-way classical communication, and compare local and global policies for distillation decisions, spanning large distances and varying network and hardware parameters. Our findings show that global deterministic policies consistently outperform these local ones, and in some cases, determine whether secret communication is possible. For large repeater chains ($N>512$), global policies improve SKR by two orders of magnitude. These results suggest that local distillation decisions in quantum repeater chains may not be optimal, and may inform future protocol design.

arXiv:2510.06737•Oct 8, 2025•0 citations

A Dynamic Multiplexing Policy for a Quantum Repeater

Jeroen Grimbergen, Sounak Kar, Michal van Hooft +2 more

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.

quant-pharXiv:2607.07539•Jul 9, 2026•0 citations

Fast and reliable entanglement distribution with quantum repeaters: Principles for improving protocols using reinforcement learning

Stav Haldar, Pratik J. Barge, Sumeet Khatri +1 more

Tomorrow's quantum technologies for communication, sensing, and distributed computing will rely on networks with entanglement shared between spatially separated nodes. The authors provide improved protocols and policies for entanglement distribution along a chain of nodes, accounting for practical limitations such as photon losses, nonideal measurements, and quantum memories with short coherence times. These policies feature dynamic, state-dependent memory cutoffs and collaboration between nodes, all of which are quantified. Nesting policies for small repeater chains yields policies for large chains that improve upon a swap-as-soon-as-possible approach, and thus pave the way to scaling up.

arXiv:2303.00777•Physical Review Applied•Feb 21, 2024•28 citations

Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs

Álvaro G. Iñesta, Gayane Vardoyan, Lara Scavuzzo +1 more

We study the limits of bipartite entanglement distribution using a chain of quantum repeaters that have quantum memories. To generate end-to-end entanglement, each node can attempt the generation of an entangled link with a neighbor, or perform an entanglement swapping measurement. A maximum storage time, known as cutoff, is enforced on the memories to ensure high-quality entanglement. Nodes follow a policy that determines when to perform each operation. Global-knowledge policies take into account all the information about the entanglement already produced. Here, we find global-knowledge policies that minimize the expected time to produce end-to-end entanglement. Our methods are based on Markov decision processes and value and policy iteration. We compare optimal policies to a policy in which nodes only use local information. We find that the advantage in expected delivery time provided by an optimal global-knowledge policy increases with increasing number of nodes and decreasing probability of successful swapping.

arXiv:2207.06533•npj Quantum Information•May 6, 2023•54 citations

Building blocks of quantum repeater networks

Filip Rozpędek

Future quantum networks will enable the realisation of a large family of quantum protocols, hence allowing for implementation of various tasks ranging from quantum cryptography through quantum computing to quantum metrology.In this thesis we analyse and develop the building blocks of quantum repeater networks.These networks consist of quantum repeater nodes, which are equipped with quantum memories enabling storage of quantum information.The repeater nodes are connected using optical fibres that enable for the transmission of photonic quantum signals between the repeater nodes.We specifically focus on the two building blocks: remote entanglement generation and entanglement distillation.We then investigate various proof of principle quantum repeater schemes used for generating shared secret key between distant parties.The repeater schemes that we consider utilise one to three memory nodes capable of generating memory-photon entanglement.Finally, we introduce a novel framework for investigating a foundational aspect in the use of quantum communication related to the uncertainty principle.Efficient remote entanglement generation is an indispensable building block of most near-term quantum repeater networks.In this thesis we consider various remote entanglement generation schemes that permit multiplexing, which aims at increasing the throughput of this procedure.We find that for the specific schemes that are suitable for platforms with a single communication qubit and multiple memory qubits, the performance of the multiplexing approach is strongly dependent on the time it takes to perform local operations within the memory nodes.Entanglement distillation enables for filtering out the noise from imperfect entangled states using only local operations and classical communication.Using a general framework for optimising such schemes, which we have developed, we have proven optimality of specific generic and experimentally relevant distillation schemes.We have developed a general framework for optimising such schemes, which we have used to prove optimality of various generic and experimentally relevant distillation schemes.In designing proof of principle quantum repeater schemes we assume an informationtheoretic approach, which enables us to assess their performance in a hardware-agnostic way.We find that all the schemes that we consider can prove useful in specific parameter regimes for the nitrogen-vacancy centre platform.Moreover, we find that one scheme which has already been realised experimentally in the context of remote entanglement generation, is expected to significantly outperform every possible system based on direct communication without repeaters.However, our analysis shows that encapsulating the nitrogen-vacancy centres in optical cavities for the enhancement of the emission rates is a necessary requirement for such a successful demonstration of the first proofof-principle quantum repeater.xi xii SUMMARY Finally, we investigate the quantum uncertainty principle which is a fundamental feature of quantum mechanics, allowing for security in many quantum cryptographic protocols.We find that in a particular scenario, relevant from the perspective of quantum key distribution, a significant part of the observed uncertainty is in fact due to lack of information rather than intrinsic.If the eavesdropper could access that information, she would be able to much better, or in some cases even with certainty, guess the value of the raw bit of the generated key.

•Jun 11, 2019•6 citations
Abstract Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation. In this work, we introduce "quasi-local" policies for multiplexed quantum repeater chains. In fully-local policies, nodes make decisions based only on knowledge of their own states. In our quasi-local policies, nodes have increased knowledge of state of the repeater chain, but not necessarily global knowledge. Our policies exploit the observation that for most decisions the nodes have to make, they only need to have information about the connected region of the chain they belong to, and not the entire chain. In this way, we not only obtain improved performance over local policies, but we reduce the classical communication (CC) costs inherent to global-knowledge policies. Our policies also outperform the well-known and widely studied nested purification and doubling swapping policy in practically relevant parameter regimes. Via analytical and numerical results, we also identify the parameter regimes in which distillation makes sense and is useful. We also address the question: "Should we distill before swapping, or vice versa?'' Finally, we propose an experimental implementation of a multiplexing-based repeater chain, and experimentally demonstrate the key element, a high-dimensional biphoton frequency comb, and evaluate its anticipated performance.
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 repeaters are essential for achieving long-distance quantum communication due to photon loss, which grows exponentially with the channel distance. Current quantum repeater generations use entanglement distillation protocols, where the decision of when to perform distillation depends on either local or global knowledge. Recent approaches for quantum repeaters, such as Mantri et al. (arXiv:2409.06152), consider using deterministic local decision policies for entanglement distillation. We ask whether global deterministic policies outperform local ones in terms of communication rate. We simulate equidistant repeater chains, assisted by two-way classical communication, and compare local and global policies for distillation decisions, spanning large distances and varying network and hardware parameters. Our findings show that global deterministic policies consistently outperform these local ones, and in some cases, determine whether secret communication is possible. For large repeater chains (N>512N>512N>512), global policies improve SKR by two orders of magnitude. These results suggest that local distillation decisions in quantum repeater chains may not be optimal, and may inform future protocol design.
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.
Tomorrow's quantum technologies for communication, sensing, and distributed computing will rely on networks with entanglement shared between spatially separated nodes. The authors provide improved protocols and policies for entanglement distribution along a chain of nodes, accounting for practical limitations such as photon losses, nonideal measurements, and quantum memories with short coherence times. These policies feature dynamic, state-dependent memory cutoffs and collaboration between nodes, all of which are quantified. Nesting policies for small repeater chains yields policies for large chains that improve upon a swap-as-soon-as-possible approach, and thus pave the way to scaling up.
We study the limits of bipartite entanglement distribution using a chain of quantum repeaters that have quantum memories. To generate end-to-end entanglement, each node can attempt the generation of an entangled link with a neighbor, or perform an entanglement swapping measurement. A maximum storage time, known as cutoff, is enforced on the memories to ensure high-quality entanglement. Nodes follow a policy that determines when to perform each operation. Global-knowledge policies take into account all the information about the entanglement already produced. Here, we find global-knowledge policies that minimize the expected time to produce end-to-end entanglement. Our methods are based on Markov decision processes and value and policy iteration. We compare optimal policies to a policy in which nodes only use local information. We find that the advantage in expected delivery time provided by an optimal global-knowledge policy increases with increasing number of nodes and decreasing probability of successful swapping.
Future quantum networks will enable the realisation of a large family of quantum protocols, hence allowing for implementation of various tasks ranging from quantum cryptography through quantum computing to quantum metrology.In this thesis we analyse and develop the building blocks of quantum repeater networks.These networks consist of quantum repeater nodes, which are equipped with quantum memories enabling storage of quantum information.The repeater nodes are connected using optical fibres that enable for the transmission of photonic quantum signals between the repeater nodes.We specifically focus on the two building blocks: remote entanglement generation and entanglement distillation.We then investigate various proof of principle quantum repeater schemes used for generating shared secret key between distant parties.The repeater schemes that we consider utilise one to three memory nodes capable of generating memory-photon entanglement.Finally, we introduce a novel framework for investigating a foundational aspect in the use of quantum communication related to the uncertainty principle.Efficient remote entanglement generation is an indispensable building block of most near-term quantum repeater networks.In this thesis we consider various remote entanglement generation schemes that permit multiplexing, which aims at increasing the throughput of this procedure.We find that for the specific schemes that are suitable for platforms with a single communication qubit and multiple memory qubits, the performance of the multiplexing approach is strongly dependent on the time it takes to perform local operations within the memory nodes.Entanglement distillation enables for filtering out the noise from imperfect entangled states using only local operations and classical communication.Using a general framework for optimising such schemes, which we have developed, we have proven optimality of specific generic and experimentally relevant distillation schemes.We have developed a general framework for optimising such schemes, which we have used to prove optimality of various generic and experimentally relevant distillation schemes.In designing proof of principle quantum repeater schemes we assume an informationtheoretic approach, which enables us to assess their performance in a hardware-agnostic way.We find that all the schemes that we consider can prove useful in specific parameter regimes for the nitrogen-vacancy centre platform.Moreover, we find that one scheme which has already been realised experimentally in the context of remote entanglement generation, is expected to significantly outperform every possible system based on direct communication without repeaters.However, our analysis shows that encapsulating the nitrogen-vacancy centres in optical cavities for the enhancement of the emission rates is a necessary requirement for such a successful demonstration of the first proofof-principle quantum repeater.xi xii SUMMARY Finally, we investigate the quantum uncertainty principle which is a fundamental feature of quantum mechanics, allowing for security in many quantum cryptographic protocols.We find that in a particular scenario, relevant from the perspective of quantum key distribution, a significant part of the observed uncertainty is in fact due to lack of information rather than intrinsic.If the eavesdropper could access that information, she would be able to much better, or in some cases even with certainty, guess the value of the raw bit of the generated key.