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

Tight bounds for private communication over bosonic Gaussian channels based on teleportation simulation with optimal finite resources

Riccardo Laurenza, Spyros Tserkis, Leonardo Banchi, Samuel L. Braunstein, Timothy C. Ralph, Stefano Pirandola

Published Oct 1, 2019• 13 citations
arXivHTMLPDF

Abstract

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret-key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely, the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an analytical class of finite-energy resource states allows us to closely approximate the ultimate bounds for increasing energy, so as to provide increasingly tight upper bounds to the secret-key capacity of one-mode phase-insensitive Gaussian channels. We then show that an optimization over the same class of resource states can be used to bound the maximum secret-key rates that are achievable in a finite number of channel uses.

DOI
10.1103/physreva.100.042301

Related papers

Finite-resource teleportation stretching for continuous-variable systems

Riccardo Laurenza, Samuel L. Braunstein, Stefano Pirandola

We show how adaptive protocols of quantum and private communication through bosonic Gaussian channels can be simplifed into much easier block versions that involve resource states with finite energy. This is achieved by combining an adaptive-to-block reduction technique devised earlier, based on teleportation stretching and relative entropy of entanglement, with a recent finite-resource simulation of Gaussian channels. In this way, we derive weak converse upper bounds for the secret-key capacity of phase-insensitive Gaussian channels which approximate the optimal limit for infinite energy. Our results apply to both point-to-point and repeater-assisted private communications.

arXiv:1706.06065•Scientific Reports•Oct 9, 2018•20 citations

Lower Bounding the Secret Key Capacity of Bosonic Gaussian Channels via Optimal Gaussian Measurements

Giuseppe Ortolano, Stefano Pirandola, Leonardo Banchi

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.

quant-pharXiv:2512.15502•Physical Review A•Dec 18, 2025•0 citations

Upper bounds on secret-key agreement over lossy thermal bosonic channels

Eneet Kaur, Mark M. Wilde

Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is evidence of having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., Phys. Rev. Lett. 119, 120503 (2017)] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement measure. As a consequence of this extension, we find tighter upper bounds on the nonasymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known. The lossy thermal bosonic channel serves as a more realistic model of communication than the pure-loss bosonic channel, because it can model the effects of eavesdropper tampering and imperfect detectors. An implication of our result is that the previously known upper bounds on the secret-key-agreement capacity of the thermal channel are too pessimistic for the practical finite-size regime in which the channel is used a finite number of times, and so it should now be somewhat easier to witness a working quantum repeater when using secret-key-agreement capacity upper bounds as a benchmark.

arXiv:1706.04590•Physical Review A•Dec 19, 2017•33 citations

Theory of channel simulation and bounds for private communication

Stefano Pirandola, Samuel L. Braunstein, Riccardo Laurenza +4 more

Abstract We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB (Pirandola et al 2017 Nat. Commun. 8 15043). We start by introducing a general weak converse bound for private communication based on the relative entropy of entanglement. We discuss how combining this bound with channel simulation and teleportation stretching, PLOB established the two-way quantum and private capacities of several fundamental channels, including the bosonic lossy channel. We then provide a rigorous proof of the strong converse property of these bounds by adopting a correct use of the Braunstein–Kimble teleportation protocol for the simulation of bosonic Gaussian channels. This analysis provides a full justification of claims presented in the follow-up paper WTB (Wilde et al 2017 IEEE Trans. Inf. Theory 63 1792–817) whose upper bounds for Gaussian channels would be otherwise infinitely large. Besides clarifying contributions in the area of channel simulation and protocol reduction, we also present some generalizations of the tools to other entanglement measures and novel results on the maximum excess noise which is tolerable in quantum key distribution.

arXiv:1711.09909•Quantum Science and Technology•May 31, 2018•143 citations

Entanglement theory and its applications in Gaussian quantum information

Spyros Tserkis

Entanglement is a physical property, emerging from the superposition of composite quantum systems, and manifested through non-classical correlations of quantum observables. In the field of Quantum Information, entanglement is considered the resource for various quantum protocols, so the ability to quantify it would allow us to associate it with the success of those protocols. Entanglement of formation is a proper way to quantify entanglement, but an analytical expression for this measure exists only for special cases. In this thesis, we focus on two-mode Gaussian states, and we derive narrow upper and lower bounds for this measure that get tight for several special cases. We further study how quantum teleportation and entanglement distillation can be employed in order to error-correct information encoded on a Gaussian state that suffers from Gaussian noise. In particular, we derive every physical state able to simulate a given phase-insensitive Gaussian channel through teleportation with finite-energy resources, and show how error-correction of a state is related to the simulation of a less decohering channel that the state has to pass through. We also discuss how the premise that the whole environment is under control of the adversary in quantum key distribution can be eliminated if we consider a teleportation-based eavesdropping attack. More specifically, we propose an all-optical teleportation attack that under collective measurements can reach optimality in the limit of infinite amount of entanglement, while for finite entanglement resources it outperforms the corresponding optimal individual attack. Finally, we show how using a class of finite-energy resource states we can increasingly approximate the infinite-energy bounds for decreasing purity, so that they provide tight upper bounds to the secret-key capacity of single-mode phase-insensitive Gaussian channels.

•Mar 27, 2020•0 citations

Teleportation stretching for lossy Gaussian channels

Ryo Namiki

