Daniel GrierView profile
Assistant Professor
Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.








