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

Uniqueness of the averaging measure in the three-matrix Sutter--Berta--Tomamichel trace inequality

Jérôme Nicolas

Published Aug 7, 2026• 0 citations
Publisher

Abstract

Sutter, Berta, and Tomamichel asked whether the averaging density \(\beta_0\) in their three-matrix trace inequality could be replaced by another probability distribution independent of the matrices. We show that it cannot. In every fixed dimension \(d\geq2\), if a Borel probability measure \(\mu\) satisfies the averaged inequality for all \(d\times d\) Hermitian triples, then \(\mathrm d\mu(t)=\beta_0(t)\,\mathrm d t\). The full rigidity is already detected in dimension two. No moment or regularity assumption is needed. The proof combines an exact, dimension-free Fourier representation of the averaged term with a second-order perturbation of the commuting configuration \(A=C=-B\), which determines the characteristic function of \(\mu\) at every frequency.

DOI
10.5281/zenodo.21843873

Related papers

On multivariate trace inequalities of Sutter, Berta, and Tomamichel

Marius Lemm

We consider a family of multivariate trace inequalities recently derived by Sutter, Berta, and Tomamichel. These inequalities generalize the Golden-Thompson inequality and Lieb’s triple matrix inequality to an arbitrary number of matrices in a way that features complex matrix powers (i.e., certain unitaries). We show that their inequalities can be rewritten as an n-matrix generalization of Lieb’s original triple matrix inequality. The complex matrix powers are replaced by resolvents and appropriate maximally entangled states. We expect that the technically advantageous properties of resolvents, in particular for perturbation theory, can be of use in applications of the n-matrix inequalities, e.g., for analyzing the performance of the rotated Petz recovery map in quantum information theory and for removing the unitaries altogether.

arXiv:1708.04836•Journal of Mathematical Physics•Jan 1, 2018•11 citations

Quantum de Finetti theorems for states and channels in any distance measure

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

Standard finite quantum de Finetti theorems approximate the $k$-system marginals of permutation-invariant states of $n$-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our $k/n$ error bound in max-relative entropy improves on the previously best known $k^2/n$ scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels $N^{(n)}:A^{\otimes n}\to B^{\otimes n}$, where $d_A=\dim A$, we prove that the $k$-system reduced channel is CP-dominated by a mixture of tensor-power channels with error $O(k/\sqrt{n})$ and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of $r$ defects, the representation error is at most $\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}$ and decays exponentially in $n$ for a suitable choice of parameters $r$ and $k$.

quant-pharXiv:2609.40343•Oct 1, 2026•0 citations

Multivariate Trace Inequalities

David Sutter, Mario Berta, Marco Tomamichel

We prove several trace inequalities that extend the Golden–Thompson and the Araki–Lieb–Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb’s triple matrix inequality. As an example application of our four matrix extension of the Golden–Thompson inequality, we prove remainder terms for the monotonicity of the quantum relative entropy and strong sub-additivity of the von Neumann entropy in terms of recoverability. We find the first explicit remainder terms that are tight in the commutative case. Our proofs rely on complex interpolation theory as well as asymptotic spectral pinching, providing a transparent approach to treat generic multivariate trace inequalities.

arXiv:1604.03023•Communications in Mathematical Physics•Oct 18, 2016•120 citations

Moment Methods for Uniform Average Mixing on Strongly Regular Graphs

Musung Kang

