- David Kong and Andrew Zheng, Maryland, 2024 (co-supervised with James Watson)
Computing error bounds for quantum simulation algorithms
- Wentai Ding and Ruozhen Gong, Maryland, 2022 (co-supervised with Dhruv Devulapalli and Alexey Gorshkov)
Verification of quantum simulation
- Sam DeCoster, Nicole Dong, and Mason Whitman, Maryland, 2021 (co-supervised with Aniruddha Bapat, Alexey Gorshkov, and Eddie Schoute)
Routing on a defective grid
- Sam King and Hrishee Shastri, Maryland, 2020 (co-supervised with Aniruddha Bapat, Alexey Gorshkov, and Eddie Schoute)
- Bhaskar Roberts, Brennan Schaffner, and Finnegan Voichick, Maryland, 2019
- Hardik Bansal, Maryland, 2015 (co-supervised with Shelby Kimmel)
Entanglement cost of nonlocal measurements
- Vedang Vyas, Waterloo, 2014
- Mouktik Raha, Waterloo, 2013
- Melanie Jensenworth, Waterloo, 2012 (co-supervised with Michele Mosca)
Query complexity in the one clean qubit model
- DJ Strouse, Waterloo, 2010
- Rachael Taylor, Waterloo, 2009
The quantum query complexity of linear functions
- Ning Bao, Caltech, 2007
Quantum walks on distance-regular graphs
- Michael Kolodrubetz, Caltech, 2005
Asymptotic behavior of translation-invariant quantum algorithms for ordered searching
- Fen Zhao, MIT, 2004 (co-supervised with Edward Farhi)