Explorerโ€บQuantum Computingโ€บQuantum Physics
Research PaperResearchia:202610.07014

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

Stefano Pirandola

Abstract

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...

Submitted: October 7, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

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.


Source: arXiv:2610.08786v1 - http://arxiv.org/abs/2610.08786v1 PDF: https://arxiv.org/pdf/2610.08786v1 Original Link: http://arxiv.org/abs/2610.08786v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Oct 7, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark