Urmila Mahadev

Last updated

Urmila Mahadev is an American mathematician and theoretical computer scientist known for her work in quantum computing and quantum cryptography.

Contents

Education and career

Mahadev is originally from Los Angeles, where her parents are physicians. She became interested in quantum computing through a course with Leonard Adleman at the University of Southern California, [1] where she graduated in 2010. [2]

She went to the University of California, Berkeley for graduate study, supported by a National Science Foundation Graduate Research Fellowship. [2] As a student of Umesh Vazirani at Berkeley, Mahadev discovered interactive proof systems that could demonstrate with high certainty, to an observer using only classical computation, that a quantum computer has correctly performed a desired quantum-computing task. [1]

She completed her Ph.D. in 2018, [3] and after continued postdoctoral research at Berkeley, [1] she became an assistant professor of computing and mathematical sciences at the California Institute of Technology. [4]

Recognition

For her work on quantum verification, Mahadev won the Machtey Award at the Symposium on Foundations of Computer Science in 2018, and in 2021 one of the three inaugural Maryam Mirzakhani New Frontiers Prizes for early-career achievements by women mathematicians. [5] [6]

Related Research Articles

<span class="mw-page-title-main">Stephen Cook</span> American-Canadian computer scientist, contributor to complexity theory

Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor at the University of Toronto, Department of Computer Science and Department of Mathematics.

<span class="mw-page-title-main">Peter Shor</span> American mathematician

Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

<span class="mw-page-title-main">Shafi Goldwasser</span> Israeli American computer scientist

Shafrira Goldwasser is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at Massachusetts Institute of Technology; a professor of mathematical sciences at the Weizmann Institute of Science, Israel; the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley; and co-founder and chief scientist of Duality Technologies.

<span class="mw-page-title-main">Hertz Foundation</span> American nonprofit foundation awarding fellowships in the sciences

The Fannie and John Hertz Foundation is an American non-profit organization that awards fellowships to Ph.D. students in the applied physical, biological and engineering sciences. The fellowship provides $250,000 of support over five years. The goal is for Fellows to be financially independent and free from traditional restrictions of their academic departments in order to promote innovation in collaboration with leading professors in the field. Through a rigorous application and interview process, the Hertz Foundation seeks to identify young scientists and engineers with the potential to change the world for the better and supports their research endeavors from an early stage. Fellowship recipients pledge to make their skills available to the United States in times of national emergency.

<span class="mw-page-title-main">Michael Sipser</span> American theoretical computer scientist (born 1954)

Michael Fredric Sipser is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology.

Dorit Aharonov is an Israeli computer scientist specializing in quantum computing.

Umesh Virkumar Vazirani is an Indian-American academic who is the Roger A. Strauch Professor of Electrical Engineering and Computer Science at the University of California, Berkeley, and the director of the Berkeley Quantum Computation Center. His research interests lie primarily in quantum computing. He is also a co-author of a textbook on algorithms.

<span class="mw-page-title-main">Gary Miller (computer scientist)</span> American computer scientist

Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 2003 he won the ACM Paris Kanellakis Award for the Miller–Rabin primality test. He was made an ACM Fellow in 2002 and won the Knuth Prize in 2013.

<span class="mw-page-title-main">James Demmel</span> American mathematician

James Weldon Demmel Jr. is an American mathematician and computer scientist, the Dr. Richard Carl Dehmel Distinguished Professor of Mathematics and Computer Science at the University of California, Berkeley.

Ronitt Rubinfeld is a professor of electrical engineering and computer science at MIT.

The Breakthrough Prize in Mathematics is an annual award of the Breakthrough Prize series announced in 2013.

<span class="mw-page-title-main">Julia Kempe</span> French, German, and Israeli researcher in quantum computing

Julia Kempe is a French, German, and Israeli researcher in quantum computing. She is currently the Director of the Center for Data Science at NYU and Professor at the Courant Institute.

<span class="mw-page-title-main">Virginia Vassilevska Williams</span> Theoretical computer scientist

Virginia Vassilevska Williams is a theoretical computer scientist and mathematician known for her research in computational complexity theory and algorithms. She is currently the Steven and Renee Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. She is notable for her breakthrough results in fast matrix multiplication, for her work on dynamic algorithms, and for helping to develop the field of fine-grained complexity.

<span class="mw-page-title-main">Yael Tauman Kalai</span> Cryptographer and theoretical computer scientist

Yael Tauman Kalai is a cryptographer and theoretical computer scientist who works as a Senior Principal Researcher at Microsoft Research New England and as an adjunct professor at MIT in the Computer Science and Artificial Intelligence Lab.

Elham Kashefi is a Professor of Computer Science and Personal Chair in quantum computing at the School of Informatics at the University of Edinburgh, and a Centre national de la recherche scientifique (CNRS) researcher at the Sorbonne University. Her work has included contributions to quantum cryptography, verification of quantum computing, and cloud quantum computing.

Xie Chen is a Chinese physicist and a professor of theoretical physics at the California Institute of Technology. Her work covers both the field of condensed matter physics and quantum information, with a focus on many-body quantum mechanical systems with unconventional emergent phenomena. She won the 2020 New Horizons in Physics Prize for "incisive contributions to the understanding of topological states of matter and the relationships between them"

Lisa Marie Piccirillo is an American mathematician who works on geometry and low-dimensional topology. In 2020, Piccirillo published a mathematical proof in the journal Annals of Mathematics determining that the Conway knot is not a slice knot, answering an unsolved problem in knot theory first proposed over fifty years prior by English mathematician John Horton Conway. In July 2020, she became an assistant professor of mathematics at Massachusetts Institute of Technology.

Nina Holden is a Norwegian mathematician interested in probability theory and stochastic processes, including graphons, random planar maps, the Schramm–Loewner evolution, and their applications to quantum gravity. She is a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, and has accepted a position as an associate professor at the Courant Institute of Mathematical Sciences of New York University beginning in 2021.

References

  1. 1 2 3 Klarreich, Erica (October 8, 2018), "Graduate Student Solves Quantum Verification Problem: Urmila Mahadev spent eight years in graduate school solving one of the most basic questions in quantum computation: How do you know whether a quantum computer has done anything quantum at all?", Quanta
  2. 1 2 Wall of Scholars, University of Southern California, retrieved 2020-09-19
  3. Urmila Mahadev at the Mathematics Genealogy Project
  4. Urmila Mahadev, California Institute of Technology, retrieved 2020-09-19
  5. "Prizes", FOCS 2018, retrieved 2020-09-19
  6. "Winners of the 2021 Breakthrough Prizes in life sciences, fundamental physics and mathematics announced", Breakthrough Prizes, September 10, 2020, retrieved 2020-09-19