11:00 Thu 30 Aug – RED 351 11:00 Mon 03 Sep – RED 351 11:00 Wed 05 Sep – RED 359 11:00 Fri 07 Sep – RED 359 Biography. Dax Enshan Koh (Skoltech Summer Intern 2018 – Biamonte Group) is a PhD candidate in the Mathematics department at the Massachusetts Institute of Technology (MIT), advised[…]
What is the computational complexity of simulating a given Hamiltonian? What is the computational complexity of finding its ground state?
These questions are fundamental to condensed matter physics, to computational complexity but also have deep practical merit. Ground state quantum computation (e.g. adiabatic quantum computation) utilize properties of the ground states of Hamiltonians to compute.
Adiabatic quantum computing generally relies on the idea of embedding a problem instance into a physical system, such that the systems lowest energy configuration stores the problem instance solution. […]