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

Capacity-approaching quantum repeaters for quantum communications

Masoud Ghalaii, Stefano Pirandola

Published Dec 15, 2020• 27 citations
arXivHTMLPDF

Abstract

In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network, encompassing the case of a quantum repeater chain. However, whether or not a physical design exists to approach such end-to-end capacities remains a challenging objective. Driven by this motivation, in this work we put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat. We also show that even in a noisy regime, our rates surpass the Pirandola-Laurenza-Ottaviani-Banchi bound. Our repeater setup is developed upon using noiseless linear amplifiers, quantum memories, and continuous-variable Bell measurements. Furthermore, we propose a nonideal model for continuous-variable quantum memories that we make use of in our design. We then show that potential quantum communication rates would deviate from the theoretical capacities, as one would expect, if the quantum link is too noisy, and/or if low-quality quantum memories and amplifiers are employed.

DOI
10.1103/physreva.102.062412

Related papers

End-to-end capacities of a quantum communication network

Stefano Pirandola

Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.

arXiv:1905.12674•Communications Physics•May 17, 2019•326 citations

Overcoming the repeaterless bound in continuous-variable quantum communication without quantum memories

Matthew S. Winnel, Joshua J. Guanzon, Nedasadat Hosseinidehaj +1 more

One of the main problems in quantum communications is how to achieve high rates at long distances. Quantum repeaters, i.e., untrusted, intermediate relay stations, are necessary to overcome the repeaterless bound which sets the fundamental rate-distance limit of repeaterless communications. In this work, we introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound using just one linear-optical device called a "quantum scissor", combining the entanglement distillation and entanglement swapping elements of previous repeater proposals into a single step, thus, removing the need for quantum memories. Implementing a standard continuous-variable quantum key distribution protocol using our repeater we predict key rates which surpass the repeaterless bound. Our protocol works well for non-ideal single-photon sources and non-ideal single-photon detectors, and can tolerate some level of excess noise, making our protocol implementable with existing technology. We show that our scheme can be extended to longer repeater chains using quantum memories, using less physical resources than previous schemes. Furthermore, for applications beyond key distribution, our scheme generalises to higher order and distils more entanglement at the cost of a reduced probability of success.

arXiv:2105.03586•May 8, 2021•6 citations

End-to-end capacities of a quantum communication network

Stefano Pirandola

In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.

•May 17, 2019•249 citations

Capacities of repeater-assisted quantum communications

Stefano Pirandola

We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical network theory, we derive single-letter upper bounds for the end-to-end capacities in repeater chains and quantum networks connected by arbitrary quantum channels, establishing exact formulas under basic decoherence models, including bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels. For the converse part, we adopt a teleportation-inspired simulation of a quantum network which leads to upper bounds in terms of the relative entropy of entanglement. For the lower bounds we combine point-to-point quantum protocols with classical network algorithms. Depending on the type of routing (single or multiple), optimal strategies corresponds to finding the widest path or the maximum flow in the quantum network. Our theory can also be extended to simultaneous quantum communication between multiple senders and receivers.

arXiv:1601.00966•Jan 5, 2016•77 citations

Design of Quantum Repeaters

Yi Li

Quantum communication holds the promise of achieving long-distance secure message transmission by exploiting quantum entanglement between remote locations. Quantum repeaters are indispensable to the realization of quantum networks for long-distance quantum communication. Similar to its classical analogue, a good quantum repeater should be able to compensate channel attenuation with a quantum amplifier, and to combat channel distortion through a quantum equaliser. This quantum repeater should also operate by an efficient and robust protocol. The first part of this project researches the continuous mode operation of a noiseless linear amplifier (NLA). We develop a dynamical model to describe the operation of the nondeterministic NLA in the regime of continuous-mode inputs. Both the quantum scissor based NLA and the photon addition-subtraction based NLA are analysed. Simulation results are also presented to confirm theoretical analysis. The second part proposes two quantum protocols. An atomic ensemble based quantum protocol is developed to generate distributed W-states. These generated distributed W-states could be considered as an entanglement resource between more than two distant nodes and would be useful in quantum communication and distributed quantum computation in the future. We also propose a protocol by which quantum key distribution can be achieved deterministically between multiple nodes.This deterministic quantum key distribution scheme may be used to guarantee secure communication for wireless sensor networks and Internet of Things. The last project analyses distortion of quantum channels and develops physically realisable modules to combat it. The minimum phase channel and non-minimum phase all pass channel are discussed separately.

•Jan 1, 2017•1 citation

End-to-end capacities of imperfect-repeater quantum networks

Cillian Harney, Stefano Pirandola

