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

arXiv:2204.10626

Log-Sobolev inequality and proof of Hypothesis of the Gaussian Maximizers for the capacity of quantum noisy homodyning

A. S. Holevo

Published Apr 22, 2022• 4 citations
arXivHTMLPDF

Abstract

In the present paper we give proof that the information-transmission capacity of the approximate position measurement with the oscillator energy constraint, which underlies noisy Gaussian homodyning in quantum optics, is attained on Gaussian encoding. The proof is based on general principles of convex programming. Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality. We hope that this method should work also for other models lying out of the scope of the "threshold condition" ensuring that the upper bound for the capacity as a difference between the maximum and the minimum output entropies is attainable.

DOI
10.48550/arxiv.2204.10626

Related papers

Logarithmic Sobolev inequality and Hypothesis of Quantum Gaussian Maximizers

Alexander Semenovich Holevo

A long-standing problem in quantum Shannon theory is the classical capacity of bosonic Gaussian channels of various kinds [6].The Hypothesis of Gaussian Maximizers (HGM) states that the full capacity of such channels is attained at Gaussian encodings.A breakthrough was made in the papers [1] and [2], where HGM was proved for the important class of multimode gauge co-or contra-variant Gaussian channels [4].In [8] and [5] the solution was extended to a much broader class of channels satisfying a certain 'threshold condition'.At the same time the HGM remains open for a large variety of Gaussian channels lying beyond the scope of the threshold condition [7].In this note we sketch a novel approach to such problems, based on principles of convex programming, and illustrate it using the characteristic case of an approximate position measurement with energy constraint, underlying noisy Gaussian homodyning in quantum optics.Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality.Let S be the convex set of all density operators in a separable Hilbert space H of the quantum system and X and Y be standard measurable spaces.Consider a measurement channel M : ρ → p ρ (y) = Tr ρm(y), where ρ ∈ S and m(y) is a uniformly bounded positive operator-valued function of y ∈ Y such that m(y) µ(dy) = I (I is the identity operator on H and µ is a measure).The encoding E = {π(dx), ρ(x)} is a probability measure π(dx) with a measurable family of

Russian Mathematical Surveys•Jan 1, 2022•2 citations

Proof of the Gaussian maximizers conjecture for the communication capacity of noisy heterodyne measurements

A. S. Holevo, S. N. Filippov

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.

arXiv:2206.02133•Jun 5, 2022•4 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•1 citation

An Optimization Problem Concerning Noise in Quantum Measurement Channels

Alexander Semenovich Holevo

Abstract In this work we apply the general convex programming approach of [A. S. Holevo, Lobachevskii J. Math. 43(7), 1646–1650 (2022)] to the problem of minimization of convex closure of the output differential entropy of quantum measurement channel, involved in computation of the classical capacity of the channel, and representing noise in the channel. We show that in the bosonic Gaussian case the optimality conditions derived from the convex programming approach lead to formulation of some new generalizations of the famous logarithmic Sobolev inequality which we call ‘‘homodyne’’ and ‘‘heterodyne’’ inequalities. We also show that the ‘‘heterodyne’’ inequality implies the ‘‘homodyne’’ one.

Lobachevskii Journal of Mathematics•Jun 1, 2023•6 citations

Probability Measures on the Set of Quantum States in Optimization Problems for Information Quantities

A. S. Holevo

A number of optimization problems in quantum information theory, such as one-shot classical capacity of a quantum channel, entanglement of formation of a state, classical capacity of a quantum observable, and accessible information of an ensemble of quantum states, can be formulated as the calculation of the convex closure of the output entropy of a certain quantum channel. This general problem can be considered as a convex programming problem for which necessary and sufficient optimality conditions can be established along with a dual problem. These optimality conditions imply some tight lower bounds for entropy, either quantum or classical, which are related to the famous logarithmic Sobolev inequality.

Theory of Probability and Its Applications•Aug 1, 2026•0 citations

From Qubit Tensorization to Gaussian Optimizers in Bosonic Systems

Salman Beigi, Hami Mehrabi

