An official website of the United States government
Abstract We investigate the unbiased model for money exchanges: agents give at random time a dollar to one another (if they have one). Surprisingly, this dynamics eventually leads to a geometric distribution of wealth (shown empirically by Dragulescu and Yakovenko, and rigorously by several follow-up papers). We prove a uniform-in-time propagation of chaos result as the number of agents goes to infinity, which links the stochastic dynamics to a deterministic infinite system of ordinary differential equations. This deterministic description is then analyzed by taking advantage of several entropy–entropy dissipation inequalities and we provide a quantitative almost-exponential rate of convergence toward the equilibrium (geometric distribution) in relative entropy.
more »
« less
This content will become publicly available on July 8, 2026
The generalized Wehrl entropy bound in quantitative form
Lieb and Carlen have shown that mixed states with minimal Wehrl entropy are coherent states. We prove that mixed states with almost minimal Wehrl entropy are almost coherent states. This is proved in a quantitative sense where both the norm and the exponent are optimal and the constant is explicit. We prove a similar bound for generalized Wehrl entropies. As an application, a sharp quantitative form of the log-Sobolev inequality for functions in the Fock space is provided.
more »
« less
- Award ID(s):
- 1954995
- PAR ID:
- 10628067
- Publisher / Repository:
- EMS Publishing House
- Date Published:
- Journal Name:
- Journal of the European Mathematical Society
- ISSN:
- 1435-9855
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the two-dimensional (2D) Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code. Published by the American Physical Society2024more » « less
-
The fidelity-based smooth min-relative entropy is a distinguishability measure that has appeared in a variety of contexts in prior work on quantum information, including resource theories like thermodynamics and coherence. Here we provide a comprehensive study of this quantity. First we prove that it satisfies several basic properties, including the data-processing inequality. We also establish connections between the fidelity-based smooth min-relative entropy and other widely used information-theoretic quantities, including smooth min-relative entropy and smooth sandwiched Rényi relative entropy, of which the sandwiched Rényi relative entropy and smooth max-relative entropy are special cases. After that, we use these connections to establish the second-order asymptotics of the fidelity-based smooth min-relative entropy and all smooth sandwiched Rényi relative entropies, finding that the first-order term is the quantum relative entropy and the second-order term involves the quantum relative entropy variance. Utilizing the properties derived, we also show how the fidelity-based smooth min-relative entropy provides one-shot bounds for operational tasks in general resource theories in which the target state is mixed, with a particular example being randomness distillation. The above observations then lead to second-order expansions of the upper bounds on distillable randomness, as well as the precise second-order asymptotics of the distillable randomness of particular classical-quantum states. Finally, we establish semi-definite programs for smooth max-relative entropy and smooth conditional min-entropy, as well as a bilinear program for the fidelity-based smooth min-relative entropy, which we subsequently use to explore the tightness of a bound relating the last to the first.more » « less
-
Abstract A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form , , . We obtain a multidimensional version of this result, which can be regarded as a first step toward effectivising those cases of the multidimensional polynomial Szemerédi theorem involving polynomials with distinct degrees. In addition, we prove an effective “popular” version of this result, showing that every dense set has some non‐zero such that the number of configurations with difference parameter is almost optimal. Perhaps surprisingly, the quantitative dependence in this result is exponential, compared to the tower‐type bounds encountered in the popular linear Roth theorem.more » « less
-
Abstract A spectral minimal partition of a manifold is its decomposition into disjoint open sets that minimizes a spectral energy functional. It is known that bipartite spectral minimal partitions coincide with nodal partitions of Courant‐sharp Laplacian eigenfunctions. However, almost all minimal partitions are non‐bipartite. To study those, we define a modified Laplacian operator and prove that the nodal partitions of its Courant‐sharp eigenfunctions are minimal within a certain topological class of partitions. This yields new results in the non‐bipartite case and recovers the above known result in the bipartite case. Our approach is based on tools from algebraic topology, which we illustrate by a number of examples where the topological types of partitions are characterized by relative homology.more » « less
