Aharonov helped establish when noisy quantum computation can scale and showed that adiabatic evolution can reproduce the power of the standard quantum circuit model.
Hebrew University of Jerusalem
Professor of Computer Science
Why included? 3 sources
Two obstacles recur in quantum computing: errors threaten long computations, and different hardware approaches need a common theoretical language. Aharonov has contributed foundational results on both. With Michael Ben-Or, she established a threshold result for computation with a constant local error rate. With collaborators, she proved the polynomial equivalence of adiabatic and circuit-based computation. These are mathematical results with explicit models and assumptions, rather than promises about a particular device. They continue to frame how researchers assess scalable architectures and alternative ways to organize a quantum algorithm.
Documented work base: Israel
Identification checked Explore the contributions and sources