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

COHERENT STATES AS A TOOL FOR OBTAINING RIGOROUS BOUNDS

Élliott H. Lieb

Published May 1, 1994• 12 citations
Publisher

Abstract

This talk reviews some of the ways in which coherent states can be used to give rigorous bounds for quantities of physical interest and, in certain cases, can yield exact asymptotic formulas. Three main topics will be discussed. 1. The Berezin-Lieb inequalities which yield upper and lower bounds to quantum mechanical free energies in terms of classical free energies. 2. Coherent states (combined with a variational principle and correlation inequality) can generate upper and lower bounds for the ground state energies of atoms and other Coulomb systems. 3. Wehrl's conjecture about the entropy of coherent states.

DOI
10.1142/9789814503839_0020

Related papers

Wehrl entropy, coherent states and quantum channels

Peter Schupp

We review Wehrl’s definition of a semiclassical entropy in terms of coherent states and give an introductory overview of Lieb’s conjecture, its proof (including earlier results), generalizations, and the role of covariant quantum channels in this context. These structures motivate an alternative definition of coherent states and have interesting physical applications and implications.

arXiv:2203.08095•EMS Press eBooks•Jun 29, 2022•5 citations

QUANTUM COHERENT OPERATORS

Jan Philip Solovej

One application of coherent states is to use them as a link between a quantum system and its classical analog. This talk introduces a generalization of coherent states which can be used to compare different, but related, quantum systems, thereby generalizing the way that coherent states are used to compare quantum systems to classical systems. The main example will be the comparison of spin systems with different spin. As an application of this technique a rigorous estimate of the dependence of the free energy of the quantum Heisenberg model on the spin value will be presented.

•May 1, 1994•0 citations

From asymptotic hypothesis testing to entropy inequalities

Christoph Hirche

This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-$2$ entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.

arXiv:1812.05142•Dec 12, 2018•4 citations

Entropy power inequalities and classical capacities of bosonic noise channels

Robert König, Graeme Smith

Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.

IEEE/LEOS Summer Topical Meetings•Jul 1, 2013•0 citations

Coherent States: Applications in Physics and Mathematical Physics

John R. Klauder, Bo-Sture Skagerstam

This volume is a review on coherent states and some of their applications. The usefulness of the concept of coherent states is illustrated by considering specific examples from the fields of physics and mathematical physics. Particular emphasis is given to a general historical introduction, general continuous representations, generalized coherent states, classical and quantum correspondence, path integrals and canonical formalism. Applications are considered in quantum mechanics, optics, quantum chemistry, atomic physics, statistical physics, nuclear physics, particle physics and cosmology. A selection of original papers is reprinted

WORLD SCIENTIFIC eBooks•Apr 1, 1985•1,575 citations

Bounds on Information Combining With Quantum Side Information

Christoph Hirche, David Reeb

“Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kind of information combining is the addition of two binary random variables (a CNOT gate), and the resulting quantities play an important role in belief propagation and polar coding. We investigate this problem in the setting where quantum side information is available, which has been recognized as a hard setting for entropy power inequalities. Our main technical result is a non-trivial, and close to optimal, lower bound on the combined entropy, which can be seen as an almost optimal “quantum Mrs. Gerber's Lemma”. Our proof uses three main ingredients: 1) a new bound on the concavity of von Neumann entropy, which is tight in the regime of low pairwise state fidelities; 2) the quantitative improvement of strong subadditivity due to Fawzi-Renner, in which we manage to handle the minimization over recovery maps; and 3) recent duality results on classical-quantum-channels due to Renes et al. We furthermore present conjectures on the optimal lower and upper bounds under quantum side information, supported by interesting analytical observations and strong numerical evidence. We finally apply our bounds to polar coding for binary-input classical-quantum channels, and show the following three results: 1) even non-stationary channels polarize under the polar transform; 2) the blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity; and 3) under the aforementioned lower bound conjecture, a blocklength polynomial in the gap suffices.

arXiv:1706.09752•IEEE Transactions on Information Theory•May 31, 2018•16 citations
This talk reviews some of the ways in which coherent states can be used to give rigorous bounds for quantities of physical interest and, in certain cases, can yield exact asymptotic formulas. Three main topics will be discussed. 1. The Berezin-Lieb inequalities which yield upper and lower bounds to quantum mechanical free energies in terms of classical free energies. 2. Coherent states (combined with a variational principle and correlation inequality) can generate upper and lower bounds for the ground state energies of atoms and other Coulomb systems. 3. Wehrl's conjecture about the entropy of coherent states.
One application of coherent states is to use them as a link between a quantum system and its classical analog. This talk introduces a generalization of coherent states which can be used to compare different, but related, quantum systems, thereby generalizing the way that coherent states are used to compare quantum systems to classical systems. The main example will be the comparison of spin systems with different spin. As an application of this technique a rigorous estimate of the dependence of the free energy of the quantum Heisenberg model on the spin value will be presented.
This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-222 entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.
Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.
This volume is a review on coherent states and some of their applications. The usefulness of the concept of coherent states is illustrated by considering specific examples from the fields of physics and mathematical physics. Particular emphasis is given to a general historical introduction, general continuous representations, generalized coherent states, classical and quantum correspondence, path integrals and canonical formalism. Applications are considered in quantum mechanics, optics, quantum chemistry, atomic physics, statistical physics, nuclear physics, particle physics and cosmology. A selection of original papers is reprinted
“Bounds on information combining” are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kind of information combining is the addition of two binary random variables (a CNOT gate), and the resulting quantities play an important role in belief propagation and polar coding. We investigate this problem in the setting where quantum side information is available, which has been recognized as a hard setting for entropy power inequalities. Our main technical result is a non-trivial, and close to optimal, lower bound on the combined entropy, which can be seen as an almost optimal “quantum Mrs. Gerber's Lemma”. Our proof uses three main ingredients: 1) a new bound on the concavity of von Neumann entropy, which is tight in the regime of low pairwise state fidelities; 2) the quantitative improvement of strong subadditivity due to Fawzi-Renner, in which we manage to handle the minimization over recovery maps; and 3) recent duality results on classical-quantum-channels due to Renes et al. We furthermore present conjectures on the optimal lower and upper bounds under quantum side information, supported by interesting analytical observations and strong numerical evidence. We finally apply our bounds to polar coding for binary-input classical-quantum channels, and show the following three results: 1) even non-stationary channels polarize under the polar transform; 2) the blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity; and 3) under the aforementioned lower bound conjecture, a blocklength polynomial in the gap suffices.