Daniel Grier

Daniel Grier is an Assistant Professor in the Computer Science and Engineering department at the Jacobs School of Engineering and the Mathematics department at the University of California, San Diego. His research focuses on quantum complexity theory, particularly near-term quantum computing paradigms and proving quantum advantage over classical counterparts.

His educational background includes:

• PhD in Computer Science from MIT under Scott Aaronson
• B.S. in Computer Science and Mathematics from the University of South Carolina
• Postdoctoral research at the Institute for Quantum Computing at the University of Waterloo

Grier's research interests center on quantum computational complexity, with particular emphasis on demonstrating quantum advantage through rigorous complexity-theoretic proofs. His work spans quantum algorithms, circuit complexity, and the theoretical foundations of quantum computing. He has made significant contributions to understanding the complexity of BosonSampling variants, Clifford circuits, and interactive quantum protocols that demonstrate quantum advantage even with limited computational resources.

His publications reveal a consistent focus on establishing unconditional separations between quantum and classical computational power, particularly in near-term settings. His work often bridges theoretical computer science with practical considerations for implementing quantum algorithms on emerging hardware platforms, making him a key contributor to the field of quantum complexity theory.

His scientific achievements include:

• Best Paper Award at TQC 2025 / CCC 2025 for 'Quantum Threshold is Powerful'

Grier actively mentors students and has advised several researchers who have become co-authors on his publications. He teaches graduate and undergraduate courses including 'Quantum Complexity Theory,' 'Introduction to Quantum Computing,' and 'Discrete Mathematics and Graph Theory.' His teaching spans multiple departments, reflecting the interdisciplinary nature of his work.

He leads a research group focused on quantum complexity theory where students explore theoretical foundations of quantum computing, working on problems related to quantum advantage, circuit complexity, and quantum algorithms for near-term devices.