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:2609.39814

Sharp Quantum Entropy Mixing Rates and the Operator Layer Cake Theorem

Alexander Stottmeister

quant-phmath-phmath.OASubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

At what rate does the von Neumann entropy of an ensemble of quantum states change under Hamiltonian evolution of its constituents? Bravyi proposed the small incremental mixing conjecture controlling the mixing rate of a binary ensemble $\{(1\!-\!p,ρ_1),(p,ρ_2)\}$ by $c\,\|{H}\|h_{2}(p)$ (with the binary entropy $h_{2}$). The proof of Bravyi's conjecture was subsequently reduced to the matrix inequality $\|[A,\log B]\|_{1}\!\leq\! c\,h_{2}(p)$ for positive trace-class operators $A\!\leq\! B$ with $\text{Tr} A\!=\!p$ and $\text{Tr} B\!=\!1$ on separable Hilbert spaces by Mariën, Audenaert, Van Acoleyen, and Verstraete, and they conjectured the optimal constant to be $c\!=\!1$. Here, I prove the latter conjecture using an exact integral representation of the commutator $[A,\log B]$ obtained from the operator layer cake theorem, due to Cheng and Liu. The result gives a sharp dimension-independent limit on how rapidly unitary evolution of one component can change the entropy of a binary quantum ensemble. It follows that mixing rates satisfy small incremental mixing with the optimal constant, and entangling rates of bipartite Hamiltonians are bounded by $(2\log d\!+\!1)\|H\|$. Moreover, the result corrects a conjecture by Lieb and Vershynina for mixing rates of general ensembles.

AI Summary

The paper determines the optimal universal constant in small incremental mixing: how rapidly the entropy of a binary quantum ensemble can change when one constituent evolves unitarily. It proves that positive trace-class operators $0\leq A\leq B$, with $\operatorname{Tr}A=p$ and $\operatorname{Tr}B=1$, satisfy $\|[A,\log B]\|_1\leq h_2(p)$ on separable Hilbert spaces. This establishes the conjectured constant $c=1$; a family of two-dimensional examples approaches equality as $p\to0$. The proof uses the operator layer cake theorem to express the logarithmic commutator as an integral over spectral projections $P_t=\{\rho>t\sigma\}$, where $A=p\rho$ and $B-A=(1-p)\sigma$. The estimate $\|[\sigma,P_t]\|_1\leq\min\{1,t^{-1}\}$ then integrates to the binary entropy. Finite-dimensional compression extends the inequality to infinite dimension, with the commutator defined through a sesquilinear form on the support of $B$. For finite-dimensional dynamics, the result gives the sharp mixing bound $|\Lambda|\leq\|H\|h_2(p)$. For general ensembles with $\|H_i\|\leq1$, it yields $|\Lambda|\leq\sum_i h_2(p_i)\leq\min\{h(p)+1,2h(p)\}$; the factor $2$ is necessary, correcting a previously conjectured Shannon-entropy bound. Bravyi’s reduction gives the entangling-rate bound $|\Gamma|\leq d^2h_2(d^{-2})\|H\|\leq(2\log d+1)\|H\|$, where $d$ is the smaller interacting subsystem dimension. The optimal entangling-rate constant remains open: the conjectured $2\log d$ bound is not established. Extensions beyond type I operator algebras are left for future work.

No sign of AI-generated textAI use disclosed
LLMs were also used for grammar checking and writing assistance.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
4+1 pages, comments welcome!

Related papers

Upper bounds on mixing rates

Élliott H. Lieb, Anna Vershynina

We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states, with probabilities of p and 1-p, we prove that the mixing rate is bounded above by 4\sqrt{p(1-p)} for any Hamiltonian of norm 1. For a general ensemble of states with probabilities distributed according to a random variable X and individually evolving according to any set of bounded Hamiltonians, we conjecture that the mixing rate is bounded above by a Shannon entropy of a random variable $X$. For this general case we prove an upper bound that is independent of the dimension of the Hilbert space on which states in the ensemble act.

arXiv:1302.3865•Quantum Information and Computation•Nov 1, 2013•8 citations

Upper bounds on entangling rates of bipartite Hamiltonians

Sergey B. Bravyi

We discuss upper bounds on the rate at which unitary evolution governed by a nonlocal Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian $H$ coupling two finite dimensional particles $A$ and $B$, the entangling rate is shown to be upper bounded by $c\text{ }\text{log}(d)\ensuremath{\Vert}H\ensuremath{\Vert}$, where $d$ is the smallest dimension of the interacting particles, $\ensuremath{\Vert}H\ensuremath{\Vert}$ is the operator norm of $H$, and $c$ is a constant close to 1. Under certain restrictions on the initial state we prove an analogous upper bound for the ancilla-assisted entangling rate with a constant $c$ that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate---a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily.

