Find Academic Supervisors

Lijie ChenView profile

Assistant Professor

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +4 more

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Geometric Topology
• Geometric Group Theory
• Low-Dimensional Topology
• +6 more

Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.

Daniel M. KaneView profile

Professor

• Number Theory
• Combinatorics
• Complexity Theory
• +3 more

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Mike GilesView profile

Professor

• Monte Carlo Methods
• Multilevel Monte Carlo Methods
• Scientical Computing
• +5 more

Mike Giles is a Professor of Numerical Analysis at the University of Oxford's Mathematical Institute and serves as Head of the Numerical Analysis Group. He is also a Professorial Fellow at Balliol College and a Fellow of the Royal Society (FRS). His academic career spans computational mathematics, scientific computing, and computational finance. Professor Giles' research primarily focuses on Monte Carlo methods, with particular emphasis on the development and numerical analysis of multilevel Monte Carlo methods over the past 15 years. His work has significant applications in computational finance, uncertainty quantification, and solving stochastic differential equations. He has also made substantial contributions to high-performance computing, especially in the exploitation of many-core GPUs for scientific computing applications. His research bridges theoretical numerical analysis with practical computational implementations. Analysis of his publication record reveals a consistent trajectory of innovation in Monte Carlo methodology, evolving from foundational work on path simulation to sophisticated multilevel techniques that dramatically improve computational efficiency. His research spans multiple disciplines including numerical analysis, computational finance, and high-performance computing, with a clear focus on developing practical algorithms that address real-world computational challenges in science and finance. Fellow of the Royal Society (FRS) Professor Giles actively teaches courses in numerical methods for the MSc in Mathematical and Computational Finance and is a leading educator in GPU programming, organizing an annual intensive course on CUDA Programming on NVIDIA GPUs. He has been instrumental in establishing JADE, Oxford's GPU supercomputer facility, which supports research in machine learning and scientific computing. His leadership extends to the Numerical Analysis Group at Oxford and the Mathematical and Computational Finance Group, where he fosters interdisciplinary research connecting mathematics, finance, and computer science. Through his educational initiatives and research leadership, Giles has significantly influenced both academic research and practical applications of advanced computational methods.

Ben ClarkeView profile

Professor

• Mathematics Education
• Educational Psychology
• Special Education
• +3 more

Dr. Ben Clarke is an Associate Professor and Department Head of Special Education and Clinical Sciences at the University of Oregon’s College of Education. His research focuses on mathematical development, assessment systems, and school-based interventions to support student achievement. He has led over 20 federally funded grants totaling ~$55 million, emphasizing early numeracy interventions and multi-tiered instructional models. Clarke’s work bridges theory and practice, with publications on mathematics instruction, assessment, and RTI frameworks. Education: PhD (2002), MA (2001) in School Psychology/Special Education from University of Oregon; BS (1997) in Psychology from Wabash College (Phi Beta Kappa). Research Interests: Mathematics intervention design and efficacy Early numeracy assessment Multi-tiered systems of support (MTSS) Technology in education Equity in mathematics education Publications highlight his focus on intervention fidelity, tiered models, and outcomes for students with learning difficulties. Awards include the AERA Special Education SIG Research Award and recognition for academic excellence. Grants and Advising: Principal Investigator on ~$55M in federal grants; advises graduate students in School Psychology and Special Education. His lab develops evidence-based tools like the KinderTEK iPad program and contributes to national practice guides (e.g., IES RTI for Mathematics). Labs/Teams: Leads research teams focused on early mathematics intervention and MTSS implementation, collaborating with schools and policymakers to scale effective practices.

• Pure Mathematics
• Group Theory
• Algebraic Combinatorics
• +4 more

