The sign problem in quantum physics: room for algorithms and optimization - VVSOR - VVSOR

Vereniging voor Statistiek en Operations Research
17 December 2018

The sign problem in quantum physics: room for algorithms and optimization

On Monday (17/12/2018), we have another interesting talk in our Probability and Statistics seminar series at TU Delft.
All of you are very welcome.

Barbara Terhal (TU Delft, QuTech)When: Monday, December 17th, 16:00
Where: TU Delft, Faculty EWI, Mekelweg 4, EWI-Lecture hall F

 

The sign problem in quantum physics: room for algorithms and optimization

Quantum physical problems are described by a sparse Hermitian matrix called a Hamiltonian which obeys a certain locality structure allowing¬†for an efficient description. A subset of such Hamiltonians have been called sign-problem free or “stoquastic” as their smallest eigenvector¬†is the largest eigenvector of a nonnegative matrix. The connection with nonnegative matrices has allowed for the development¬†of various Quantum Monte Carlo methods to simulate features of these Hamiltonians in the¬†quantum physics community over the past 30 years.¬†As the non-negativity of a matrix is basis-dependent, local basis changes which preserve the locality structure of the Hamiltonian¬†can remove the sign problem. We report on our new results of finding such local basis changes algorithmically for subclasses of Hamiltonians.

More details on the seminar’s website:
https://www.tudelft.nl/en/ eemcs/the-faculty/departments/ applied-mathematics/applied- probability/events/seminars/