CQuIC Seminars
Algorithms, Complexity, and Quantum Many-Body Physics
Presented by Cunlu Zhou
In this talk, I will discuss a few results about algorithms, complexity, and quantum many-body physics. The first one is about the so-called Hamiltonian Variational Ansatz, used in Variational Quantum Algorithms for approximating the ground states of condensed matter physics models. The second one is about a Quantum Phase Estimation algorithm based on compressed sensing, which achieves the Heisenberg limit and is suitable for early fault-tolerant quantum computers. Lastly, I will present an SU(2) symmetric semidefinite programming (SDP) hierarchy for the Quantum MaxCut problem, which connects the Heisenberg model in condensed matter physics with optimization algorithms and fundamental computational complexity questions such as the so-called Quantum PCP Conjecture. The talk is going to be rather high level, and no special background in quantum computation or theoretical computer science is assumed.
3:30 pm, Thursday, March 7, 2024
PAIS-2540, PAIS
Individuals with disabilities who need an auxiliary aid or service to attend or participate in P&A events should contact the Physics Department (phone: 505-277-2616, email: physics@unm.edu) well in advance to ensure your needs are accomodated. Event handouts can be provided in alternative accessible formats upon request. Please contact the Physics front office if you need written information in an alternative format.
A schedule of talks within the Department of Physics and Astronomy is available on the P&A web site at http://physics.unm.edu/pandaweb/events/index.php