Quantum computing has gained significant attention due to its potential to solve a set of computational problems faster than classical algorithms. A fully functional, scalable quantum computer could revolutionize fields such as scientific discovery, materials research, and chemistry. My research in quantum computing focuses on two key questions: How can we develop a reliable quantum computer whose output we can trust? and How can we utilize such a quantum computer for practical applications? To address these, my research is organized into four sub-directions:
Quantum Device Certification: Quantum computation is expected to outperform classical computation by an exponential margin. This raises a tough question: how can we be sure that these quantum devices are working correctly, or even that they are genuinely quantum? There’s a risk that a server might be using a classical device while falsely claiming to perform quantum computations. Addressing these concerns is essential for the continued trust and integration of quantum technologies into critical applications.
Quantum Error Correction: A major obstacle in building quantum computers is the fragility of quantum information, which is easily corrupted by noise. My research in this area focuses on quantum error correction as a way to protect quantum information. I explore approaches to make quantum error correction a practical reality.
Near-Term Quantum Computing: Can quantum computing devices outperform classical ones in the near future? This question drives my research into near-term quantum computing. I use both rigorous tools from quantum complexity theory as well as heuristic approaches to investigate the possibility of quantum advantage in the near future.
Computational Quantum Cryptography: In a future where quantum computers are fully operational, securing information will become crucial. My research in computational quantum cryptography focuses on designing cryptosystems with minimal assumptions, ensuring security even in a quantum-enabled world. Moreover, I am interested in the applications of these computational quantum cryptographic techniques in the three aforementioned sub-directions.
Total Papers: 53; Google Scholar Citations: 3,381 (as of September 23, 2025), Google Scholar
ORCID: 0000-0002-7776-6608.
Noisy Intermediate-Scale Quantum (NISQ) Algorithms, Rev. Mod. Phys. 94, 015004.
A computational test of quantum contextuality, and even simpler proofs of quantumness, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), solved a 60+ year-old open problem in quantum foundations. QIP 2025.
Strategic Code: A Unified Spatio-Temporal Framework for Quantum Error-Correction, arXiv:2405.17567. Provided a unified framework for all existing and future quantum error-correcting codes; accepted for talks at Beyond IID, AQIS 24, and TQC 2025.
Graph-Theoretic Framework for Self-Testing in Bell Scenarios, PRX Quantum 3, 030344. Side result: proved a 9-year-old graph theory conjecture.
Robust Self-Testing of Quantum Systems via Noncontextuality Inequalities, Physical Review Letters 122 (25), 250403.
Pseudorandom density matrices, PRX Quantum 6 (2), 020322.
Estimation of Hamiltonian parameters from thermal states, Physical Review Letters 133 (4), 040802.
Pseudorandom unitaries are neither real nor sparse nor noise-robust, Quantum 9, 1759. TQC 2024.
Convex optimization for non-equilibrium steady states on a hybrid quantum processor, Phys. Rev. Lett. 130, 240601 (2023)
Self-Testing of a Single Quantum System: Theory and Experiment, npj Quantum Information 9 (1), 103.
Capacity and Quantum Geometry of Parameterized Quantum Circuits, PRX Quantum 2, 040309.
Fault-tolerant hyperbolic Floquet quantum error correcting codes, Quantum 9, 1849 (2025).
Certifying sets of quantum observables with any full-rank state, Physical Review Letters 132 (14), 140201.