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 Communications and Quantum Imaging

Converse bounds for private communication over bosonic Gaussian channels (Conference Presentation)

Stefano Pirandola

Published Nov 6, 2018• 0 citations
Publisher

Abstract

We consider private communication over bosonic Gaussian channels via the most general adaptive protocols based on local operations and two-way classical communication. These protocols include all the possible strategies allowed by quantum mechanics where two remote parties have local quantum computers but do not share prior quantum entanglement. In this context, Pirandola-Laurenza-Ottaviani-Banchi (PLOB) [Nat. Commun. 8, 15043 (2017)] established weak converse upper bounds for the secret key capacity of these channels. These bounds were computed by combining teleportation stretching, able to simplify any adaptive protocol into a block form, and the channel’s relative entropy of entanglement, so that data-processing properties allow one to write simple single-letter quantities. Here we discuss an extension of these bounds to repeater-assisted quantum communications. Then, using an energy-constrained version of the diamond norm and the Braunstein-Kimble teleportation protocol, we can rigorously show the strong converse property of the bounds discovered by PLOB. Our analysis provides a full mathematical justification of recent claims appeared in the literature.

DOI
10.1117/12.2320748

Related papers

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

Teleportation simulation of bosonic Gaussian channels: strong and uniform convergence

Stefano Pirandola, Riccardo Laurenza, Samuel L. Braunstein

We consider the Braunstein–Kimble protocol for continuous variable teleportation and its application for the simulation of bosonic channels. We discuss the convergence properties of this protocol under various topologies (strong, uniform, and bounded-uniform) clarifying some typical misinterpretations in the literature. We then show that the teleportation simulation of an arbitrary single-mode Gaussian channel is uniformly convergent to the channel if and only if its noise matrix has full rank. The various forms of convergence are then discussed within adaptive protocols, where the simulation error must be propagated to the output of the protocol by means of a “peeling” argument, following techniques from PLOB [S. Pirandola et al., Nat. Comm. 8, 15043 (2017)]. Finally, as an application of the peeling argument and the various topologies of convergence, we provide complete rigorous proofs for recently claimed strong converse bounds for private communication over Gaussian channels.

arXiv:1712.01615•The European Physical Journal D•Sep 1, 2018•14 citations

Energy-constrained two-way capacity bounds for noisy Gaussian channels

Stefano Pirandola

A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number constraint. The bound applies to arbitrary adaptive protocols with quantum memories and constrains the two-way quantum, entanglement-distribution, private, and secret-key capacities. It vanishes throughout the entanglement-breaking region and approaches the corresponding PLOB bound at infinite energy. At finite energy, it improves the evaluated Gaussian squashed-entanglement and PLOB bounds in relevant parameter regimes, while comparison with hashing rates quantifies the remaining gap to achievability. The result provides a common energy-dependent benchmark for noisy bosonic Gaussian channels and extends finite-energy converse methods beyond the quantum-limited setting.

quant-pharXiv:2610.08786•Oct 7, 2026•0 citations

PPT-assisted capacities of bosonic Gaussian channels

Matthew Barber, Stefano Pirandola

Abstract: We determine the exact quantum communication and entanglement-distribution capacities of three fundamental noisy bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than local operations and classical communication (LOCC), but cannot generate distillable entanglement on their own. For thermal loss, the unconstrained capacity coincides with the Pirandola–Laurenza–Ottaviani–Banchi (PLOB) bound throughout the non-entanglement-breaking regime. The corresponding upper bounds are also attained for thermal amplification and additive noise. We extend these results to energy-constrained communication, establishing exact capacities for all three channels at every prescribed mean input energy. Our results therefore solve a class of noisy bosonic capacity problems under PPT assistance and establish exact benchmarks for determining whether the same communication rates can be achieved using LOCC alone.

•Oct 18, 2026•0 citations

PPT-assisted capacities of bosonic Gaussian channels

Matthew Barber, Stefano Pirandola

We determine the exact quantum communication and entanglement-distribution capacities of three fundamental bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than local operations and classical communication (LOCC), but cannot generate distillable entanglement on their own. For thermal loss, the unconstrained capacity coincides with the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound throughout the non-entanglement-breaking regime. The corresponding upper bounds are also attained for thermal amplification and additive noise. We extend these results to energy-constrained communication, establishing exact capacities for all three channels at every prescribed mean input energy. Our results solve a class of bosonic capacity problems under PPT assistance and establish exact benchmarks for determining whether the same communication rates can be achieved via LOCC alone.

quant-pharXiv:2610.26783•Oct 20, 2026•0 citations

Converse Bounds for Private Communication Over Quantum Channels

Mark M. Wilde, Marco Tomamichel, Mario Berta

This paper establishes several converse bounds on the private transmission capabilities of a quantum channel. The main conceptual development builds firmly on the notion of a private state, which is a powerful, uniquely quantum method for simplifying the tripartite picture of privacy involving local operations and public classical communication to a bipartite picture of quantum privacy involving local operations and classical communication. This approach has previously led to some of the strongest upper bounds on secret key rates, including the squashed entanglement and the relative entropy of entanglement. Here, we use this approach along with a “privacy test” to establish a general meta-converse bound for private communication, which has a number of applications. The meta-converse allows for proving that any quantum channel's relative entropy of entanglement is a strong converse rate for private communication. For covariant channels, the meta-converse also leads to second-order expansions of relative entropy of entanglement bounds for private communication rates. For such channels, the bounds also apply to the private communication setting in which the sender and the receiver are assisted by unlimited public classical communication, and as such, they are relevant for establishing various converse bounds for quantum key distribution protocols conducted over these channels. We find precise characterizations for several channels of interest and apply the methods to establish converse bounds on the private transmission capabilities of all phase-insensitive bosonic channels.

