Gaussian optimizers for entropic inequalities in quantum information
Giacomo De Palma, Dario Trevisan, Vittorio Giovannetti, Luigi, Ambrosio

TL;DR
This paper reviews the progress on quantum Gaussian optimizer conjectures, which identify Gaussian states as optimal solutions for key quantum information optimization problems involving Gaussian channels, crucial for quantum communication.
Contribution
It surveys the current state of the art in proving the quantum Gaussian optimizer conjectures, connecting functional analysis, probability, and quantum information theory.
Findings
Quantum Gaussian states are conjectured to be optimal for several quantum channel problems.
The conjectures relate to fundamental inequalities like Entropy Power Inequality and Young's inequality.
Quantum Gaussian channels are essential for determining maximum communication rates in quantum optics.
Abstract
We survey the state of the art for the proof of the quantum Gaussian optimizer conjectures of quantum information theory. These fundamental conjectures state that quantum Gaussian input states are the solution to several optimization problems involving quantum Gaussian channels. These problems are the quantum counterpart of three fundamental results of functional analysis and probability: the Entropy Power Inequality, the sharp Young's inequality for convolutions, and the theorem "Gaussian kernels have only Gaussian maximizers." Quantum Gaussian channels play a key role in quantum communication theory: they are the quantum counterpart of Gaussian integral kernels and provide the mathematical model for the propagation of electromagnetic waves in the quantum regime. The quantum Gaussian optimizer conjectures are needed to determine the maximum communication rates over optical fibers and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
