Proof of the Gaussian maximizers conjecture for the communication capacity of noisy heterodyne measurements
From MaRDI portal
Publication:6401162
DOI10.1007/S11005-023-01634-6arXiv2206.02133MaRDI QIDQ6401162FDOQ6401162
Authors: S. Filippov, Alexander S. Holevo 
Publication date: 5 June 2022
Abstract: Basing on recently developed convex programming framework in the paper [arXiv:2204.10626], we provide a proof for a long-standing conjecture on optimality of Gaussian encondings for the ultimate communication rate of generalized heterodyne receivers under the oscillator energy constraint. Our results generalize previous ones (obtained under the assumption of validity of the energy threshold condition) and show a drastic difference in the structure of the optimal encoding within and beyond this condition. The core of the proof in the case beyond the threshold is a new log-Sobolev type inequality, which relates the generalized Wehrl entropy with the wavefunction gradient.
Convex programming (90C25) Measures of information, entropy (94A17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)
This page was built for publication: Proof of the Gaussian maximizers conjecture for the communication capacity of noisy heterodyne measurements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401162)
