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:2005.04946 · IEEE Transactions on Quantum Engineering

Efficient Optimization of Cut-offs in Quantum Repeater Chains

Boxi Li, Tim J. Coopmans, David Elkouss

Published Oct 1, 2020• 63 citations
arXivHTMLPDF

Abstract

Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle, quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cutoff condition. For instance, a maximum storage time for entanglement after which it is discarded. In this article, we optimize the cutoffs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cutoff. Then, we use the algorithm to optimize cutoffs in order to maximize the secret-key rate between the end nodes of the repeater chain. In this article, we find that the use of the optimal cutoff extends the parameter regime for which secret key can be generated and, moreover, significantly increases the secret-key rate for a large range of parameters.

DOI
10.1109/tqe.2021.3099003

Related papers

Bayesian Optimization for Repeater Protocols

Lorenzo La Corte, Kenneth Goodenough, Ananda G. Maity +2 more

Efficiently distributing secret keys over long distances remains a critical challenge in the development of quantum networks. "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of probabilistic entanglement generation, swapping and distillation operations. However, finding the protocol that maximizes the secret-key rate is difficult for two reasons. First, calculating the secret-key rate for a given protocol is non-trivial due to experimental imperfections and the probabilistic nature of the operations. Second, the protocol space rapidly grows with the number of nodes, and lacks any clear structure for efficient exploration. To address the first challenge, we build upon the efficient machinery developed by Li et al. [1] and we extend it, enabling numerical calculation of the secret-key rate for heterogeneous repeater chains with an arbitrary number of nodes. For navigating the large, unstructured space of repeater protocols, we implement a Bayesian optimization algorithm, which we find consistently returns the optimal result. Whenever comparisons are feasible, we validate its accuracy against results obtained through brute-force methods. Further, we use our framework to extract insight on how to maximize the efficiency of repeater protocols across varying node configurations and hardware conditions. Our results highlight the effectiveness of Bayesian optimization in exploring the potential of near-term quantum repeater chains.

arXiv:2502.02208•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•2 citations

Efficient Computation of the Waiting Time and Fidelity in Quantum Repeater Chains

Sebastiaan Brand, Tim J. Coopmans, David Elkouss

Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The distance that quantum communication schemes can cover via direct communication is fundamentally limited by losses on the communication channel. By means of quantum repeaters, the reach of these schemes can be extended and chains of quantum repeaters could in principle cover arbitrarily long distances. In this work, we provide two efficient algorithms for determining the generation time and fidelity of the first generated entangled pair between the end nodes of a quantum repeater chain. The runtime of the algorithms increases polynomially with the number of segments of the chain, which improves upon the exponential runtime of existing algorithms. Our first algorithm is probabilistic and can analyze refined versions of repeater chain protocols which include intermediate entanglement distillation. Our second algorithm computes the waiting time distribution up to a pre-specified truncation time, has faster runtime than the first one and is moreover exact up to machine precision. Using our proof-of-principle implementation, we are able to analyze repeater chains of thousands of segments for some parameter regimes. The algorithms thus serve as useful tools for the analysis of large quantum repeater chain protocols and topologies of the future quantum internet.

arXiv:1912.07688•IEEE Journal on Selected Areas in Communications•Jan 28, 2020•52 citations

Entanglement Swapping Scheduling for Quantum Repeater Chains under Decoherence during Classical Communications

Jorge Benito Díaz, Andrés Agustí, Jabier Faba +3 more

First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.

quant-pharXiv:2610.07991•Oct 7, 2026•0 citations

Probabilistic Cutoffs in Homogeneous Quantum Repeater Chains

Jeroen Grimbergen, Stav Haldar, Alvaro Gomez Inesta +1 more

We study quantum repeater chains in which entangled links between neighbouring nodes are created through heralded entanglement generation and adjacent links are swapped as soon as possible. Since heralded entanglement generation attempts succeed only probabilistically, some links will have to be stored in quantum memories at the nodes of the chain while waiting for adjacent links to be generated. The fidelity of these stored links decreases with time due to decoherence, and if they are stored for too long then this can lead to low end-to-end fidelity. Previous work has shown that the end-to-end fidelity can be improved by deterministically discarding links when their ages exceed some cutoff value. Such deterministic cutoff policies provide strict control of the fidelity of all links, but they come at the expense of having to track link ages. In this work, we introduce a probabilistic cutoff policy that does not require tracking link ages, at the cost of abandoning strict control of the fidelity. We benchmark this new probabilistic cutoff policy against a deterministic cutoff policy. We compare the policies in terms of the end-to-end rate and fidelity, and the secret-key rate. We find that even though the probabilistic cutoff policy keeps track of less state, it can provide secret-key rates of the same order of magnitude as the deterministic cutoff policy in chains with few nodes or high elementary link generation probabilities. Moreover, we identify a scenario in which the probabilistic cutoff policy can deliver end-to-end links that are required to have some minimum threshold fidelity at a higher rate than the deterministic cutoff policy.