If a quantum channel is commutable with a certain set of operators, a Choi state of the channel becomes a sufficient resource for any entanglement generation achieved by a single use of the channel with the help of local operation and classical communications (LOCC). This property, called the teleportation stretchable, could be useful to determine an upper bound of a fundamental rate-loss trade-off for optical quantum key distribution. Unfortunately, the known formulation of the teleportation-stretching expansion for lossy Gaussian channels is based on an additional assumption of the Choi state with infinite energy. In this paper, we present an entanglement-assisted LOCC protocol with a bounded energy entangled state, and identify a resource state being sufficient for a general entanglement generation protocol through a single use of lossy Gaussian channels. We also extend this protocol for the cases of general single-mode Gaussian channels. Our results provide a regular path to determine an ultimate limit of quantum communication.

arXiv:1603.05292•Mar 16, 2016•1 citation
Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret-key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely, the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an analytical class of finite-energy resource states allows us to closely approximate the ultimate bounds for increasing energy, so as to provide increasingly tight upper bounds to the secret-key capacity of one-mode phase-insensitive Gaussian channels. We then show that an optimization over the same class of resource states can be used to bound the maximum secret-key rates that are achievable in a finite number of channel uses.
We show how adaptive protocols of quantum and private communication through bosonic Gaussian channels can be simplifed into much easier block versions that involve resource states with finite energy. This is achieved by combining an adaptive-to-block reduction technique devised earlier, based on teleportation stretching and relative entropy of entanglement, with a recent finite-resource simulation of Gaussian channels. In this way, we derive weak converse upper bounds for the secret-key capacity of phase-insensitive Gaussian channels which approximate the optimal limit for infinite energy. Our results apply to both point-to-point and repeater-assisted private communications.
We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.
Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is evidence of having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., Phys. Rev. Lett. 119, 120503 (2017)] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement measure. As a consequence of this extension, we find tighter upper bounds on the nonasymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known. The lossy thermal bosonic channel serves as a more realistic model of communication than the pure-loss bosonic channel, because it can model the effects of eavesdropper tampering and imperfect detectors. An implication of our result is that the previously known upper bounds on the secret-key-agreement capacity of the thermal channel are too pessimistic for the practical finite-size regime in which the channel is used a finite number of times, and so it should now be somewhat easier to witness a working quantum repeater when using secret-key-agreement capacity upper bounds as a benchmark.
Abstract We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB (Pirandola et al 2017 Nat. Commun. 8 15043). We start by introducing a general weak converse bound for private communication based on the relative entropy of entanglement. We discuss how combining this bound with channel simulation and teleportation stretching, PLOB established the two-way quantum and private capacities of several fundamental channels, including the bosonic lossy channel. We then provide a rigorous proof of the strong converse property of these bounds by adopting a correct use of the Braunstein–Kimble teleportation protocol for the simulation of bosonic Gaussian channels. This analysis provides a full justification of claims presented in the follow-up paper WTB (Wilde et al 2017 IEEE Trans. Inf. Theory 63 1792–817) whose upper bounds for Gaussian channels would be otherwise infinitely large. Besides clarifying contributions in the area of channel simulation and protocol reduction, we also present some generalizations of the tools to other entanglement measures and novel results on the maximum excess noise which is tolerable in quantum key distribution.
Entanglement is a physical property, emerging from the superposition of composite quantum systems, and manifested through non-classical correlations of quantum observables. In the field of Quantum Information, entanglement is considered the resource for various quantum protocols, so the ability to quantify it would allow us to associate it with the success of those protocols. Entanglement of formation is a proper way to quantify entanglement, but an analytical expression for this measure exists only for special cases. In this thesis, we focus on two-mode Gaussian states, and we derive narrow upper and lower bounds for this measure that get tight for several special cases. We further study how quantum teleportation and entanglement distillation can be employed in order to error-correct information encoded on a Gaussian state that suffers from Gaussian noise. In particular, we derive every physical state able to simulate a given phase-insensitive Gaussian channel through teleportation with finite-energy resources, and show how error-correction of a state is related to the simulation of a less decohering channel that the state has to pass through. We also discuss how the premise that the whole environment is under control of the adversary in quantum key distribution can be eliminated if we consider a teleportation-based eavesdropping attack. More specifically, we propose an all-optical teleportation attack that under collective measurements can reach optimality in the limit of infinite amount of entanglement, while for finite entanglement resources it outperforms the corresponding optimal individual attack. Finally, we show how using a class of finite-energy resource states we can increasingly approximate the infinite-energy bounds for decreasing purity, so that they provide tight upper bounds to the secret-key capacity of single-mode phase-insensitive Gaussian channels.
If a quantum channel is commutable with a certain set of operators, a Choi state of the channel becomes a sufficient resource for any entanglement generation achieved by a single use of the channel with the help of local operation and classical communications (LOCC). This property, called the teleportation stretchable, could be useful to determine an upper bound of a fundamental rate-loss trade-off for optical quantum key distribution. Unfortunately, the known formulation of the teleportation-stretching expansion for lossy Gaussian channels is based on an additional assumption of the Choi state with infinite energy. In this paper, we present an entanglement-assisted LOCC protocol with a bounded energy entangled state, and identify a resource state being sufficient for a general entanglement generation protocol through a single use of lossy Gaussian channels. We also extend this protocol for the cases of general single-mode Gaussian channels. Our results provide a regular path to determine an ultimate limit of quantum communication.