Professor Martin Liebeck is a Professor of Pure Mathematics and Head of the Pure Mathematics Section at the Department of Mathematics, Imperial College London. He is affiliated with the Algebra and Algebraic Combinatorics research groups and is part of the Mathematics research and teaching staff within the Faculty of Natural Sciences. His research interests span Pure Mathematics, with a focus on group theory, algebraic combinatorics, Lie groups, and representation theory. His work often involves the structure and properties of finite simple groups, algebraic groups, and their applications to permutation groups and character theory. Recent publications explore topics such as the actions of simple groups, unipotent classes in algebraic groups, character ratios, and the classification of permutation groups. His work frequently intersects with combinatorial and algebraic structures, with implications for both theoretical and applied mathematics. Professor Liebeck’s contributions include foundational studies on group generation, covering numbers, and character bounds, reflecting his deep engagement with the interplay between algebraic structures and combinatorial problems. His research has been published in leading mathematics journals, and he maintains an active academic profile through his personal webpage at http://www.ma.ic.ac.uk/~mwl/ .

• Cryptography
• Post-Quantum Cryptography
• Elliptic Curve Cryptography
• +3 more

David Jao is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on post-quantum cryptography, particularly leveraging isogenies of supersingular elliptic curves for secure cryptographic protocols. He is renowned for co-developing the Supersingular Isogeny Key Encapsulation (SIKE) protocol, a leading candidate for post-quantum cryptography standards. His work spans theoretical foundations and practical implementations, including optimizing isogeny-based systems for embedded devices and ARM processors. Research interests include isogeny-based cryptosystems, elliptic curve cryptography, zero-knowledge proofs, and cryptographic security against quantum attacks. He explores applications of expander graphs and Ramanujan graphs in cryptography, alongside algorithmic improvements for cryptographic protocols such as SIDH (Supersingular Isogeny Diffie-Hellman). Key contributions include advancements in key compression techniques for SIKE, side-channel attack mitigation, and formalizing security models for post-quantum key exchange. His publications analyze cryptographic hardness assumptions, such as the discrete logarithm problem in finite groups and the semidirect product structure in isogeny-based systems. Jao’s work bridges theoretical mathematics and applied cryptography, with a focus on ensuring practical security in next-generation cryptographic systems. His research addresses challenges in quantum-resistant authentication, key establishment, and digital signatures, often emphasizing efficiency and resistance to both classical and quantum attacks.

Valter MorettiView profile

Professor

• Algebraic Quantum Field Theory
• Black Holes
• Functional Analysis
• +10 more

Valter Moretti is a Full Professor in the Department of Mathematics at the University of Trento. His academic career spans roles from Research Fellow to Full Professor, focusing on Mathematical Physics and Quantum Field Theory (QFT) in curved spacetime. He earned an MSc in Physics from Genova University and a PhD in Theoretical Physics from Trento University. Research Interests : Algebraic QFT, General Relativity, Quantum Mechanics, Operator Algebras, and Spectral Theory. His work bridges mathematical rigor with physical applications, particularly in quantum localization, entanglement, and curved spacetime phenomena. Publications : Authored 15+ recent papers on topics like quantum particle localization, entanglement certification, and QFT on curved backgrounds. Collaborated on a 2022 patent for generating entangled photon states. Awards : Holds a patent for a quantum-certified random number generator (2022). Supervision : Advised 8 PhD students, including N. Pinamonti, L. Franceschini, and C. van de Ven. Coordinated national and international research projects (e.g., H2020-MSCA-COFUND-2015). Labs & Collaborations : Affiliated with INFN, TIFPA-INFN, and Q@TN (Quantum@Trento). Organized conferences like Quantum Physics and Geometry (2014) and Quantum Machine Learning (2023). Teaching : Lectures on Analytical Mechanics, Quantum Relativistic Theories, and Special Relativity. Authored textbooks on Spectral Theory and Quantum Mechanics.

Ghaith HiaryView profile

Professor

• Computational Number Theory
• Analytic Number Theory
• Random Matrix Theory
• +3 more

