World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
9403
World Ranking
10501
National Ranking
169

Overview

Dorit Aharonov is affiliated with the Hebrew University of Jerusalem in Israel. Their research spans the fields of Computer Science and Physics and Astronomy, with a particular focus on specialized subfields and topics related to quantum computing and theoretical computer science.

The main fields of study for Dorit Aharonov include:

  • Computer Science
  • Physics and Astronomy

Within these fields, the subfields of study where Aharonov has contributed are:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Atomic and Molecular Physics, and Optics
  • Computer Networks and Communications
  • Statistical and Nonlinear Physics

Their research covers several key topics, notably:

  • Quantum Computing Algorithms and Architecture
  • Quantum many-body systems
  • Quantum Information and Cryptography
  • Complexity and Algorithms in Graphs
  • Advanced Thermodynamics and Statistical Mechanics
  • Advanced Graph Theory Research
  • Computability, Logic, AI Algorithms

Dorit Aharonov has published regularly in various academic venues. Frequent publication platforms include:

  • arXiv (Cornell University)
  • Quantum
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Nature Communications
  • Communications of the ACM

Some of their recent papers are as follows:

  • The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings, 2022, Quantum
  • Quantum algorithmic measurement, 2022, Nature Communications
  • Strongly Universal Hamiltonian Simulators, 2021, arXiv (Cornell University)
  • A polynomial-time classical algorithm for noisy random circuit sampling, 2022, arXiv (Cornell University)
  • Exploring a Quantum Programming Language with Concurrency, 2025, arXiv (Cornell University)

In terms of collaboration, Dorit Aharonov has frequently co-authored work with several researchers, including:

  • Alex B. Grilo
  • Sandy Irani
  • Yupan Liu
  • Michael Ben-Or
  • Fernando G. S. L. Brandão

Best Publications

  • Fault-Tolerant Quantum Computation with Constant Error Rate

    Dorit Aharonov;Michael Ben-Or

  • Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation

    Dorit Aharonov;Wim van Dam;Julia Kempe;Zeph Landau

  • Fault-tolerant quantum computation with constant error

    D. Aharonov;M. Ben-Or

  • Quantum walks on graphs

    Dorit Aharonov;Andris Ambainis;Julia Kempe;Umesh Vazirani

  • Quantum circuits with mixed states

    Dorit Aharonov;Alexei Kitaev;Noam Nisan

  • Adiabatic quantum state generation and statistical zero knowledge

    Dorit Aharonov;Amnon Ta-Shma

  • Fault-Tolerant Quantum Computation with Long-Range Correlated Noise

    Dorit Aharonov;Alexei Kitaev;Alexei Kitaev;John Preskill

  • Lattice problems in NP ∩ coNP

    Dorit Aharonov;Oded Regev

  • A Polynomial Quantum Algorithm for Approximating the Jones Polynomial

    Dorit Aharonov;Vaughan Jones;Zeph Landau

  • The Power of Quantum Systems on a Line

    Dorit Aharonov;Daniel Gottesman;Sandy Irani;Julia Kempe

  • Quantum Computation

    Dorit Aharonov

  • Adiabatic quantum computation is equivalent to standard quantum computation

    D. Aharonov;W. van Dam;J. Kempe;Z. Landau

  • Increasing sensing resolution with error correction.

    Gilad Arrad;Yuval Vinkler;Dorit Aharonov;Alex Retzker

  • Quantum NP - A Survey

    Dorit Aharonov;Tomer Naveh

  • A Simple Proof that Toffoli and Hadamard are Quantum Universal

    Dorit Aharonov

  • Interactive Proofs For Quantum Computations

    Dorit Aharonov;Michael Ben-Or;Elad Eban

  • Guest column: the quantum PCP conjecture

    Dorit Aharonov;Itai Arad;Thomas Vidick

  • Quantum to classical phase transition in noisy quantum computers

    Dorit Aharonov

  • Quantum bit escrow

    Dorit Aharonov;Amnon Ta-Shma;Umesh V. Vazirani;Andrew C. Yao

  • The BQP-hardness of approximating the Jones polynomial

    Dorit Aharonov;Itai Arad

  • Interactive Proofs For Quantum Computations

    Dorit Aharonov;Michael Ben-Or;Elad Eban;Urmila Mahadev

Frequent Co-Authors

Umesh Vazirani
Umesh Vazirani University of California, Berkeley
Michael Ben-Or
Michael Ben-Or Hebrew University of Jerusalem
Julia Kempe
Julia Kempe New York University
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Amnon Ta-Shma
Amnon Ta-Shma Tel Aviv University
Daniel Gottesman
Daniel Gottesman University of Maryland, College Park
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Zvika Brakerski
Zvika Brakerski Weizmann Institute of Science
Andris Ambainis
Andris Ambainis University of Latvia

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science doesn’t stop at traditional on-campus programs. Many students now seek flexible options, including associates degrees online, which allow for quick entry into IT careers or can be a stepping stone for further study.

If you’re considering advancing your education, certain graduate programs stand out; see the most valuable masters degrees list to identify in-demand specializations that lead to high-paying tech careers.

Cost and accessibility are also crucial factors. Many institutions are committed to affordability. You can find the cheapest online degrees for quality education without a significant financial burden.

Worried about academic records? There are best colleges for low gpa that still provide respected computer science programs, ensuring opportunities are available to more students.

With these diverse pathways, online computer science degrees are more accessible than ever—supporting various career goals and academic backgrounds.

Best Scientists Citing Dorit Aharonov

Trending Scientists

Recently Published Articles