Adam Bouland

Adam Bouland is an Assistant Professor of Computer Science at Stanford University, where he leads the CS Theory Group. His research focuses on quantum computation, computational complexity theory, and their connections to physics. He completed his Ph.D. at MIT under Scott Aaronson, followed by postdoctoral research at UC Berkeley and the Simons Institute under Umesh Vazirani.

His research explores fundamental questions in quantum computing including quantum complexity classes, quantum supremacy demonstrations, pseudorandom quantum states, quantum algorithm design, and connections to high-energy physics through AdS/CFT correspondence. Recent work investigates computational aspects of quantum systems, quantum learning theory, and noise resilience in quantum devices.

Professor Bouland leads an active research group including 6 PhD students and 1 postdoctoral researcher, with joint appointments across Computer Science, Physics, and ICME departments. He regularly teaches graduate courses on Quantum Computation (CS259Q) and Quantum Complexity Theory (CS359D).

His service includes program committee membership for major theoretical computer science conferences including FOCS, STOC, ITCS, and QIP.