Abstract The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of both the ultimate capacities of quantum channels and the efficiency of imperfect quantum repeaters. In this work, using a recently developed node-splitting technique which introduces internal losses and noise into repeater devices, we present achievable end-to-end rates for noisy-repeater quantum networks. These are obtained by extending the coherent and reverse coherent information (single channel capacity lower bounds) into end-to-end capacity lower bounds, both in the context of single-path and multi-path routing. These achievable rates are completely general, and apply to networks composed of arbitrary channels arranged in general topologies. Through this general formalism, we show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds. As a result, we develop tools which provide tight performance bounds for quantum networks constituent of channels whose capacities are not exactly known, and reveal critical network properties which are necessary for high-rate quantum communications. This permits the investigation of pertinent classes of quantum networks with realistic technologies; qubit amplitude damping networks and bosonic thermal-loss networks.

arXiv:2207.05481•Quantum Science and Technology•Jun 23, 2022•7 citations
In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network, encompassing the case of a quantum repeater chain. However, whether or not a physical design exists to approach such end-to-end capacities remains a challenging objective. Driven by this motivation, in this work we put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat. We also show that even in a noisy regime, our rates surpass the Pirandola-Laurenza-Ottaviani-Banchi bound. Our repeater setup is developed upon using noiseless linear amplifiers, quantum memories, and continuous-variable Bell measurements. Furthermore, we propose a nonideal model for continuous-variable quantum memories that we make use of in our design. We then show that potential quantum communication rates would deviate from the theoretical capacities, as one would expect, if the quantum link is too noisy, and/or if low-quality quantum memories and amplifiers are employed.
Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
One of the main problems in quantum communications is how to achieve high rates at long distances. Quantum repeaters, i.e., untrusted, intermediate relay stations, are necessary to overcome the repeaterless bound which sets the fundamental rate-distance limit of repeaterless communications. In this work, we introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound using just one linear-optical device called a "quantum scissor", combining the entanglement distillation and entanglement swapping elements of previous repeater proposals into a single step, thus, removing the need for quantum memories. Implementing a standard continuous-variable quantum key distribution protocol using our repeater we predict key rates which surpass the repeaterless bound. Our protocol works well for non-ideal single-photon sources and non-ideal single-photon detectors, and can tolerate some level of excess noise, making our protocol implementable with existing technology. We show that our scheme can be extended to longer repeater chains using quantum memories, using less physical resources than previous schemes. Furthermore, for applications beyond key distribution, our scheme generalises to higher order and distils more entanglement at the cost of a reduced probability of success.
In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical network theory, we derive single-letter upper bounds for the end-to-end capacities in repeater chains and quantum networks connected by arbitrary quantum channels, establishing exact formulas under basic decoherence models, including bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels. For the converse part, we adopt a teleportation-inspired simulation of a quantum network which leads to upper bounds in terms of the relative entropy of entanglement. For the lower bounds we combine point-to-point quantum protocols with classical network algorithms. Depending on the type of routing (single or multiple), optimal strategies corresponds to finding the widest path or the maximum flow in the quantum network. Our theory can also be extended to simultaneous quantum communication between multiple senders and receivers.
Quantum communication holds the promise of achieving long-distance secure message transmission by exploiting quantum entanglement between remote locations. Quantum repeaters are indispensable to the realization of quantum networks for long-distance quantum communication. Similar to its classical analogue, a good quantum repeater should be able to compensate channel attenuation with a quantum amplifier, and to combat channel distortion through a quantum equaliser. This quantum repeater should also operate by an efficient and robust protocol. The first part of this project researches the continuous mode operation of a noiseless linear amplifier (NLA). We develop a dynamical model to describe the operation of the nondeterministic NLA in the regime of continuous-mode inputs. Both the quantum scissor based NLA and the photon addition-subtraction based NLA are analysed. Simulation results are also presented to confirm theoretical analysis. The second part proposes two quantum protocols. An atomic ensemble based quantum protocol is developed to generate distributed W-states. These generated distributed W-states could be considered as an entanglement resource between more than two distant nodes and would be useful in quantum communication and distributed quantum computation in the future. We also propose a protocol by which quantum key distribution can be achieved deterministically between multiple nodes.This deterministic quantum key distribution scheme may be used to guarantee secure communication for wireless sensor networks and Internet of Things. The last project analyses distortion of quantum channels and develops physically realisable modules to combat it. The minimum phase channel and non-minimum phase all pass channel are discussed separately.
Abstract The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of both the ultimate capacities of quantum channels and the efficiency of imperfect quantum repeaters. In this work, using a recently developed node-splitting technique which introduces internal losses and noise into repeater devices, we present achievable end-to-end rates for noisy-repeater quantum networks. These are obtained by extending the coherent and reverse coherent information (single channel capacity lower bounds) into end-to-end capacity lower bounds, both in the context of single-path and multi-path routing. These achievable rates are completely general, and apply to networks composed of arbitrary channels arranged in general topologies. Through this general formalism, we show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds. As a result, we develop tools which provide tight performance bounds for quantum networks constituent of channels whose capacities are not exactly known, and reveal critical network properties which are necessary for high-rate quantum communications. This permits the investigation of pertinent classes of quantum networks with realistic technologies; qubit amplitude damping networks and bosonic thermal-loss networks.