We develop a method for deriving Gaussian optimality results for bosonic quantum systems from inequalities for qubit systems. Inspired by Gross's derivation of the Gaussian logarithmic Sobolev inequality from an inequality on the two-point space, we use qubits as quantum two-point spaces and lift bosonic Weyl operators to pseudo-Weyl operators on large qubit systems. By controlling weighted norms and relative entropy in the fluctuation limit, we establish two transfer theorems that convert tensorized qubit inequalities into inequalities for bosonic Gaussian channels. As a first application, we prove that the sharp $2$-logarithmic Sobolev inequality for the bosonic Ornstein--Uhlenbeck semigroup tensorizes without loss in the constant. We also establish a sharp output entropy inequality for tensor powers of a class of qubit channels. This includes a quantum Mrs.~Gerber's lemma determining the minimum output entropy of tensor powers of the qubit depolarizing channel at fixed input entropy. Applying our relative entropy transfer theorem, we obtain multimode constrained minimum output entropy bounds for Gaussian additive-noise channels and thermal attenuators in the heating range.

quant-pharXiv:2610.28902•Oct 22, 2026•1 citation
In the present paper we give proof that the information-transmission capacity of the approximate position measurement with the oscillator energy constraint, which underlies noisy Gaussian homodyning in quantum optics, is attained on Gaussian encoding. The proof is based on general principles of convex programming. Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality. We hope that this method should work also for other models lying out of the scope of the "threshold condition" ensuring that the upper bound for the capacity as a difference between the maximum and the minimum output entropies is attainable.
A long-standing problem in quantum Shannon theory is the classical capacity of bosonic Gaussian channels of various kinds [6].The Hypothesis of Gaussian Maximizers (HGM) states that the full capacity of such channels is attained at Gaussian encodings.A breakthrough was made in the papers [1] and [2], where HGM was proved for the important class of multimode gauge co-or contra-variant Gaussian channels [4].In [8] and [5] the solution was extended to a much broader class of channels satisfying a certain 'threshold condition'.At the same time the HGM remains open for a large variety of Gaussian channels lying beyond the scope of the threshold condition [7].In this note we sketch a novel approach to such problems, based on principles of convex programming, and illustrate it using the characteristic case of an approximate position measurement with energy constraint, underlying noisy Gaussian homodyning in quantum optics.Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality.Let S be the convex set of all density operators in a separable Hilbert space H of the quantum system and X and Y be standard measurable spaces.Consider a measurement channel M : ρ → p ρ (y) = Tr ρm(y), where ρ ∈ S and m(y) is a uniformly bounded positive operator-valued function of y ∈ Y such that m(y) µ(dy) = I (I is the identity operator on H and µ is a measure).The encoding E = {π(dx), ρ(x)} is a probability measure π(dx) with a measurable family of
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.
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.
Abstract In this work we apply the general convex programming approach of [A. S. Holevo, Lobachevskii J. Math. 43(7), 1646–1650 (2022)] to the problem of minimization of convex closure of the output differential entropy of quantum measurement channel, involved in computation of the classical capacity of the channel, and representing noise in the channel. We show that in the bosonic Gaussian case the optimality conditions derived from the convex programming approach lead to formulation of some new generalizations of the famous logarithmic Sobolev inequality which we call ‘‘homodyne’’ and ‘‘heterodyne’’ inequalities. We also show that the ‘‘heterodyne’’ inequality implies the ‘‘homodyne’’ one.
A number of optimization problems in quantum information theory, such as one-shot classical capacity of a quantum channel, entanglement of formation of a state, classical capacity of a quantum observable, and accessible information of an ensemble of quantum states, can be formulated as the calculation of the convex closure of the output entropy of a certain quantum channel. This general problem can be considered as a convex programming problem for which necessary and sufficient optimality conditions can be established along with a dual problem. These optimality conditions imply some tight lower bounds for entropy, either quantum or classical, which are related to the famous logarithmic Sobolev inequality.
We develop a method for deriving Gaussian optimality results for bosonic quantum systems from inequalities for qubit systems. Inspired by Gross's derivation of the Gaussian logarithmic Sobolev inequality from an inequality on the two-point space, we use qubits as quantum two-point spaces and lift bosonic Weyl operators to pseudo-Weyl operators on large qubit systems. By controlling weighted norms and relative entropy in the fluctuation limit, we establish two transfer theorems that convert tensorized qubit inequalities into inequalities for bosonic Gaussian channels. As a first application, we prove that the sharp 222-logarithmic Sobolev inequality for the bosonic Ornstein--Uhlenbeck semigroup tensorizes without loss in the constant. We also establish a sharp output entropy inequality for tensor powers of a class of qubit channels. This includes a quantum Mrs.~Gerber's lemma determining the minimum output entropy of tensor powers of the qubit depolarizing channel at fixed input entropy. Applying our relative entropy transfer theorem, we obtain multimode constrained minimum output entropy bounds for Gaussian additive-noise channels and thermal attenuators in the heating range.