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

PPT-assisted capacities of bosonic Gaussian channels

Matthew Barber, Stefano Pirandola

Published Oct 18, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23459262

Related papers

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

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

quant-pharXiv:2610.22308•Oct 16, 2026•0 citations

Convex combinations of bosonic pure-loss channels

Giuseppe Catalano, Marco Fanizza, Francesco Anna Mele +2 more

The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.

quant-pharXiv:2604.26874•Apr 30, 2026•0 citations

Improved lower bound for the two-way-assisted quantum capacity of the bosonic thermal-loss channel

Matthew Barber, Stefano Pirandola

The bosonic thermal-loss channel is a fundamental model for quantum communication. This Gaussian channel models the transmission of bosonic systems subject to both loss and thermal noise. It describes many practical systems, including optical fibers, waveguides and free-space links, where background thermal noise is significant. Determining the channel's two-way-assisted quantum capacity, the maximum rate at which quantum information can be transmitted reliably through the channel with two-way classical assistance, remains an open problem. Here, we improve upon the best known lower bound for this capacity for a wide range of channel parameters. We achieve this by combining an improved qubit-bosonic distribution technique with a recently introduced technique for discovering entanglement distillation protocols.

quant-pharXiv:2609.27792•Aug 19, 2026•0 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

Energy-constrained two-way capacities of the pure-loss bosonic channel

Stefano Pirandola

Abstract: We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $\eta$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-\eta)N)$,where $g$ is the entropy of a thermal mode. This resolves the longstanding finite-energy capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-\eta)$. For parallel protocols with a hard total-photon-number cutoff, the same finite-energy capacity formula instead satisfies an exponential strong converse. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.

•Oct 6, 2026•0 citations
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.
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number NNN and allowed average decoding error εεε equals the vanishing-error capacity at mean photon number N/(1−ε)N/(1-ε)N/(1−ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.
The bosonic thermal-loss channel is a fundamental model for quantum communication. This Gaussian channel models the transmission of bosonic systems subject to both loss and thermal noise. It describes many practical systems, including optical fibers, waveguides and free-space links, where background thermal noise is significant. Determining the channel's two-way-assisted quantum capacity, the maximum rate at which quantum information can be transmitted reliably through the channel with two-way classical assistance, remains an open problem. Here, we improve upon the best known lower bound for this capacity for a wide range of channel parameters. We achieve this by combining an improved qubit-bosonic distribution technique with a recently introduced technique for discovering entanglement distillation protocols.
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 two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity η\etaη and mean photon number NNN, all four capacities coincide and are given by g(N)−g((1−η)N)g(N)-g((1-\eta)N)g(N)−g((1−η)N),where ggg is the entropy of a thermal mode. This resolves the longstanding finite-energy capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every N>0N>0N>0, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value −log⁡2(1−η)-\log_2(1-\eta)−log2​(1−η). For parallel protocols with a hard total-photon-number cutoff, the same finite-energy capacity formula instead satisfies an exponential strong converse. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.