Uploaded November 2026 | Updated November 2026, 5 days ago
Graham Cox (Memorial University of Newfoundland)
https://simons.berkeley.edu/talks/graham-cox-memorial-university-newfoundland-2026-11-04
Beyond Graph Laplacians
For any eigenvector of a discrete Schrödinger operator on a finite graph, it is known that the nodal surplus is encoded in the variation of the corresponding eigenvalue when one imposes an external magnetic field. Alternately, one can cut the graph along certain edges and modify the potential accordingly. Both constructions show a close relationship between the eigenvector oscillation and the cycle space of the graph. I will present new results on a family of graph operators that combines both of the above mentioned deformations, explaining how they are related, and how they explore different parts of the cycle space.
Graham Cox (Memorial University of Newfoundland)
https://simons.berkeley.edu/talks/graham-cox-memorial-university-newfoundland-2026-11-04
Beyond Graph Laplacians
For any eigenvector of a discrete Schrödinger operator on a finite graph, it is known that the nodal surplus is encoded in the variation of the corresponding eigenvalue when one imposes an external magnetic field. Alternately, one can cut the graph along certain edges and modify the potential accordingly. Both constructions show a close relationship between the eigenvector oscillation and the cycle space of the graph. I will present new results on a family of graph operators that combines both of the above mentioned deformations, explaining how they are related, and how they explore different parts of the cycle space.




![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)