arXiv:0704.0964•Physical Review A•Nov 21, 2007•68 citations

Optimal Trace Inequalities for Single-Shot Quantum Information

Gilad Gour

Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann--Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng \emph{et al.}\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-$W$ constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.

quant-pharXiv:2604.14617•Apr 17, 2026•1 citation

Sharp continuity of quantum conditional entropy

Mario Berta, Pablo Costa Rico, Gereon Kossmann +2 more

We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most $δ$ and $d=\dim A$, the optimal dimension-only modulus of continuity is $h_2(δ)+δ\log(d^2-1)$ up to $δ=1-d^{-2}$ and $2\log d$ thereafter, where $h_2$ denotes the binary entropy. When $\dim B\ge d$, this bound is tight for every $δ\in[0,1]$. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji \& Smith [IEEE ISIT (2020)], which follows a conceptually different approach.

quant-pharXiv:2607.24687•Jul 28, 2026•5 citations

Sharp estimates of quantum covering problems via a novel trace inequality

Hao–Chung Cheng, Li Gao, Christoph Hirche +2 more

In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering, privacy amplification, convex splitting, quantum information decoupling, and quantum channel simulation by removing some dimension-dependent factors. Moreover, the established one-shot bounds extend to infinite-dimensional separable Hilbert spaces as well. The proof techniques are based on the recently developed operator layer cake theorem and an operator change-of-variable argument, which are of independent interest.

arXiv:2507.07961•Jul 10, 2025•11 citations

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

