Quantum computing explores the fundamental connections between computation, information processing, and quantum mechanics. On one hand, one asks how we can harness the unique behaviors of quantum mechanics, such as superposition and entanglement, for computation. On the other hand, one explores how computation can help us better understand our physical world. These are the central questions in this field, having significant implications for technological advancements, materials science, and fundamental research in computer science, mathematics, and natural sciences. The main goal of my research is to advance our understanding of these questions by developing new computational and theoretical tools.
Over the last few years, quantum hardware has seen huge advancements, not just in the number of qubits but also in their quality. Noisy intermediate-scale quantum (NISQ) devices, consisting of tens to hundreds of high-quality physical qubits, are becoming increasingly accessible. We’ve transitioned from the era of small, experimental quantum devices to the era of quantum utility, where quantum computers are becoming useful computational tools for scientific research. These advances have opened up new possibilities and challenges, making this a particularly exciting time for doing quantum computing research.
One of my current research interests is developing quantum-utility algorithms that are inherently noise-robust and scalable, designed not only to maximize the potential of current quantum systems but also to pave the way for error-corrected quantum computers of the future.
Measurement-induced entanglement phase transitions in variational quantum circuits (with R. Wiersema, J. F. Carrasquilla and Y. B. Kim), SciPost Phys., 14, 147, 2023.
Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz (with R. Wiersema, Y. de Sereville, J. F. Carrasquilla, Y. B. Kim and H. Yuen, PRX Quantum 1, 020319, 2020.
Despite the tremendous advancements in quantum hardware, demonstrating practical quantum advantages on these devices remains a significant challenge. At the same time, fully fault-tolerant quantum (FFTQ) computing, which relies on quantum error correction, is still far from realization due to the immense demand for high-quality physical qubits. Evolving in the regime between NISQ and FFTQ computing, early fault-tolerant quantum (EFTQ) computers––featuring small-scale, limited quantum error correction––offer great promise for demonstrating practical quantum advantages much sooner, potentially within the next decade. New algorithmic frameworks that can take full advantage of these emerging hardware capabilities are essential to realizing this potential.
One of my current research focuses is the development of computational frameworks and tools to bridge the gap between NISQ and EFTQ computation, with the ultimate goal of achieving practical quantum advantages.
In quantum systems, exotic quantum effects typically emerge at or near absolute zero temperature. But how complex are these low-temperature quantum states? This question stands as one of the most challenging and significant in condensed matter physics and theoretical computer science, with profound theoretical implications, such as the Quantum Probabilistically Checkable Proofs (PCP) Conjecture, and practical applications, including the pursuit of room-temperature superconductivity. Interestingly, computational approaches, such as tensor networks, optimization, machine learning, and computational complexity theory, provide powerful tools for exploring these questions.
I’m interested in developing 1) novel computational tools for probing quantum many-body models, such as SDP-based and machine learning approaches, and 2) theoretical tools for understanding the computational complexity of Local Hamiltonian problems (the quantum analogue of MAX-SAT), such as the Quantum MaxCut problem.