Tom Gur

Prof. Tom Gur is a Fellow at the University of Cambridge, affiliated with the Department of Computer Science and Technology. His research focuses on classical and quantum complexity theory, with particular interests in sublinear algorithms, property testing, cryptography, zero-knowledge proofs, probabilistically checkable proofs, locally testable and decodable codes, computational learning theory, structure-versus-randomness, and harmonic analysis. His work is supported by various funding bodies, and he is associated with the Algorithms & Complexity and Quantum Computing groups. He teaches courses on complexity theory and quantum complexity theory and supervises PhD students and postdocs.

Tom Gur is a researcher at the University of Cambridge, specializing in Complexity Theory and Quantum Computing. His work explores the intersection of theoretical computer science and quantum information, focusing on sublinear algorithms, proof systems, and complexity lower bounds. He has contributed to areas such as distribution testing, locally testable codes, and quantum algorithms for estimating von Neumann entropy. His research also addresses the adaptivity and query complexity of interactive proofs and the implications of quantum computing on computational complexity. Gur's publications highlight the use of combinatorial and information-theoretic techniques to advance understanding in these fields.