Dorit Aharonov

Q: What Schools Are Affiliated With Dorit Aharonov

Dorit Aharonov is affiliated with the following schools: Weizmann Institute of Science, Hebrew University of Jerusalem

Dorit Aharonov's AcademicInfluence.com Rankings

Dorit Aharonov

Computer Science

#1269

World Rank

#1310

Historical Rank

Theoretical Computer Science

#143

World Rank

#143

Historical Rank

Database

#8825

World Rank

#9268

Historical Rank

computer-science Degrees

Dorit Aharonov

Physics

#1632

World Rank

#2495

Historical Rank

physics Degrees

Download Badge

Computer Science
Physics

Why Is Dorit Aharonov Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dorit Aharonov is an Israeli computer scientist specializing in quantum computing. Aharonov was born in Washington and grew up in Haifa, the daughter of the mathematician Dov Aharonov and the niece of the physicist Yakir Aharonov.

(See a Problem?)

Dorit Aharonov's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Adiabatic quantum computation is equivalent to standard quantum computation (2004) (804)
Quantum walks on graphs (2000) (666)
Fault-tolerant quantum computation with constant error (1996) (603)
Quantum circuits with mixed states (1998) (428)
Fault-Tolerant Quantum Computation with Constant Error Rate (1996) (381)
Adiabatic quantum state generation and statistical zero knowledge (2003) (358)
Quantum Computation (1998) (315)
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial (2005) (277)
The Power of Quantum Systems on a Line (2007) (215)
Interactive Proofs For Quantum Computations (2008) (183)
A Simple Proof that Toffoli and Hadamard are Quantum Universal (2003) (172)
Lattice problems in NP ∩ coNP (2005) (169)
Fault-tolerant quantum computation with long-range correlated noise. (2005) (160)
Increasing sensing resolution with error correction. (2013) (131)
Quantum bit escrow (2000) (122)
The detectability lemma and quantum gap amplification (2008) (94)
Guest column: the quantum PCP conjecture (2013) (90)
The BQP-hardness of approximating the Jones polynomial (2006) (71)
Limitations of Noisy Reversible Computation (1996) (71)
Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane (2007) (70)
Quantum to classical phase transition in noisy quantum computers (1999) (70)
Fast-forwarding of Hamiltonians and exponentially precise measurements (2016) (63)
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems (2011) (62)
Polynomial simulations of decohered quantum computers (1996) (59)
Adiabatic Quantum State Generation (2007) (55)
The quantum FFT can be classically simulated (2006) (48)
A lattice problem in quantum NP (2003) (47)
Lattice Problems in NP cap coNP (2004) (47)
The Quantum PCP Conjecture (2013) (43)
Quantum algorithmic measurement (2021) (41)
Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics (2012) (35)
The detectability lemma and its applications to quantum Hamiltonian complexity (2011) (35)
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias (2014) (30)
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law (2014) (28)
Quantum Error-Correction-Enhanced Magnetometer Overcoming the Limit Imposed by Relaxation. (2014) (26)
Quantum Locally Testable Codes (2013) (25)
Efficient algorithm for approximating one-dimensional ground states (2009) (25)
Entanglement vs. gap for one-dimensional spin systems (2008) (22)
Simple and secure quantum key distribution with biphotons (2007) (22)
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach (2011) (16)
Quantum Hamiltonian complexity and the detectability lemma (2010) (16)
The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$NP (2015) (15)
On Quantum Advantage in Information Theoretic Single-Server PIR (2019) (14)
The Pursuit For Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings (2008) (14)
Stoquastic PCP vs. Randomness (2019) (13)
Quantum Circuit Depth Lower Bounds For Homological Codes (2018) (13)
Commuting Local Hamiltonians on Expanders, Locally Testable Quantum codes, and the qPCP conjecture (2013) (12)
Hamiltonian Sparsification and Gap-Simulation (2018) (11)
A polynomial-time classical algorithm for noisy random circuit sampling (2022) (9)
The commuting local Hamiltonian on locally-expanding graphs is in NP. (2013) (9)
The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (2014) (9)
Strongly Universal Hamiltonian Simulators (2021) (7)
Hamiltonian complexity in the thermodynamic limit (2021) (6)
StoqMA vs. MA: the power of error reduction (2020) (6)
On the Complexity of Two Dimensional Commuting Local Hamiltonians (2018) (3)
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting (2017) (3)
A Quantum inspired proof of $P^{\#P} \subseteq IP$ (2017) (2)
On the Commuting Local Hamiltonian Problem, and Tight Conditions on Topological Order (2011) (2)
O ct 2 01 7 A Quantum inspired proof of P # P ⊆ IP (2017) (2)
On Gap-Simulation of Hamiltonians and the Impossibility of Quantum Degree-Reduction (2018) (2)
Two Combinatorial MA-Complete Problems (2020) (2)
A combinatorial MA-complete problem (2020) (2)
Fe b 20 14 A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias (2014) (1)
Technical perspective: On proofs, entanglement, and games (2021) (1)
Quantum Algorithms Beyond the Jones Polynomial (2007) (1)
Quantum computation - alternative models and algorithms (2006) (0)
Translationally Invariant Constraint Optimization Problems (2022) (0)
Lattice problems in NP /spl cap/ coNP (2004) (0)
Fast-forwarding of Hamiltonians and exponentially precise measurements (2017) (0)
Quantum Computation Input ||> Computation ||> Output (1998) (0)
How the High-energy Part of the Spectrum Affects the Adiabatic Computation Gap (2019) (0)
Shor's Algorithm as a Violation of the Time-Energy Uncertainty (non) Principle Draft, NOT FOR CIRCULATION (2014) (0)
O ct 2 00 2 Quantum NPA Survey (2002) (0)
Quantum physics: A grip on misbehaviour (2013) (0)

This paper list is powered by the following services:

Other Resources About Dorit Aharonov

en.wikipedia.org

What Schools Are Affiliated With Dorit Aharonov?

Dorit Aharonov is affiliated with the following schools:

Dorit Aharonov's Academic­Influence.com Rankings

Why Is Dorit Aharonov Influential?

Dorit Aharonov's Published Works

Published Works

Other Resources About Dorit Aharonov

What Schools Are Affiliated With Dorit Aharonov?

Dorit Aharonov's AcademicInfluence.com Rankings