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:1811.01080 · Quantum Science and Technology

Quantum repeater architecture with hierarchically optimized memory buffer times

Siddhartha Santra, Liang Jiang, Vladimir S Malinovsky

Published Mar 1, 2019• 34 citations
arXivHTMLPDF

Abstract

Abstract We propose a quantum repeater protocol and architecture that mitigates decoherence of the entangled states by optimizing the quantum memory buffer time. The protocol maximizes the rate of distillable entanglement in the average accessed state at all nesting levels. The achievable rate is higher by orders of magnitude in comparison to a canonical protocol that does not optimize the buffer time. The advantage of the proposed design is observed for all nesting levels of the repeater for technologically feasible memory quality, entanglement generation and swapping success probabilities.

DOI
10.1088/2058-9565/ab0bc2

Related papers

Quantum memory decoherence-mitigating architecture for quantum repeaters

Siddhartha Santra, Liang Jiang, Vladimir S. Malinovsky

We propose a nested quantum repeater architecture that mitigates quantum memory decoherence by optimizing the memory access time. This maximizes the distillable entanglement rate in the remote entangled state for technologically feasible repeater parameter regimes.

Quantum Information and Measurement (QIM)•Jan 1, 2019•0 citations

Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time

Allen Zang, Xinan Chen, Alexander Kolar +4 more

Quantum repeater networks that allow long-distance entanglement distribution will be the backbone of distributed quantum information processing. In this paper we explore entanglement distribution using quantum repeaters with optimized buffer time, equipped with noisy quantum memories and performing imperfect entanglement purification and swapping. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory and higher probability of high-fidelity entanglement distribution, at least for the case with perfect operations. When imperfect operations are considered, however, we make the surprising observation that the permemory entanglement rate decreases with increasing number of memories. Our results suggest that building quantum repeaters that perform well under realistic conditions requires careful modeling and design that takes into consideration the operations and resources that are finite and imperfect.

arXiv:2305.14573•IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)•May 20, 2023•23 citations

Optimal entanglement generation for efficient hybrid quantum repeaters

Koji Azuma, Naoya Sota, Ryo Namiki +4 more

We propose a realistic protocol to generate entanglement between quantum memories at neighboring nodes in hybrid quantum repeaters. Generated entanglement includes only one type of error, which enables efficient entanglement distillation. In contrast to the known protocols with such a property, our protocol with ideal detectors achieves the theoretical limit of the success probability and the fidelity to a Bell state, promising higher efficiencies in the repeaters. We also show that the advantage of our protocol remains even with realistic threshold detectors.

arXiv:0811.3100•Physical Review A•Dec 15, 2009•27 citations

Physical and architectural considerations in quantum repeaters

Mohsen Razavi, K. Thompson, Hamid Farmanbar +2 more

Quantum repeaters enable us to distribute entanglement between remote parties by relying on a network of quantum memory units that exhibit efficient coupling to light, scalability, and long coherence times. Entanglement is initially distributed between nearest neighbors and then extended to the far-end nodes using entanglement swapping techniques. For real-time applications, such as quantum key distribution, the above tasks must be repeated successively, according to a proper protocol, to generate entangled states at a certain rate. This paper studies a number of such protocols and the interplay between the rate of entanglement generation, the number of employed memories, and the coherence time of memory units.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 2, 2008•14 citations

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

Entanglement Distillation and Swapping Scheduling in Quantum Repeaters with Noisy Memories

Siddharth Chander, Xinan Chen, Allen Zang

Entanglement distillation and entanglement swapping have been extensively studied assuming perfect quantum memories. However, near-term quantum networks will be fundamentally limited by quantum memories with a finite coherence time, resulting in complex choices for the timing and ordering of these operations. In this work, we study entanglement distillation and entanglement swapping at the level of the elementary building blocks of noisy quantum repeater networks, with the goal of elucidating the fundamental tradeoffs induced by memory decoherence. First, we focus on a minimal one-hop setting, where we analytically compare ``distill-as-soon-as-possible'' and ``distill-as-late-as-possible'' strategies against a baseline strategy that simply discards the older entangled state. We find that in the low memory coherence time regime, discarding the older entangled state achieves higher expected output fidelity, while in the high coherence time regime, delaying distillation until the end achieves the highest expected output fidelity and, over most of the deadline range, the highest weighted coherent information, at the expense of a lower success probability. We then extend our analysis to two-hop repeater chains using Monte Carlo simulation. In this setting, we find that the highest weighted coherent information is achieved by strategies that defer distillation to the end of the time window, with \textsf{Distill-ALAP-then-Swap-ALAP} and \textsf{Swap-ASAP-then-Distill-ALAP} leading at different operating points, while \textsf{Discard-Oldest-then-Swap} never reaches positive weighted coherent information in any regime tested. Together, these results clarify how decoherence reshapes the optimal operation timing in quantum networks and provide instructive insights into the link-level principles that govern larger-scale architectures.

