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:2105.01002 · Physical Review A

Subexponential rate versus distance with time-multiplexed quantum repeaters

Prajit Dhara, Ashlesha Patil, Hari Krovi, Saikat Guha

Published Nov 19, 2021• 23 citations
arXivHTMLPDF

Abstract

Quantum communications capacity using direct transmission over length-$L$ optical fiber scales as $R\ensuremath{\sim}{e}^{\ensuremath{-}\ensuremath{\alpha}L}$, where $\ensuremath{\alpha}$ is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs), and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., $R\ensuremath{\sim}{e}^{\ensuremath{-}s\ensuremath{\alpha}L}$, with $s<1$. We show that the introduction of temporal multiplexing---i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at different time steps---leads to a subexponential rate-vs-distance scaling, i.e., $R\ensuremath{\sim}{e}^{\ensuremath{-}t\sqrt{\ensuremath{\alpha}L}}$, which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses.

DOI
10.1103/physreva.104.052612

Related papers

Optimal deployment design of repeaters and memories in quantum networks

Jiangyuan Yao, Kaiwen Zou, Deshun Li +1 more

In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metric$E$was proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.

IEEE International Conference on High Performance Computing and Communications; IEEE International Conference on Smart City; IEEE International Conference on Data Science and Systems (HPCC/SmartCity/DSS)•Dec 1, 2021•2 citations

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

Rate-loss analysis of an efficient quantum repeater architecture

Saikat Guha, Hari Krovi, Christopher A. Fuchs +4 more

We analyze an entanglement-based quantum key distribution (QKD) architecture that uses a linear chain of quantum repeaters employing photon-pair sources, spectral-multiplexing, linear-optic Bell-state measurements, multimode quantum memories, and classical-only error correction. Assuming perfect sources, we find an exact expression for the secret-key rate, and an analytical description of how errors propagate through the repeater chain, as a function of various loss-and-noise parameters of the devices. We show via an explicit analytical calculation, which separately addresses the effects of the principle nonidealities, that this scheme achieves a secret-key rate that surpasses the Takeoka-Guha-Wilde bound---a recently found fundamental limit to the rate-vs-loss scaling achievable by any QKD protocol over a direct optical link---thereby providing one of the first rigorous proofs of the efficacy of a repeater protocol. We explicitly calculate the end-to-end shared noisy quantum state generated by the repeater chain, which could be useful for analyzing the performance of other non-QKD quantum protocols that require establishing long-distance entanglement. We evaluate that shared state's fidelity and the achievable entanglement-distillation rate, as a function of the number of repeater nodes, total range, and various loss-and-noise parameters of the system. We extend our theoretical analysis to encompass sources with nonzero two-pair-emission probability, using an efficient exact numerical evaluation of the quantum state propagation and measurements. We expect our results to spur formal rate-loss analysis of other repeater protocols and also to provide useful abstractions to seed analyses of quantum networks of complex topologies.

arXiv:1404.7183•Physical Review A•Aug 31, 2015•142 citations

Entanglement Swapping for Repeater Chains with Finite Memory Sizes

Wenhan Dai, Don Towsley

We develop entanglement swapping protocols and memory allocation methods for quantum repeater chains. Unlike most of the existing studies, the memory size of each quantum repeater in this work is a parameter that can be optimized. Based on Markov chain modeling of the entanglement distribution process, we determine the trade-off between the entanglement distribution rate and the memory size for temporal multiplexing techniques. We then propose three memory allocation methods that achieve entanglement distribution rates decaying polynomially with respect to the distance while using constant average memory slots per node. We also quantify the average number of memory slots required due to classical communication delay, as well as the delay of entanglement distribution. Our results show that a moderate memory size suffices to achieve a polynomial decay of entanglement distribution rate with respect to the distance, which is the scaling achieved by the optimal protocol even with infinite memory size at each node.

arXiv:2111.10994•Nov 22, 2021•14 citations

Entanglement distribution with wavevector-multiplexed quantum memory

Michał Lipka, Mateusz Mazelanik, Michal P. Parniak