arXiv:1602.08898•IEEE Transactions on Information Theory•Jan 5, 2017•154 citations
We consider private communication over bosonic Gaussian channels via the most general adaptive protocols based on local operations and two-way classical communication. These protocols include all the possible strategies allowed by quantum mechanics where two remote parties have local quantum computers but do not share prior quantum entanglement. In this context, Pirandola-Laurenza-Ottaviani-Banchi (PLOB) [Nat. Commun. 8, 15043 (2017)] established weak converse upper bounds for the secret key capacity of these channels. These bounds were computed by combining teleportation stretching, able to simplify any adaptive protocol into a block form, and the channel’s relative entropy of entanglement, so that data-processing properties allow one to write simple single-letter quantities. Here we discuss an extension of these bounds to repeater-assisted quantum communications. Then, using an energy-constrained version of the diamond norm and the Braunstein-Kimble teleportation protocol, we can rigorously show the strong converse property of the bounds discovered by PLOB. Our analysis provides a full mathematical justification of recent claims appeared in the literature.
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.
We consider the Braunstein–Kimble protocol for continuous variable teleportation and its application for the simulation of bosonic channels. We discuss the convergence properties of this protocol under various topologies (strong, uniform, and bounded-uniform) clarifying some typical misinterpretations in the literature. We then show that the teleportation simulation of an arbitrary single-mode Gaussian channel is uniformly convergent to the channel if and only if its noise matrix has full rank. The various forms of convergence are then discussed within adaptive protocols, where the simulation error must be propagated to the output of the protocol by means of a “peeling” argument, following techniques from PLOB [S. Pirandola et al., Nat. Comm. 8, 15043 (2017)]. Finally, as an application of the peeling argument and the various topologies of convergence, we provide complete rigorous proofs for recently claimed strong converse bounds for private communication over Gaussian channels.
A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number constraint. The bound applies to arbitrary adaptive protocols with quantum memories and constrains the two-way quantum, entanglement-distribution, private, and secret-key capacities. It vanishes throughout the entanglement-breaking region and approaches the corresponding PLOB bound at infinite energy. At finite energy, it improves the evaluated Gaussian squashed-entanglement and PLOB bounds in relevant parameter regimes, while comparison with hashing rates quantifies the remaining gap to achievability. The result provides a common energy-dependent benchmark for noisy bosonic Gaussian channels and extends finite-energy converse methods beyond the quantum-limited setting.
Abstract: We determine the exact quantum communication and entanglement-distribution capacities of three fundamental noisy bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than local operations and classical communication (LOCC), but cannot generate distillable entanglement on their own. For thermal loss, the unconstrained capacity coincides with the Pirandola–Laurenza–Ottaviani–Banchi (PLOB) bound throughout the non-entanglement-breaking regime. The corresponding upper bounds are also attained for thermal amplification and additive noise. We extend these results to energy-constrained communication, establishing exact capacities for all three channels at every prescribed mean input energy. Our results therefore solve a class of noisy bosonic capacity problems under PPT assistance and establish exact benchmarks for determining whether the same communication rates can be achieved using LOCC alone.
We determine the exact quantum communication and entanglement-distribution capacities of three fundamental bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than local operations and classical communication (LOCC), but cannot generate distillable entanglement on their own. For thermal loss, the unconstrained capacity coincides with the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound throughout the non-entanglement-breaking regime. The corresponding upper bounds are also attained for thermal amplification and additive noise. We extend these results to energy-constrained communication, establishing exact capacities for all three channels at every prescribed mean input energy. Our results solve a class of bosonic capacity problems under PPT assistance and establish exact benchmarks for determining whether the same communication rates can be achieved via LOCC alone.
This paper establishes several converse bounds on the private transmission capabilities of a quantum channel. The main conceptual development builds firmly on the notion of a private state, which is a powerful, uniquely quantum method for simplifying the tripartite picture of privacy involving local operations and public classical communication to a bipartite picture of quantum privacy involving local operations and classical communication. This approach has previously led to some of the strongest upper bounds on secret key rates, including the squashed entanglement and the relative entropy of entanglement. Here, we use this approach along with a “privacy test” to establish a general meta-converse bound for private communication, which has a number of applications. The meta-converse allows for proving that any quantum channel's relative entropy of entanglement is a strong converse rate for private communication. For covariant channels, the meta-converse also leads to second-order expansions of relative entropy of entanglement bounds for private communication rates. For such channels, the bounds also apply to the private communication setting in which the sender and the receiver are assisted by unlimited public classical communication, and as such, they are relevant for establishing various converse bounds for quantum key distribution protocols conducted over these channels. We find precise characterizations for several channels of interest and apply the methods to establish converse bounds on the private transmission capabilities of all phase-insensitive bosonic channels.