quant-pharXiv:2602.14738•Feb 17, 2026•1 citation

Optimizing repeater schemes for the quantum internet

Kenneth Goodenough, David Elkouss, Stephanie Wehner

The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow one, in principle, to overcome these limitations, but their introduction necessarily adds an additional layer of complexity to the distribution of entanglement. This additional complexity---along with the stochastic nature of processes such as entanglement generation, Bell swaps, and entanglement distillation---makes finding good quantum repeater schemes nontrivial. We develop an algorithm that can efficiently perform a heuristic optimization over a subset of quantum repeater schemes for general repeater platforms. We find a strong improvement in the generation rate in comparison to an optimization over a simpler class of repeater schemes based on BDCZ (Briegel, D\"ur, Cirac, Zoller) repeater schemes. We use the algorithm to study three different experimental quantum repeater implementations on their ability to distribute entanglement, which we dub information processing implementations, multiplexed elementary pair generation implementations, and combinations of the two. We perform this heuristic optimization of repeater schemes for each of these implementations for a wide range of parameters and different experimental settings. This allows us to make estimates on what are the most critical parameters to improve for entanglement generation, how many repeaters to use, and which implementations perform best in their ability to generate entanglement.

arXiv:2006.12221•Physical Review A•Mar 18, 2021•57 citations

Analytical and numerical bounds on entanglement delivery waiting times

Sebastiaan Brand, Tim J. Coopmans, David Elkouss +1 more

The vision of a global network that enables quantum communications between any point on Earth is known as the quantum internet. One crucial element of this network is the use of quantum repeater chains, which have the potential to overcome transmission losses and implement entanglement or quantum key distribution protocols over extended distances. There are various proposals for quantum repeaters, but they can generally be evaluated based on two main figures of merit: the average time for end-to-end entanglement delivery and the associated average fidelity. However, characterizing these quantities can be difficult due to factors such as feedback loops, decoherence, entanglement generation being a probabilistic process, and the potential failure of subprotocols. In this talk, I will discuss algorithmic and analytical methods for computing these quantities for relevant families of protocols.

Quantum Computing, Communication, and Simulation•Mar 8, 2023•0 citations
Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle, quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cutoff condition. For instance, a maximum storage time for entanglement after which it is discarded. In this article, we optimize the cutoffs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cutoff. Then, we use the algorithm to optimize cutoffs in order to maximize the secret-key rate between the end nodes of the repeater chain. In this article, we find that the use of the optimal cutoff extends the parameter regime for which secret key can be generated and, moreover, significantly increases the secret-key rate for a large range of parameters.
Efficiently distributing secret keys over long distances remains a critical challenge in the development of quantum networks. "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of probabilistic entanglement generation, swapping and distillation operations. However, finding the protocol that maximizes the secret-key rate is difficult for two reasons. First, calculating the secret-key rate for a given protocol is non-trivial due to experimental imperfections and the probabilistic nature of the operations. Second, the protocol space rapidly grows with the number of nodes, and lacks any clear structure for efficient exploration. To address the first challenge, we build upon the efficient machinery developed by Li et al. [1] and we extend it, enabling numerical calculation of the secret-key rate for heterogeneous repeater chains with an arbitrary number of nodes. For navigating the large, unstructured space of repeater protocols, we implement a Bayesian optimization algorithm, which we find consistently returns the optimal result. Whenever comparisons are feasible, we validate its accuracy against results obtained through brute-force methods. Further, we use our framework to extract insight on how to maximize the efficiency of repeater protocols across varying node configurations and hardware conditions. Our results highlight the effectiveness of Bayesian optimization in exploring the potential of near-term quantum repeater chains.
Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The distance that quantum communication schemes can cover via direct communication is fundamentally limited by losses on the communication channel. By means of quantum repeaters, the reach of these schemes can be extended and chains of quantum repeaters could in principle cover arbitrarily long distances. In this work, we provide two efficient algorithms for determining the generation time and fidelity of the first generated entangled pair between the end nodes of a quantum repeater chain. The runtime of the algorithms increases polynomially with the number of segments of the chain, which improves upon the exponential runtime of existing algorithms. Our first algorithm is probabilistic and can analyze refined versions of repeater chain protocols which include intermediate entanglement distillation. Our second algorithm computes the waiting time distribution up to a pre-specified truncation time, has faster runtime than the first one and is moreover exact up to machine precision. Using our proof-of-principle implementation, we are able to analyze repeater chains of thousands of segments for some parameter regimes. The algorithms thus serve as useful tools for the analysis of large quantum repeater chain protocols and topologies of the future quantum internet.
First-generation quantum repeaters are essential in distributing entanglement over long distances since they could mitigate losses in optical fiber. Repeaters split the total distance into shorter, easier to generate links. Then, entanglement swapping establishes long range entanglement by performing local measurements at the repeaters and heralding their results. In this work, we develop an analytical model that estimates the impact of decoherence during heralding for a given protocol. Furthermore, we identify a competition between two phenomena: as repeater count increases, so does entanglement generation, but the additive impact of memory decoherence on final entanglement rate increases too. Therefore, we find that an optimal number of repeaters exists. These findings could lead the design of future quantum networks, both in the inter-repeater distance and swapping timings.
We study quantum repeater chains in which entangled links between neighbouring nodes are created through heralded entanglement generation and adjacent links are swapped as soon as possible. Since heralded entanglement generation attempts succeed only probabilistically, some links will have to be stored in quantum memories at the nodes of the chain while waiting for adjacent links to be generated. The fidelity of these stored links decreases with time due to decoherence, and if they are stored for too long then this can lead to low end-to-end fidelity. Previous work has shown that the end-to-end fidelity can be improved by deterministically discarding links when their ages exceed some cutoff value. Such deterministic cutoff policies provide strict control of the fidelity of all links, but they come at the expense of having to track link ages. In this work, we introduce a probabilistic cutoff policy that does not require tracking link ages, at the cost of abandoning strict control of the fidelity. We benchmark this new probabilistic cutoff policy against a deterministic cutoff policy. We compare the policies in terms of the end-to-end rate and fidelity, and the secret-key rate. We find that even though the probabilistic cutoff policy keeps track of less state, it can provide secret-key rates of the same order of magnitude as the deterministic cutoff policy in chains with few nodes or high elementary link generation probabilities. Moreover, we identify a scenario in which the probabilistic cutoff policy can deliver end-to-end links that are required to have some minimum threshold fidelity at a higher rate than the deterministic cutoff policy.
The rate at which quantum communication tasks can be performed using direct transmission is fundamentally hindered by the channel loss. Quantum repeaters allow one, in principle, to overcome these limitations, but their introduction necessarily adds an additional layer of complexity to the distribution of entanglement. This additional complexity---along with the stochastic nature of processes such as entanglement generation, Bell swaps, and entanglement distillation---makes finding good quantum repeater schemes nontrivial. We develop an algorithm that can efficiently perform a heuristic optimization over a subset of quantum repeater schemes for general repeater platforms. We find a strong improvement in the generation rate in comparison to an optimization over a simpler class of repeater schemes based on BDCZ (Briegel, D\"ur, Cirac, Zoller) repeater schemes. We use the algorithm to study three different experimental quantum repeater implementations on their ability to distribute entanglement, which we dub information processing implementations, multiplexed elementary pair generation implementations, and combinations of the two. We perform this heuristic optimization of repeater schemes for each of these implementations for a wide range of parameters and different experimental settings. This allows us to make estimates on what are the most critical parameters to improve for entanglement generation, how many repeaters to use, and which implementations perform best in their ability to generate entanglement.
The vision of a global network that enables quantum communications between any point on Earth is known as the quantum internet. One crucial element of this network is the use of quantum repeater chains, which have the potential to overcome transmission losses and implement entanglement or quantum key distribution protocols over extended distances. There are various proposals for quantum repeaters, but they can generally be evaluated based on two main figures of merit: the average time for end-to-end entanglement delivery and the associated average fidelity. However, characterizing these quantities can be difficult due to factors such as feedback loops, decoherence, entanglement generation being a probabilistic process, and the potential failure of subprotocols. In this talk, I will discuss algorithmic and analytical methods for computing these quantities for relevant families of protocols.