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

Quantum Information and Measurement (QIM)

Quantum memory decoherence-mitigating architecture for quantum repeaters

Siddhartha Santra, Liang Jiang, Vladimir S. Malinovsky

Published Jan 1, 2019• 0 citations
Publisher

Abstract

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.
DOI
10.1364/qim.2019.s1d.4

Related papers

Quantum repeater architecture with hierarchically optimized memory buffer times

Siddhartha Santra, Liang Jiang, Vladimir S Malinovsky

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.

arXiv:1811.01080•Quantum Science and Technology•Mar 1, 2019•34 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

Quantum repeaters with imperfect memories: Cost and scalability

Mohsen Razavi, Marco Piani, Norbert Lütkenhaus

Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol, when a large number of memories are being used in each node. The above rate scales polynomially with distance, $L$, if quantum memories with infinitely long coherence times are available or if we employ a fully fault-tolerant scheme. For memories with finite coherence times and no fault-tolerant protection, the above rate optimistically degrades exponentially in $\sqrt{L}$, regardless of the employed purification scheme. It decays, at best, exponentially in $L$ if no purification is used.

arXiv:0810.5334•Physical Review A•Sep 1, 2009•125 citations

Efficient Optimization of Cut-offs in Quantum Repeater Chains

Boxi Li, Tim J. Coopmans, David Elkouss

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.

arXiv:2005.04946•IEEE Transactions on Quantum Engineering•Oct 1, 2020•63 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

Multiplexed Memory-Insensitive Quantum Repeaters

O. A. Collins, S. D. Jenkins, A. Kuzmich +1 more

Long-distance quantum communication via distant pairs of entangled quantum bits (qubits) is the first step towards secure message transmission and distributed quantum computing. To date, the most promising proposals require quantum repeaters to mitigate the exponential decrease in communication rate due to optical fiber losses. However, these are exquisitely sensitive to the lifetimes of their memory elements. We propose a multiplexing of quantum nodes that should enable the construction of quantum networks that are largely insensitive to the coherence times of the quantum memory elements.

arXiv:quant-ph/0610036•Physical Review Letters•Feb 7, 2007•303 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 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.
Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol, when a large number of memories are being used in each node. The above rate scales polynomially with distance, LLL, if quantum memories with infinitely long coherence times are available or if we employ a fully fault-tolerant scheme. For memories with finite coherence times and no fault-tolerant protection, the above rate optimistically degrades exponentially in L\sqrt{L}L​, regardless of the employed purification scheme. It decays, at best, exponentially in LLL if no purification is used.
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.
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.
Long-distance quantum communication via distant pairs of entangled quantum bits (qubits) is the first step towards secure message transmission and distributed quantum computing. To date, the most promising proposals require quantum repeaters to mitigate the exponential decrease in communication rate due to optical fiber losses. However, these are exquisitely sensitive to the lifetimes of their memory elements. We propose a multiplexing of quantum nodes that should enable the construction of quantum networks that are largely insensitive to the coherence times of the quantum memory elements.