Ghaith Hiary is a Professor and Vice Chair for Graduate Recruitment in the Department of Mathematics at The Ohio State University. He holds a PhD from the University of Minnesota (2008). His research focuses on computational and analytic number theory, with emphasis on the Riemann zeta function, L-functions, random matrix theory, and asymptotic analysis. Hiary's work bridges theoretical mathematics and high-performance computation. He develops efficient algorithms (e.g., amortized-complexity methods) to evaluate zeta functions at extreme heights (e.g., near t=10 28 ), implemented in C++/Mathematica. His research uses random matrix models to study zeta-function moments and employs techniques like van der Corput estimates and hybrid methods for explicit bounds. His publications demonstrate consistent focus on zeta-function computations, factorization algorithms, and arithmetic biases. Recent work (2022-2025) explores invariant measures, Lehman's method generalizations, and sign changes in random multiplicative functions, maintaining strong ties to analytic and probabilistic number theory. Hiary shares code and datasets via GitHub, including implementations of T 1/3 algorithms for zeta computations. He collaborates with institutions like the University of Waterloo and maintains numerical databases of zeta zeros.

Ben GreenView profile

Professor

• Additive Combinatorics
• Analytic Number Theory
• Harmonic Analysis
• +3 more

Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.

Sean HoweView profile

Assistant Professor

• arithmetic geometry
• algebraic geometry
• representation theory
• +2 more

Sean Howe is an Assistant Professor in the Department of Mathematics at the University of Utah, where he has been employed since July 2019. His research is supported by NSF grants DMS-2201112 and DMS-2501816. In the academic year 2023-2024, he was a Friends of the Institute for Advanced Study Member at the special year on p-adic arithmetic geometry at the Institute for Advanced Study. Dr. Howe received his PhD from the University of Chicago in 2017 under the supervision of Matt Emerton. Prior to his position at Utah, he was an NSF Postdoctoral Scholar at Stanford University from September 2017 to June 2019. He earned a joint master's degree from Leiden University and Universite Paris-Sud 11 through the ALGANT program in 2012 and completed his undergraduate studies at the University of Arizona. Dr. Howe's research spans arithmetic and algebraic geometry, representation theory, and number theory, with a particular focus on p-adic aspects. His work often explores the connections between geometry and number theory through the lens of p-adic methods, including p-adic Hodge theory, perfectoid spaces, and the Langlands program. He has made significant contributions to understanding cohomological structures in mixed characteristic settings, the geometry of moduli spaces, and the statistical properties of L-functions. His extensive publication record demonstrates a strong trajectory in advancing p-adic geometry and its applications. Recent work shows increasing focus on cohomological smoothness in mixed characteristic, p-adic periods, and the interplay between random matrix theory and arithmetic statistics. His research often bridges abstract theoretical frameworks with concrete computational approaches. NSF Postdoctoral Scholar NSF grants DMS-2201112 and DMS-2501816 Dr. Howe is an active mentor, currently advising five PhD students: Minhua Cheng, Madison Delmoe, Shea Engle, Abhay Goel, and Suo Jun Tan. He has successfully graduated two PhD students: Matthew Bertucci (2025) and Hanlin Cai (2024). He also regularly mentors undergraduate researchers, with notable projects including Emil Geisler's work on stable multiplicities in configuration space cohomology and Daniel Koizumi's software for computing braid monodromy of cubic surfaces. His teaching portfolio includes advanced courses in algebraic topology, number theory, and algebra, reflecting his broad expertise across pure mathematics. He has taught courses such as Math 6950 (Topics in Algebraic Topology), Math 4400 (Introduction to Number Theory), and Math 6320 (Modern Algebra II).

Christophe VIGNATView profile

Professor

• Mathematics
• Number Theory
• Probability Theory
• +4 more