We study continuous-time quantum walks on connected strongly regular graphs that are not complete, observed at a random time drawn from a freely chosen probability law. Uniform average mixing (UAM) asks for a law under which every averaged transition probability equals $1/n$, where $n$ is the number of vertices. On a strongly regular graph this is equivalent to two affine constraints on three cosine moments. We construct a bounded, compactly supported time density for every strongly regular graph with nonintegral eigenvalues. For integral spectra we give an exact finite Toeplitz criterion and its Hankel form. Every averaged mixing matrix of such a graph is realized by at most two observation times. Three elementary inequalities on the moment line, which also give a short proof of Chan's classification of complex Hadamard matrices in the Bose-Mesner algebra, lead to a determination of all strongly regular graphs that admit UAM. Apart from the conference graphs of nonsquare order and the graphs with instantaneous uniform mixing, these are the members of two infinite families of parameter sets and their complements, and for them we give explicit laws with two observation times. The Petersen graph and its complement are the smallest members. A strongly regular graph with UAM admits a bounded time density exactly when it has no instantaneous uniform mixing. We also correct the classification of instantaneous uniform mixing on strongly regular graphs by Godsil, Mullin and Roy. Its sign condition excludes the halved $5$-cube, which mixes uniformly at time $π/4$. With the order $4θ^2$ read literally, its parity condition also excludes the Clebsch graph and includes the parameters $(36,14,4,6)$, for which no time law gives uniform average mixing.

quant-pharXiv:2610.10017•Oct 8, 2026•1 citation

Hermitization and the Poisson bracket-commutator correspondence as a consequence of averaging

Adriana I. Pesci, Raymond E. Goldstein, Hermann Uys

Here we present a study of the solutions and mathematical structure of the momentum-averaged Liouville (or Collisionless Boltzmann) equation in Fourier space. We show that the averaging procedure leads to a formalism identical to that of the density matrix of quantum mechanics. This mathematical mapping leaves the averages of all quantities unaltered and provides a unique way to construct the Hermitian version of a given operator. This seems to be the only method that resolves the ambiguity of Hermitization of operators that contain products of non-commuting variables. We also present a systematic perturbation scheme to evaluate correctly the classical solutions from the quantum ones and a formal proof of the approximate correspondence between the Poisson brackets and commutators.

Journal of Physics A Mathematical and General•Jan 11, 2006•1 citation

A Determinantal Inequality Involving Partial Traces

Minghua Lin

Abstract Let A be a density matrix in . Audenaert [J. Math. Phys. 48(2007) 083507] proved an inequality for Schatten p-norms: where Tr1 and Tr2 stand for the first and second partial trace, respectively. As an analogue of his result, we prove a determinantal inequality