Abstract Feasible distribution of quantum entanglement over long distances remains a fundamental step towards quantum secure communication and quantum network implementations. Quantum repeater nodes based on quantum memories promise to overcome exponential signal decay inherent to optical implementations of quantum communication. While performance of current quantum memories hinders their practical application, multimode solutions with multiplexing can offer tremendous increase in entanglement distribution rates. We propose to use a wavevector-multiplexed atomic quantum memory (WV-MUX-QM) as a fundamental block of a multiplexed quantum repeater architecture. We show the WV-MUX-QM platform to provide quasi-deterministic entanglement generation over extended distances, mitigating the fundamental issue of optical loss even with currently available quantum memory devices, and exceeding performance of repeaterless solutions as well as other repeater-based protocols such as temporal multiplexing. We establish the entangled-bit (ebit) rate per number of employed nodes as a practical figure of merit reflecting the cost-efficiency of larger inter-node distances.

arXiv:2007.00538•New Journal of Physics•Apr 14, 2021•13 citations

Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible

Lars Kamin, Evgeny V Shchukin, Frank Schmidt +1 more

We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optimal repeater scheme: entanglement distribution in parallel, entanglement swapping as soon and parallel quantum storage as little as possible. While these features are obvious or trivial for the simplest repeater with one middle station, for more stations they cannot always be combined. We propose an optimal scheme including channel loss and memory dephasing, proving its optimality for the case of two stations and conjecturing it for the general case. In an even more realistic setting, we consider additional tools and parameters such as memory cutoffs, multiplexing, initial state and swapping gate fidelities, and finite link coupling efficiencies in order to identify potential regimes in memory-assisted quantum key distribution beyond one middle station that exceed the rates of the smallest quantum repeaters as well as those obtainable in all-optical schemes unassisted by stationary memory qubits and two-way classical communication. Our analytical treatment enables us to determine simultaneous trade-offs between various parameters, their scaling, and their influence on the performance ordering among different types of protocols, comparing two-photon interference after dual-rail qubit transmission with one-photon interference of single-rail qubits or, similarly, optical interference of coherent states. We find that for experimental parameter values that are highly demanding but not impossible (up to 10 s coherence time, about 80% link coupling, and state or gate infidelities in the regime of 1%--2%), one secret bit can be shared per second at a total channel loss budget of 157.6 dB, i.e. a total distance of 800 km for a fiber attenuation length of 22 km with repeater stations placed at every 100 km---a clear improvement over realistic twin-field or, much more pronouncedly, ideal point-to-point quantum key distribution at GHz clock rates.

