I am a PhD student in Computer Science at UT Austin, where I am fortunate to have Scott Aaronson as my advisor. Previously, I was an undergrad in Mathematics with Computer Science at MIT.
I am broadly interested in quantum and classical complexity theory. Currently, much of my research focuses on (limitations of) quantum algorithms and (in)ability to apply classical algorithmic techniques in quantum computation.
On the side, I have a large interest in combination puzzles, especially Rubik's-type "twisty puzzles". I have designed more than a dozen unique 3D-printed twisty puzzles, all of which have been shared on the Twisty Puzzles forum, and most of which can be found in the Twisty Puzzles museum. Many of my designs are also available for download.
Email: (first 7 letters of last name, all lowercase)@cs.utexas.edu
Office: GDC 4.504E
Lower Bounding the AND-OR Tree via Symmetrization
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler
Subsumes arXiv:1808.02420 by Scott Aaronson and arXiv:1902.02398 by William Kretschmer
To be presented at QIP 2020.
Simulation of Qubit Quantum Circuits via Pauli Propagation
Patrick Rall, Daniel Liang, Jeremy Cook, William Kretschmer
Physical Review A 99, 062337 (2019)
Structured Factored Inference for Probabilistic Programming
Avi Pfeffer, Brian Ruttenberg, William Kretschmer, Alison O'Connor
Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS 2018)
Groups in Circle Puzzles
Game and Puzzle Design 3:2, 15-26 (2017)
Last updated: October 27, 2019