Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.
Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.
Tzu-Mao Li is an Assistant Professor in the Department of Computer Science and Engineering (CSE) at the University of California, San Diego (UCSD), affiliated with the Center for Visual Computing. His research focuses on differentiable graphics algorithms, combining classical visual computing with modern machine learning techniques. He holds a Ph.D. from MIT CSAIL under Frédo Durand and a postdoc at MIT and UC Berkeley with Jonathan Ragan-Kelley. His work spans rendering, programming languages for graphics, Monte Carlo methods, and inverse problems. Education: B.S. and M.S. from National Taiwan University (2011-2013), advised by Yung-Yu Chuang. Ph.D. from MIT CSAIL (Computer Graphics Group), advised by Frédo Durand. Postdoctoral research at MIT and UC Berkeley with Jonathan Ragan-Kelley. Research Interests: Differentiable rendering, Monte Carlo integration, programming language design for visual computing, physical simulation, adversarial machine learning, and applications in computer vision and robotics. Key areas include rendering algorithms (path tracing, bidirectional methods), optimization techniques (MCMC, gradient-based), and neural representations (SDFs, neural fields). Publications focus on advancing rendering algorithms, differentiable systems, and applications in inverse problems. Notable contributions include edge sampling for differentiable rendering, warped-area sampling, and diffusion models for BSDF sampling. Awards: ACM SIGGRAPH 2020 Outstanding Doctoral Dissertation Award, multiple Best Paper Awards at SIGGRAPH, and oral presentations at ICCV. Teaching: Courses include CSE 167 (Computer Graphics), CSE 168 (Rendering), and CSE 272 (Advanced Image Synthesis), emphasizing physically-based methods and programming.
Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.
Seth Lloyd is a Professor of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), where he directs the Center for Extreme Quantum Information Theory (xQIT). His work bridges theoretical physics, quantum information science, and complex systems theory. He has made significant contributions to the foundations of quantum computing and quantum information processing. Lloyd received his education from prestigious institutions: B.A. from Harvard College (1982) M.Phil from Cambridge University (1984) as a Marshall Scholar Ph.D. in Physics from Rockefeller University (1988) Lloyd's research focuses on quantum information science, particularly quantum computation and quantum communications. He has pioneered work in quantum analog computation, quantum error correction, and quantum metrology. His research explores how quantum mechanics can be harnessed for information processing tasks, with applications ranging from quantum computing to understanding biological processes like photosynthesis. Lloyd is also known for his work on complex systems and the relationship between information and physical systems, arguing that the universe itself can be viewed as a quantum computer. His publication record shows a clear progression from foundational quantum computing work to applications in quantum machine learning and quantum biology. The most recent articles reveal a strong focus on quantum algorithms for machine learning, quantum metrology, and the intersection of quantum mechanics with biological systems. His work on the HHL algorithm for solving linear systems has been particularly influential in quantum machine learning, though its practical advantages have been debated following Ewin Tang's classical algorithms. Lloyd has received numerous scientific honors: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication Award (2012) International Quantum Communication Award (2012) Throughout his career, Lloyd has mentored numerous students and researchers in quantum information science. He has secured significant research funding for his work in quantum computing and complex systems. His research has been supported by various foundations and government agencies interested in advancing quantum technologies. Lloyd has also been involved in interdisciplinary collaborations, particularly with biologists studying quantum effects in photosynthesis. Lloyd directs the Center for Extreme Quantum Information Theory (xQIT) at MIT, which brings together researchers from physics, computer science, and engineering to tackle fundamental challenges in quantum information processing. His lab has been at the forefront of developing theoretical frameworks for quantum computing and exploring practical implementations of quantum information protocols.
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.
Alexey Gorshkov is an Adjunct Professor at the University of Maryland (UMD) affiliated with the Joint Quantum Institute (JQI) and the Quantum Information and Computer Science Laboratory (QuICS). His primary academic role is in theoretical physics, focusing on quantum optics, quantum information science, and condensed matter physics. He leads a research group exploring quantum magnetism with alkaline-earth atoms, driven-dissipative systems, topological matter, and strongly interacting photons. His work bridges AMO (atomic, molecular, and optical) systems with high-energy and condensed matter physics, emphasizing quantum simulation and novel quantum technologies like precise clocks and quantum computers. Education details are not explicitly listed, but his research collaborations with institutions like JQI and UMD suggest advanced academic training in theoretical physics. His research interests revolve around understanding and controlling quantum many-body systems, particularly in far-from-equilibrium scenarios, entanglement dynamics, and dissipation effects. He has contributed to studies on Rydberg atoms, quantum routing protocols, and error mitigation in quantum simulators. Recent articles highlight his work on quantum protocols for verifying speedups, time-independent information flow, and entanglement dynamics. His group's achievements include demonstrating one-dimensional anyons and developing methods for correlated noise estimation with quantum sensors. Awards and grants are not explicitly mentioned in the provided text, but his prolific publication record indicates sustained research impact. Labs and teams associated with him include the JQI and QuICS, where he collaborates on experimental and theoretical projects. Graduate student and postdoc positions are available in his group, focusing on areas like quantum magnetism and topological systems. His work often involves close ties with experimental groups, emphasizing practical applications of theoretical breakthroughs.
Brian Conrad is a Professor of Mathematics at Stanford University, specializing in number theory and arithmetic geometry. He holds a position in the Department of Mathematics and has contributed extensively to algebraic geometry, algebraic number theory, and representation theory. His research encompasses foundational work on reductive groups, pseudo-reductive groups, and their applications in arithmetic contexts. Dr. Conrad is an editor for the Journal of the AMS, Algebra and Number Theory, and IMRN. He has organized numerous learning seminars, including those on étale cohomology and the BSD conjecture, and has taught advanced courses on algebraic geometry, class field theory, and modular forms. His work bridges classical algebraic geometry with modern arithmetic applications, emphasizing foundational proofs and geometric intuition. His editorial roles and seminar leadership reflect his commitment to advancing mathematical exposition and education. Education details are not explicitly provided in the texts, but his academic trajectory includes significant contributions to the field through publications and mentorship. Dr. Conrad's research has led to advancements in areas such as the classification of algebraic groups, étale cohomology, and the arithmetic of elliptic curves. His collaborative work with mathematicians like Chai, Oort, and Prasad has produced influential monographs, including Pseudo-reductive Groups and Complex Multiplication and Lifting Problems .
John MacFarlane is a Professor of Philosophy at the University of California, Berkeley , with affiliations to the Group in Logic and the Methodology of Science and co-organizer roles in the Meaning Sciences Club and Townsend Center Working Group . His research spans philosophy of language, philosophical logic, metaphysics, epistemology, philosophy of mathematics, history of logic , and ancient philosophy , particularly Aristotle . He has held visiting positions at institutions like École des Hautes Études en Sciences Sociales (EHESS), Paris . Education : Ph.D. in Philosophy (2000, University of Pittsburgh), M.A. in Classics (1997) and Philosophy (1994), A.B. summa cum laude in Philosophy (1991, Harvard). Research Interests focus on semantic relativism , particularly assessment sensitivity as explored in his book Assessment Sensitivity: Relative Truth and Its Applications (Oxford, 2014). He investigates how epistemic modals and vagueness interact with truth evaluation. His work in philosophical logic includes a textbook Philosophical Logic: A Contemporary Introduction (Routledge, 2021). Secondary interests include ancient philosophy (Aristotle, Plato), formal logic , and fiddlosophy . Article Trends reveal contributions to relativism , epistemic modals , vagueness , and logicism . His recent work (2025) examines Plato’s Protagoras and belief utility , while 2022–2020 articles address semantic indecision and probabilistic knowledge . Earlier works (2008–2000) include foundational studies on Frege, Kant, and Aristotle . Scientific Awards include a 2023 Residential Fellowship at Wissenschaftskolleg, Berlin (declined), 2016–17 Fellow at IEA Paris , and 2015 American Academy of Arts and Sciences membership . He has received multiple Humanities Research Fellowships at Berkeley (2016, 2008, 2003) and Research Enabling Grants (2000–2009). Advising includes supervising 15+ PhD students in areas like logic, epistemology, and philosophy of language . Notable advisees include Richard Lawrence (2017) and Sophie Dandelet (2021). He also guided honors theses at Berkeley, such as Benjamin Logan’s work on epistemic modals (2018). Labs and Teams involve co-organizing the Townsend Center Working Group in History and Philosophy of Logic, Mathematics, and Science and contributing to the Group in Logic and Methodology of Science . His interdisciplinary approach integrates philosophy, logic, and computational tools , including creating Pandoc for document conversion.
Jeremy Hahn is an Assistant Professor at the Massachusetts Institute of Technology (MIT), affiliated with the Department of Mathematics within the School of Science. His research focuses on Algebraic Topology, particularly structured ring spectra, chromatic homotopy theory, and equivariant homotopy theory. Supported by grants from the Sloan Foundation and the National Science Foundation (DMS-1803273), his work has contributed to foundational advances in topological K-theory, algebraic K-theory, and manifold topology. Education details are not explicitly listed, though past teaching roles at Harvard University suggest prior academic training. His research interests span topics including: Structured ring spectra constructions (e.g., truncated Brown-Peterson spectra) Chromatic redshift phenomena and algebraic K-theory Equivariant orientations and C_p actions Applications of homotopy theory to manifold classification Notable recent work includes counterexamples to Ravenel's telescope conjecture, advancements in motivic filtrations of topological cyclic homology, and the construction of multiplicative structures on classical spectra. Collaborations with researchers such as Robert Burklund, Dylan Wilson, and Allen Yuan reflect his active engagement in the global topology research community. Teaching includes advanced courses like Algebraic Topology I (18.905) and past roles as a teaching assistant for Linear Algebra (18.06) and multivariable calculus at MIT. His research has been supported by multiple NSF grants and the Sloan Fellowship, indicating sustained academic excellence and leadership in the field.
Ksana Blank is a Senior Lecturer at Princeton University’s Department of Slavic Languages and Literatures. She coordinates the Russian Language Program and directs the Princeton-in-Petersburg Program, fostering academic exchange and interdisciplinary research. With a PhD in Russian Literature (Columbia University, 1997) and a BA in French Philology (St. Petersburg State University, 1979), her academic career spans over two decades at Princeton, preceded by teaching roles at Hunter College and Middlebury College Russian Summer School. Education: PhD, Russian Literature, Columbia University (1997) BA, French Philology, St. Petersburg State University (1979) Her research centers on Russian literature, emphasizing stylistic analysis and interdisciplinary connections with music, visual arts, folklore, and religious philosophy. Notable works include studies on Dostoevsky’s dialectics, Gogol’s The Nose , and the interplay between Russian modernism and Western art movements. She has authored multiple books and articles, many translated into Russian, and has published in academic journals across Russia, Europe, and China. Recent publications explore Dostoevsky’s paradoxes, Gogol’s linguistic innovation, and the intersection of Russian literature with music (Shostakovich), art (Malevich), and philosophy. Her 2023 book Парадоксы классики expands traditional interpretations of classic works through interdisciplinary lenses, while her 2021 The Nose guide deciphers Gogol’s wordplay and its narrative function. Earlier works address Tolstoy’s spiritual crisis and Bakhtinian dialogism in Russian literary theory. While no scientific awards are listed, her contributions to pedagogy include advanced Russian language courses and graduate-level Tolstoy studies. She currently works on Leo Tolstoy’s The Prisoner of the Caucasus and teaches courses on Russian literature, spirituality, and translation.
Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).
Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Dr. Samir H. Mushrif is a Professor in the Department of Chemical and Materials Engineering at the University of Alberta . Prior to this role, he served as faculty at the School of Chemical and Biomedical Engineering at Nanyang Technological University (NTU), Singapore . He holds a PhD in Chemical Engineering from McGill University and completed postdoctoral research at the University of Delaware, USA . Education : PhD (Chemical Engineering, McGill University), Postdoc (University of Delaware) His research focuses on computational catalysis , molecular modeling , and reaction engineering for biomass conversion and CO2 reduction . He develops novel catalysts, solvents, and reactor systems using integrated quantum mechanical and classical molecular simulations , synergized with experimental data to enable sustainable energy and chemical production . Recent publications highlight trends in condensed phase chemistry for biomass reactions, machine learning applications in solvent configuration prediction, and mechanistic studies of lignin-carbohydrate complex deconstruction. His work bridges methane activation on metal oxides, hydrodeoxygenation of bio-oil compounds, and polymerization pathways in lignin structures. Scientific Awards include: NSERC Doctoral and Post-doctoral Fellowships Discovery International Award 2017 (Australian Research Council) NANYANG EDUCATION AWARD 2016 (Singapore) SCBE Teaching Excellence Awards (Silver 2015, Gold 2016) Bharat Gaurav (Pride of India) Award 2014 Dr. Mushrif's NSERC Discovery Grant (2018), CFI John R. Evans Leaders Fund Grant (2022), and AcRF Tier-2 Grant (Singapore, 2015) have advanced his work. Current PhD and Master's students include José Carlos Velasco Calderón , Arul Mozhi Devan Padmanathan , and Sagar Bathla , among others. The CARES Lab (Catalysis Research for Sustainability) under his leadership combines ab initio molecular dynamics , machine learning potentials , and Density Functional Theory to design materials for renewable energy . Collaborations span institutions in France , Canada , India , and the UK .