arXiv:2203.10318•Physical Review Research•May 10, 2023•49 citations
Quantum communications capacity using direct transmission over length-LLL optical fiber scales as R\ensuremath∼e\ensuremath−\ensuremathαLR\ensuremath{\sim}{e}^{\ensuremath{-}\ensuremath{\alpha}L}R\ensuremath∼e\ensuremath−\ensuremathαL, where \ensuremathα\ensuremath{\alpha}\ensuremathα is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs), and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., R\ensuremath∼e\ensuremath−s\ensuremathαLR\ensuremath{\sim}{e}^{\ensuremath{-}s\ensuremath{\alpha}L}R\ensuremath∼e\ensuremath−s\ensuremathαL, with s<1s<1s<1. We show that the introduction of temporal multiplexing---i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at different time steps---leads to a subexponential rate-vs-distance scaling, i.e., R\ensuremath∼e\ensuremath−t\ensuremathαLR\ensuremath{\sim}{e}^{\ensuremath{-}t\sqrt{\ensuremath{\alpha}L}}R\ensuremath∼e\ensuremath−t\ensuremathαL​, which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses.
In quantum communication networks, the transmission success rate of entangled photons decreases exponentially with the transmission distance in fiber channel. With quantum repeaters, quantum networks can realize arbitrary long-distance links based on quantum entanglement swapping, quantum storage, and quantum teleportation. Thanks to the development of quantum memory technology, the throughput of quantum relay networks can be improved by increasing the number of quantum memories. In this paper, we study the routing metric, the goal of which is to achieve a higher throughput in a long-distance quantum network by reasonably allocating repeater positions with a given memory count between source and destination. A routing metricEEEwas proposed, where the number and distance range of repeater deployments can be obtained by numerical analysis to support an optimal network throughput. According to the above principle, various repeaters were deployed on a linear quantum network to test the effectiveness of the proposed allocation mechanism with the given transmission loss, Bell-State Measurement (BSM) success rate, memory quantity, and distance. The results of evaluation show that increasing the number of repeaters blindly can lead to a waste of resources and a throughput decreasing, which implies that repeaters need to be placed at an appropriate deployment distance to achieve the optimal performance.
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.
We analyze an entanglement-based quantum key distribution (QKD) architecture that uses a linear chain of quantum repeaters employing photon-pair sources, spectral-multiplexing, linear-optic Bell-state measurements, multimode quantum memories, and classical-only error correction. Assuming perfect sources, we find an exact expression for the secret-key rate, and an analytical description of how errors propagate through the repeater chain, as a function of various loss-and-noise parameters of the devices. We show via an explicit analytical calculation, which separately addresses the effects of the principle nonidealities, that this scheme achieves a secret-key rate that surpasses the Takeoka-Guha-Wilde bound---a recently found fundamental limit to the rate-vs-loss scaling achievable by any QKD protocol over a direct optical link---thereby providing one of the first rigorous proofs of the efficacy of a repeater protocol. We explicitly calculate the end-to-end shared noisy quantum state generated by the repeater chain, which could be useful for analyzing the performance of other non-QKD quantum protocols that require establishing long-distance entanglement. We evaluate that shared state's fidelity and the achievable entanglement-distillation rate, as a function of the number of repeater nodes, total range, and various loss-and-noise parameters of the system. We extend our theoretical analysis to encompass sources with nonzero two-pair-emission probability, using an efficient exact numerical evaluation of the quantum state propagation and measurements. We expect our results to spur formal rate-loss analysis of other repeater protocols and also to provide useful abstractions to seed analyses of quantum networks of complex topologies.
We develop entanglement swapping protocols and memory allocation methods for quantum repeater chains. Unlike most of the existing studies, the memory size of each quantum repeater in this work is a parameter that can be optimized. Based on Markov chain modeling of the entanglement distribution process, we determine the trade-off between the entanglement distribution rate and the memory size for temporal multiplexing techniques. We then propose three memory allocation methods that achieve entanglement distribution rates decaying polynomially with respect to the distance while using constant average memory slots per node. We also quantify the average number of memory slots required due to classical communication delay, as well as the delay of entanglement distribution. Our results show that a moderate memory size suffices to achieve a polynomial decay of entanglement distribution rate with respect to the distance, which is the scaling achieved by the optimal protocol even with infinite memory size at each node.
Abstract Feasible distribution of quantum entanglement over long distances remains a fundamental step towards quantum secure communication and quantum network implementations. Quantum repeater nodes based on quantum memories promise to overcome exponential signal decay inherent to optical implementations of quantum communication. While performance of current quantum memories hinders their practical application, multimode solutions with multiplexing can offer tremendous increase in entanglement distribution rates. We propose to use a wavevector-multiplexed atomic quantum memory (WV-MUX-QM) as a fundamental block of a multiplexed quantum repeater architecture. We show the WV-MUX-QM platform to provide quasi-deterministic entanglement generation over extended distances, mitigating the fundamental issue of optical loss even with currently available quantum memory devices, and exceeding performance of repeaterless solutions as well as other repeater-based protocols such as temporal multiplexing. We establish the entangled-bit (ebit) rate per number of employed nodes as a practical figure of merit reflecting the cost-efficiency of larger inter-node distances.
We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optimal repeater scheme: entanglement distribution in parallel, entanglement swapping as soon and parallel quantum storage as little as possible. While these features are obvious or trivial for the simplest repeater with one middle station, for more stations they cannot always be combined. We propose an optimal scheme including channel loss and memory dephasing, proving its optimality for the case of two stations and conjecturing it for the general case. In an even more realistic setting, we consider additional tools and parameters such as memory cutoffs, multiplexing, initial state and swapping gate fidelities, and finite link coupling efficiencies in order to identify potential regimes in memory-assisted quantum key distribution beyond one middle station that exceed the rates of the smallest quantum repeaters as well as those obtainable in all-optical schemes unassisted by stationary memory qubits and two-way classical communication. Our analytical treatment enables us to determine simultaneous trade-offs between various parameters, their scaling, and their influence on the performance ordering among different types of protocols, comparing two-photon interference after dual-rail qubit transmission with one-photon interference of single-rail qubits or, similarly, optical interference of coherent states. We find that for experimental parameter values that are highly demanding but not impossible (up to 10 s coherence time, about 80% link coupling, and state or gate infidelities in the regime of 1%--2%), one secret bit can be shared per second at a total channel loss budget of 157.6 dB, i.e. a total distance of 800 km for a fiber attenuation length of 22 km with repeater stations placed at every 100 km---a clear improvement over realistic twin-field or, much more pronouncedly, ideal point-to-point quantum key distribution at GHz clock rates.