Michael A Forbes

Michael A. Forbes is an Assistant Professor at the Siebel School of Computing and Data Science, University of Illinois. His research focuses on algebraic complexity theory, including topics like polynomial identity testing, circuit lower bounds, and quantum computing. He has received the prestigious NSF CAREER Award (2021) for early-career excellence in research and education.

His work spans theoretical computer science and mathematics, with key contributions to algebraic circuits, proof complexity, and quantum cryptography. Notable publications include studies on low-depth circuit complexity and spatial isolation in zero-knowledge proofs. Collaborations involve institutions globally, emphasizing interdisciplinary approaches to computational challenges.

• Key Research Areas: Algebraic Complexity, Quantum Algorithms, Polynomial Ideals, Proof Systems
• Awards: NSF CAREER Award (2021)

His recent work (2022–2024) explores foundational aspects of computational complexity, bridging algebraic structures with practical algorithmic challenges. While no advisees are listed, his research often involves collaborative projects with graduate students and postdocs.