A. S. Holevo, M. E. Shirokov

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(σ)\leq 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(σ)\leq C_ρ(1-\mathrm{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=\mathrm{rank}ρ$, in the second one $d=\mathrm{rank}ρ_A=\mathrm{rank}ρ_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

quant-pharXiv:2609.12667•Sep 14, 2026•2 citations
At what rate does the von Neumann entropy of an ensemble of quantum states change under Hamiltonian evolution of its constituents? Bravyi proposed the small incremental mixing conjecture controlling the mixing rate of a binary ensemble {(1 ⁣− ⁣p,ρ1),(p,ρ2)}\{(1\!-\!p,ρ_1),(p,ρ_2)\}{(1−p,ρ1​),(p,ρ2​)} by c ∥H∥h2(p)c\,\|{H}\|h_{2}(p)c∥H∥h2​(p) (with the binary entropy h2h_{2}h2​). The proof of Bravyi's conjecture was subsequently reduced to the matrix inequality ∥[A,log⁡B]∥1 ⁣≤ ⁣c h2(p)\|[A,\log B]\|_{1}\!\leq\! c\,h_{2}(p)∥[A,logB]∥1​≤ch2​(p) for positive trace-class operators A ⁣≤ ⁣BA\!\leq\! BA≤B with TrA ⁣= ⁣p\text{Tr} A\!=\!pTrA=p and TrB ⁣= ⁣1\text{Tr} B\!=\!1TrB=1 on separable Hilbert spaces by Mariën, Audenaert, Van Acoleyen, and Verstraete, and they conjectured the optimal constant to be c ⁣= ⁣1c\!=\!1c=1. Here, I prove the latter conjecture using an exact integral representation of the commutator [A,log⁡B][A,\log B][A,logB] obtained from the operator layer cake theorem, due to Cheng and Liu. The result gives a sharp dimension-independent limit on how rapidly unitary evolution of one component can change the entropy of a binary quantum ensemble. It follows that mixing rates satisfy small incremental mixing with the optimal constant, and entangling rates of bipartite Hamiltonians are bounded by (2log⁡d ⁣+ ⁣1)∥H∥(2\log d\!+\!1)\|H\|(2logd+1)∥H∥. Moreover, the result corrects a conjecture by Lieb and Vershynina for mixing rates of general ensembles.
The paper determines the optimal universal constant in small incremental mixing: how rapidly the entropy of a binary quantum ensemble can change when one constituent evolves unitarily. It proves that positive trace-class operators 0≤A≤B0\leq A\leq B0≤A≤B, with Tr⁡A=p\operatorname{Tr}A=pTrA=p and Tr⁡B=1\operatorname{Tr}B=1TrB=1, satisfy ∥[A,log⁡B]∥1≤h2(p)\|[A,\log B]\|_1\leq h_2(p)∥[A,logB]∥1​≤h2​(p) on separable Hilbert spaces. This establishes the conjectured constant c=1c=1c=1; a family of two-dimensional examples approaches equality as p→0p\to0p→0.
The proof uses the operator layer cake theorem to express the logarithmic commutator as an integral over spectral projections Pt={ρ>tσ}P_t=\{\rho>t\sigma\}Pt​={ρ>tσ}, where A=pρA=p\rhoA=pρ and B−A=(1−p)σB-A=(1-p)\sigmaB−A=(1−p)σ. The estimate ∥[σ,Pt]∥1≤min⁡{1,t−1}\|[\sigma,P_t]\|_1\leq\min\{1,t^{-1}\}∥[σ,Pt​]∥1​≤min{1,t−1} then integrates to the binary entropy. Finite-dimensional compression extends the inequality to infinite dimension, with the commutator defined through a sesquilinear form on the support of BBB.
For finite-dimensional dynamics, the result gives the sharp mixing bound ∣Λ∣≤∥H∥h2(p)|\Lambda|\leq\|H\|h_2(p)∣Λ∣≤∥H∥h2​(p). For general ensembles with ∥Hi∥≤1\|H_i\|\leq1∥Hi​∥≤1, it yields ∣Λ∣≤∑ih2(pi)≤min⁡{h(p)+1,2h(p)}|\Lambda|\leq\sum_i h_2(p_i)\leq\min\{h(p)+1,2h(p)\}∣Λ∣≤∑i​h2​(pi​)≤min{h(p)+1,2h(p)}; the factor 222 is necessary, correcting a previously conjectured Shannon-entropy bound. Bravyi’s reduction gives the entangling-rate bound ∣Γ∣≤d2h2(d−2)∥H∥≤(2log⁡d+1)∥H∥|\Gamma|\leq d^2h_2(d^{-2})\|H\|\leq(2\log d+1)\|H\|∣Γ∣≤d2h2​(d−2)∥H∥≤(2logd+1)∥H∥, where ddd is the smaller interacting subsystem dimension. The optimal entangling-rate constant remains open: the conjectured 2log⁡d2\log d2logd bound is not established. Extensions beyond type I operator algebras are left for future work.
We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states, with probabilities of p and 1-p, we prove that the mixing rate is bounded above by 4\sqrt{p(1-p)} for any Hamiltonian of norm 1. For a general ensemble of states with probabilities distributed according to a random variable X and individually evolving according to any set of bounded Hamiltonians, we conjecture that the mixing rate is bounded above by a Shannon entropy of a random variable XXX. For this general case we prove an upper bound that is independent of the dimension of the Hilbert space on which states in the ensemble act.
We discuss upper bounds on the rate at which unitary evolution governed by a nonlocal Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian HHH coupling two finite dimensional particles AAA and BBB, the entangling rate is shown to be upper bounded by $c\text{ }\text{log}(d)\ensuremath{\Vert}H\ensuremath{\Vert}$, where ddd is the smallest dimension of the interacting particles, $\ensuremath{\Vert}H\ensuremath{\Vert}$ is the operator norm of HHH, and ccc is a constant close to 1. Under certain restrictions on the initial state we prove an analogous upper bound for the ancilla-assisted entangling rate with a constant ccc that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate---a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily.
Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann--Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng \emph{et al.}\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-WWW constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.
We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most δδδ and d=dim⁡Ad=\dim Ad=dimA, the optimal dimension-only modulus of continuity is h2(δ)+δlog⁡(d2−1)h_2(δ)+δ\log(d^2-1)h2​(δ)+δlog(d2−1) up to δ=1−d−2δ=1-d^{-2}δ=1−d−2 and 2log⁡d2\log d2logd thereafter, where h2h_2h2​ denotes the binary entropy. When dim⁡B≥d\dim B\ge ddimB≥d, this bound is tight for every δ∈[0,1]δ\in[0,1]δ∈[0,1]. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji \& Smith [IEEE ISIT (2020)], which follows a conceptually different approach.
In this paper, we prove a novel trace inequality involving two operators. As applications, we sharpen the one-shot achievability bound on the relative entropy error in a wealth of quantum covering-type problems, such as soft covering, privacy amplification, convex splitting, quantum information decoupling, and quantum channel simulation by removing some dimension-dependent factors. Moreover, the established one-shot bounds extend to infinite-dimensional separable Hilbert spaces as well. The proof techniques are based on the recently developed operator layer cake theorem and an operator change-of-variable argument, which are of independent interest.
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(ρ,σ)) \,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,S(ρ)−S(σ)≤Cρ​(1−F(ρ,σ)) valid for any state σσσ, where CρC_ρ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ρσ) \,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,EF​(ρ)−EF​(σ)≤Cρ​(1−Trρσ) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the Schmidt rank of ρρρ. In both cases the optimal constant CρC_ρCρ​ is equal to the optimal constant KdK_{d}Kd​ in the log-Sobolev inequality for the complete graph with ddd vertices: in the first case d=rankρd=\mathrm{rank}ρd=rankρ, in the second one d=rankρA=rankρBd=\mathrm{rank}ρ_A=\mathrm{rank}ρ_Bd=rankρA​=rankρB​. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.