quant-pharXiv:2607.24557•Jul 28, 2026•0 citations
Abstract We propose a quantum repeater protocol and architecture that mitigates decoherence of the entangled states by optimizing the quantum memory buffer time. The protocol maximizes the rate of distillable entanglement in the average accessed state at all nesting levels. The achievable rate is higher by orders of magnitude in comparison to a canonical protocol that does not optimize the buffer time. The advantage of the proposed design is observed for all nesting levels of the repeater for technologically feasible memory quality, entanglement generation and swapping success probabilities.
Quantum repeater networks that allow long-distance entanglement distribution will be the backbone of distributed quantum information processing. In this paper we explore entanglement distribution using quantum repeaters with optimized buffer time, equipped with noisy quantum memories and performing imperfect entanglement purification and swapping. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory and higher probability of high-fidelity entanglement distribution, at least for the case with perfect operations. When imperfect operations are considered, however, we make the surprising observation that the permemory entanglement rate decreases with increasing number of memories. Our results suggest that building quantum repeaters that perform well under realistic conditions requires careful modeling and design that takes into consideration the operations and resources that are finite and imperfect.
We propose a realistic protocol to generate entanglement between quantum memories at neighboring nodes in hybrid quantum repeaters. Generated entanglement includes only one type of error, which enables efficient entanglement distillation. In contrast to the known protocols with such a property, our protocol with ideal detectors achieves the theoretical limit of the success probability and the fidelity to a Bell state, promising higher efficiencies in the repeaters. We also show that the advantage of our protocol remains even with realistic threshold detectors.
Quantum repeaters enable us to distribute entanglement between remote parties by relying on a network of quantum memory units that exhibit efficient coupling to light, scalability, and long coherence times. Entanglement is initially distributed between nearest neighbors and then extended to the far-end nodes using entanglement swapping techniques. For real-time applications, such as quantum key distribution, the above tasks must be repeated successively, according to a proper protocol, to generate entangled states at a certain rate. This paper studies a number of such protocols and the interplay between the rate of entanglement generation, the number of employed memories, and the coherence time of memory units.
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.
Entanglement distillation and entanglement swapping have been extensively studied assuming perfect quantum memories. However, near-term quantum networks will be fundamentally limited by quantum memories with a finite coherence time, resulting in complex choices for the timing and ordering of these operations. In this work, we study entanglement distillation and entanglement swapping at the level of the elementary building blocks of noisy quantum repeater networks, with the goal of elucidating the fundamental tradeoffs induced by memory decoherence. First, we focus on a minimal one-hop setting, where we analytically compare ``distill-as-soon-as-possible'' and ``distill-as-late-as-possible'' strategies against a baseline strategy that simply discards the older entangled state. We find that in the low memory coherence time regime, discarding the older entangled state achieves higher expected output fidelity, while in the high coherence time regime, delaying distillation until the end achieves the highest expected output fidelity and, over most of the deadline range, the highest weighted coherent information, at the expense of a lower success probability. We then extend our analysis to two-hop repeater chains using Monte Carlo simulation. In this setting, we find that the highest weighted coherent information is achieved by strategies that defer distillation to the end of the time window, with \textsf{Distill-ALAP-then-Swap-ALAP} and \textsf{Swap-ASAP-then-Distill-ALAP} leading at different operating points, while \textsf{Discard-Oldest-then-Swap} never reaches positive weighted coherent information in any regime tested. Together, these results clarify how decoherence reshapes the optimal operation timing in quantum networks and provide instructive insights into the link-level principles that govern larger-scale architectures.