Skip to content
DraconiticResearch
Search Sources API
186,086 studies31 sourcesUpdated 34 min ago
PreprintarXiv licencearXiv

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

Abstract

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality S(ρ)−S(σ)≤ Cρ(1−F(ρ,σ)) valid for any state σ, where Cρ is a constant depending on the rank of ρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality EF(ρ)−EF(σ)≤ Cρ(1−Trρσ) valid for any state σ, where Cρ is a constant depending on the Schmidt rank of ρ. In both cases the optimal constant Cρ is equal to the optimal constant Kd in the log-Sobolev inequality for the complete graph with d vertices: in the first case d=rankρ, in the second one d=rankρA=rankρB. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

Related

  1. A priori bounds for geodesic diameter. Part III. A Sobolev–Poincaré inequality and applications to a variety of geometric variational problems
    Ulrich Menne, Christian Scharrer
    Duke Mathematical JournalPeer-reviewedLicence not statedFull text8 citedGeneral mathematicsOpenAlex
  2. Sharp Quantitative Stability for the Affine p-Sobolev Inequality, Part II: The Case 1<p<2
    Song Fan, Gui-Dong Li, Jianjun Zhang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Log-Sobolev inequality for 2D SU(N) lattice gauge theory at all couplings
    Jack Piazza, Hao Shen
    arXivPreprintCC0Full textMathematical physicsProbabilityarXiv
  4. Sharp Gradient Stability for the Sobolev Trace Inequality
    Xi-Nan Ma, Yitian Zhang, Yang Zhou
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Trudinger-Moser type inequality in fractional Sobolev space with singularity on smooth submanifold
    Vivek Sahu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
BibTeX
@misc{holevo2026logsobolev,
  title = {{Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation}},
  author = {A. S. Holevo and M. E. Shirokov},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.12667},
  eprint = {2609.12667},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.12667},
}
RIS
TY  - UNPB
TI  - Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation
AU  - A. S. Holevo
AU  - M. E. Shirokov
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.12667
UR  - https://arxiv.org/abs/2609.12667
AB  - We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality S(ρ)−S(σ)≤ C_ρ(1−F(ρ,σ)) valid for any state σ, where C_ρ is a constant depending on the rank of ρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality E_F(ρ)−E_F(σ)≤ C_ρ(1−Trρσ) valid for any state σ, where C_ρ is a constant depending on the Schmidt rank of ρ. In both cases the optimal constant C_ρ is equal to the optimal constant K_d in the log-Sobolev inequality for the complete graph with d vertices: in the first case d=rankρ, in the second one d=rankρ_A=rankρ_B. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
ER  -