About
I am a PhD student in computer science at Caltech, advised by Thomas Vidick, Urmila Mahadev, and John Preskill . I am broadly interested in quantum algorithm and quantum complexity, especially in understanding potential quantum advantage for solving quantum many-body systems, like estimating ground energy and preparing ground states / Gibbs states. Understanding quantum many-body systems are central questions in quanutum chemistry and condense matter physics, examples are the electronic structure problem, the 2D Hubbard model, and the SYK model. From a computer science perspective, many-body systems are the quantum anology of the famous Boolean satisfiability problem (SAT) and play a fundamental role in complexity and algorithm design.
My dream result would be finding rigorous and explicit evidence that quantum computer can provide advantage for the ground energy estimation problems, that is a many-body system which can be solved by efficient quantum algorithm, but not by any known efficient classical algorithm. Here explicit means the many-body system is of physics or chemistry interest. Examples of such results would be proving fast thermalization for SYK model and other natural Hamiltonians.
Recently I am working on quantum algorithms for Gibbs states preparation (Arxiv:2406.16023, Arxiv:2410.04909). Previously I was working on understanding the boundary of quantum advantage, for ground energy estimation with guided states (Arxiv:2309.10155), and the role of non-commutativity in the hardness of estimating ground energy (Arxiv:2309.04910). I am also interested in classical algorithms for ground energy estimation like quantum monte-caro method and tensor-network based method (Arxiv:2410.05414, Arxiv:2404.19023). I am getting more and more interested in fermionic Hamiltonian due to its close relationship with nature.
Feel free to contact me if you happen to be interested in similar questions, or just want to say hello :)