arXiv:2609.39814
Sharp Quantum Entropy Mixing Rates and the Operator Layer Cake Theorem
Alexander Stottmeister
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.
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!