Christophe VIGNAT is a Professor at CentraleSupélec, affiliated with the Laboratoire des Signaux et Systèmes (L2S). His research focuses on number theory, special functions, probability, and their applications in signal processing and control systems. He has held visiting professorships at École Polytechnique Fédérale de Lausanne (EPFL) and Tulane University. VIGNAT's work bridges pure mathematics and applied fields, with notable contributions to Bernoulli/Euler polynomials, multiple zeta values, and probabilistic methods in number theory. His recent publications explore topics like partition functions, theta functions, and Ramanujan-type identities. He has delivered talks at international conferences and collaborates widely with researchers in mathematics and physics. Research Interests: Number theory, special functions (Bessel, orthogonal polynomials), probability theory, signal processing, control systems, analytic combinatorics, and their interconnections. His work often employs symbolic computation and probabilistic approaches to uncover identities and structures in mathematical analysis. Publications Trends: Recent articles emphasize partition theory, zeta functions, and integrals related to classical polynomials. His collaborations highlight interdisciplinary efforts between pure mathematics and applied sciences. Over 150 refereed papers and conference contributions demonstrate his prolific output across diverse mathematical domains. Education: While specific academic history isn’t detailed, his roles and publications suggest advanced training in mathematics and engineering, typical for a full professor in systems and control.

Olivier PfisterView profile

Professor

• Experimental Quantum Optics
• Quantum Information
• Quantum Computing
• +5 more

Olivier Pfister is a Professor in the Department of Physics at the University of Virginia , with courtesy appointments in Electrical and Computer Engineering (2022–). His research focuses on experimental quantum optics and quantum information , particularly leveraging optical frequency combs to develop scalable quantum computing platforms. The Quantum Fields and Quantum Information (QFQI) group , which he leads, has pioneered techniques for generating multipartite entanglement in continuous-variable systems, achieving cluster-state entanglement in 60+ qumodes (with potential scaling to thousands). Collaborations span institutions like NIST, University of Sydney, CUNY, and Jefferson Laboratory, with applications in quantum simulation , non-Gaussian state characterization , and hybrid quantum technologies . Key contributions include the 2013 APS Fellowship for groundbreaking work on quantum frequency combs, NSF Distinguished Research Awards , and patents in quantum photonic devices. His group’s NSF-funded research (e.g., QLCI Preliminary Proposal, $3.2M; RAISE-EquIP, $750K) explores fault-tolerant quantum computing, machine learning integration, and microresonator-based entanglement. Pfister’s scientific awards include the 2013 UVA Distinguished Research Career Award and the 1996 JILA Clever Idea Contest Second Prize . His students and postdocs (e.g., Amr Hossameldin , Miller Eaton , Rajveer Nehra ) have published extensively on quantum tomography, cluster states, and photonic detector design. Pfister also serves on advisory and planning committees at UVA, emphasizing interdisciplinary collaboration across physics , engineering , and quantum information .

Xiaocheng ShangView profile

Associate Professor

• Mathematical Optimization
• Data Science
• Numerical Analysis
• +3 more

Xiaocheng Shang is an Associate Professor in Mathematical Optimisation and Data Science at the University of Birmingham's School of Mathematics. His research focuses on numerical methods for stochastic differential equations, with applications in computational mathematics, statistics, physics, and data science. He is affiliated with the Optimisation and Numerical Analysis Group, Statistics and Data Science Group, and the Institute for Data and AI. Shang holds a PhD in Applied and Computational Mathematics from the University of Edinburgh (2016) and completed postdocs at the University of Edinburgh, Brown University, and ETH Zurich before joining Birmingham in 2019. His academic achievements include fellowships from The Alan Turing Institute, the LMS Emmy Noether Fellowship, and the EUniWell Leadership Fellowship. He has secured funding from EPSRC, the Royal Society, and the Isaac Newton Institute. Shang is actively involved in supervising PhD students and co-organizing research initiatives such as the Data Science and Computational Statistics Seminar. Research interests include structure-preserving integrators, Bayesian sampling techniques, and machine learning applications in dynamical systems. His work bridges numerical analysis, probability theory, and multiscale modeling in materials science. Recent projects involve neural networks for complex dynamical systems and numerical algorithms for deterministic/stochastic systems.