Uploaded August 2026 | Updated November 2026, 3 days ago
Brice Huang (Stanford University)
https://simons.berkeley.edu/talks/brice-huang-stanford-university-2026-08-07
Diffusion Generative Modeling: Progress and Next Steps
We consider the problem of algorithmically sampling from the Gibbs measure of a mean field spin glass, a prototypical model of a "disordered" probability measure. We prove that two algorithms succeed at temperatures above a ''stochastic localization threshold'' temperature.
1) Our first result shows that a denoising diffusions-based algorithm samples from the Gibbs measure. This improves the guarantee of this algorithm over previous work, from vanishing Wasserstein to total variation error.
2) Our second result shows that simulated annealing of Langevin dynamics also succeeds, and is proved by a new local-to-global principle for analyzing simulated annealing. This is the first guarantee for a Markov chain in this problem beyond the ''uniqueness threshold,'' where the Langevin dynamics mix slowly from a worst-case initialization.
For the pure p-spin models, the temperature we achieve is within an absolute (p-independent) constant of the ''shattering transition,'' which is the conjectured computational threshold of this problem. Based on joint works with Andrea Montanari, Huy Tuan Pham, Sidhanth Mohanty, Amit Rajaraman, and David X. Wu.
Brice Huang (Stanford University)
https://simons.berkeley.edu/talks/brice-huang-stanford-university-2026-08-07
Diffusion Generative Modeling: Progress and Next Steps
We consider the problem of algorithmically sampling from the Gibbs measure of a mean field spin glass, a prototypical model of a "disordered" probability measure. We prove that two algorithms succeed at temperatures above a ''stochastic localization threshold'' temperature.
1) Our first result shows that a denoising diffusions-based algorithm samples from the Gibbs measure. This improves the guarantee of this algorithm over previous work, from vanishing Wasserstein to total variation error.
2) Our second result shows that simulated annealing of Langevin dynamics also succeeds, and is proved by a new local-to-global principle for analyzing simulated annealing. This is the first guarantee for a Markov chain in this problem beyond the ''uniqueness threshold,'' where the Langevin dynamics mix slowly from a worst-case initialization.
For the pure p-spin models, the temperature we achieve is within an absolute (p-independent) constant of the ''shattering transition,'' which is the conjectured computational threshold of this problem. Based on joint works with Andrea Montanari, Huy Tuan Pham, Sidhanth Mohanty, Amit Rajaraman, and David X. Wu.







![Ground Energy estimation of Quantum Impurity model is in BQP
Jiaqing Jiang (UC Berkeley)
https://simons.berkeley.edu/talks/jiaqing-jiang-uc-berkeley-2026-07-24
Quantum Summer Cluster Final Workshop
Estimating the ground-state energy of quantum many-body systems is a leading application of quantum computing. For general Hamiltonians, however, the problem is QMA-complete and is therefore unlikely to admit an efficient quantum algorithm. This motivates the search for natural classes of Hamiltonians whose ground-energy problem lies in BQP but is not known to lie in BPP.
In this talk, we identify quantum impurity Hamiltonians as one such class. These Hamiltonians are central to dynamical mean-field theory (DMFT), widely regarded as a gold-standard framework for studying strongly interacting quantum systems. Specifically, by explicitly constructing a guiding state, we give a polynomial-time quantum algorithm that estimates the ground-state energy of quantum impurity Hamiltonians to any inverse polynomial precision. Previously, the best unconditional upper bounds were a quasi-polynomial-time classical algorithm and containment of the corresponding decision problem in QCMA [Bravyi&Gosset arxiv:1609.00735]. Ground Energy estimation of Quantum Impurity model is in BQP](https://i.ytimg.com/vi/krqOy27VIu0/mqdefault.jpg)