Canadian Mathematical Bulletin•Jan 4, 2016•18 citations
Sutter, Berta, and Tomamichel asked whether the averaging density (\beta_0) in their three-matrix trace inequality could be replaced by another probability distribution independent of the matrices. We show that it cannot. In every fixed dimension (d\geq2), if a Borel probability measure (\mu) satisfies the averaged inequality for all (d\times d) Hermitian triples, then (\mathrm d\mu(t)=\beta_0(t),\mathrm d t). The full rigidity is already detected in dimension two. No moment or regularity assumption is needed. The proof combines an exact, dimension-free Fourier representation of the averaged term with a second-order perturbation of the commuting configuration (A=C=-B), which determines the characteristic function of (\mu) at every frequency.
We consider a family of multivariate trace inequalities recently derived by Sutter, Berta, and Tomamichel. These inequalities generalize the Golden-Thompson inequality and Lieb’s triple matrix inequality to an arbitrary number of matrices in a way that features complex matrix powers (i.e., certain unitaries). We show that their inequalities can be rewritten as an n-matrix generalization of Lieb’s original triple matrix inequality. The complex matrix powers are replaced by resolvents and appropriate maximally entangled states. We expect that the technically advantageous properties of resolvents, in particular for perturbation theory, can be of use in applications of the n-matrix inequalities, e.g., for analyzing the performance of the rotated Petz recovery map in quantum information theory and for removing the unitaries altogether.
Standard finite quantum de Finetti theorems approximate the kkk-system marginals of permutation-invariant states of nnn-systems by mixtures of independent and identically distributed (iid) states, usually in trace distance. We prove both standard and Renner's exponential de Finetti theorems in the stronger form of operator inequalities, implying bounds in every Schatten norm and for every quantum Rényi divergence satisfying data processing. In the standard case, for fixed local dimension, our k/nk/nk/n error bound in max-relative entropy improves on the previously best known k2/nk^2/nk2/n scaling, even in the classical setting. The operator-inequality approach is particularly suited to study channel de Finetti representations because operator order between Choi states is equivalent to completely positive (CP) order between the underlying channels. For permutation-covariant channels N(n):A⊗n→B⊗nN^{(n)}:A^{\otimes n}\to B^{\otimes n}N(n):A⊗n→B⊗n, where dA=dim⁡Ad_A=\dim AdA​=dimA, we prove that the kkk-system reduced channel is CP-dominated by a mixture of tensor-power channels with error O(k/n)O(k/\sqrt{n})O(k/n​) and polynomial dependence on the local dimensions, addressing a question raised by Berta et al. [Math. Program. 194, 781-829 (2022)]. Under the no-signalling condition, we also prove an exponential channel de Finetti theorem where the approximating mixture consists of Choi-almost-iid channels, whose normalized Choi states are almost-iid in the sense of Mazzola-Sutter-Renner. In the case of rrr defects, the representation error is at most poly(n)(2dA4k3/(nr2))(r+1)/2\mathrm{poly}(n)\bigl(2d_A^4k^3/(nr^2)\bigr)^{(r+1)/2}poly(n)(2dA4​k3/(nr2))(r+1)/2 and decays exponentially in nnn for a suitable choice of parameters rrr and kkk.
We prove several trace inequalities that extend the Golden–Thompson and the Araki–Lieb–Thirring inequality to arbitrarily many matrices. In particular, we strengthen Lieb’s triple matrix inequality. As an example application of our four matrix extension of the Golden–Thompson inequality, we prove remainder terms for the monotonicity of the quantum relative entropy and strong sub-additivity of the von Neumann entropy in terms of recoverability. We find the first explicit remainder terms that are tight in the commutative case. Our proofs rely on complex interpolation theory as well as asymptotic spectral pinching, providing a transparent approach to treat generic multivariate trace inequalities.
We study continuous-time quantum walks on connected strongly regular graphs that are not complete, observed at a random time drawn from a freely chosen probability law. Uniform average mixing (UAM) asks for a law under which every averaged transition probability equals 1/n1/n1/n, where nnn is the number of vertices. On a strongly regular graph this is equivalent to two affine constraints on three cosine moments. We construct a bounded, compactly supported time density for every strongly regular graph with nonintegral eigenvalues. For integral spectra we give an exact finite Toeplitz criterion and its Hankel form. Every averaged mixing matrix of such a graph is realized by at most two observation times. Three elementary inequalities on the moment line, which also give a short proof of Chan's classification of complex Hadamard matrices in the Bose-Mesner algebra, lead to a determination of all strongly regular graphs that admit UAM. Apart from the conference graphs of nonsquare order and the graphs with instantaneous uniform mixing, these are the members of two infinite families of parameter sets and their complements, and for them we give explicit laws with two observation times. The Petersen graph and its complement are the smallest members. A strongly regular graph with UAM admits a bounded time density exactly when it has no instantaneous uniform mixing. We also correct the classification of instantaneous uniform mixing on strongly regular graphs by Godsil, Mullin and Roy. Its sign condition excludes the halved 555-cube, which mixes uniformly at time π/4π/4π/4. With the order 4θ24θ^24θ2 read literally, its parity condition also excludes the Clebsch graph and includes the parameters (36,14,4,6)(36,14,4,6)(36,14,4,6), for which no time law gives uniform average mixing.
Here we present a study of the solutions and mathematical structure of the momentum-averaged Liouville (or Collisionless Boltzmann) equation in Fourier space. We show that the averaging procedure leads to a formalism identical to that of the density matrix of quantum mechanics. This mathematical mapping leaves the averages of all quantities unaltered and provides a unique way to construct the Hermitian version of a given operator. This seems to be the only method that resolves the ambiguity of Hermitization of operators that contain products of non-commuting variables. We also present a systematic perturbation scheme to evaluate correctly the classical solutions from the quantum ones and a formal proof of the approximate correspondence between the Poisson brackets and commutators.