D. Aharonov

Most-cited papers

Adiabatic quantum computation is equivalent to standard quantum computation
D. Aharonov, W. van Dam, J. Kempe, Zeph Landau +2 more
200445th Annual IEEE Symposium on Foundations of Computer Science987 citations Open access
Semantic Scholar
Fault-tolerant quantum computation with constant error
D. Aharonov, M. Ben-Or
1996Symposium on the Theory of Computing865 citations Open access
Semantic Scholar
Quantum walks on graphs
D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani
2000Symposium on the Theory of Computing767 citations
Semantic Scholar
Fault-Tolerant Quantum Computation with Constant Error Rate
D. Aharonov, M. Ben-Or
1996SIAM journal on computing (Print)603 citations Open access
Semantic Scholar
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, Noam Nisan
1998Symposium on the Theory of Computing505 citations Open access
Semantic Scholar
Adiabatic quantum state generation and statistical zero knowledge
D. Aharonov, A. Ta-Shma
2003Symposium on the Theory of Computing449 citations
Semantic Scholar
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
D. Aharonov, V. Jones, Zeph Landau
2005Symposium on the Theory of Computing397 citations
Semantic Scholar
Quantum Computation
D. Aharonov
1998388 citations Open access
Semantic Scholar
The Power of Quantum Systems on a Line
D. Aharonov, D. Gottesman, S. Irani, J. Kempe
2007IEEE Annual Symposium on Foundations of Computer Science271 citations Open access
Semantic Scholar
A Simple Proof that Toffoli and Hadamard are Quantum Universal
D. Aharonov
2003264 citations
Semantic Scholar
Interactive Proofs For Quantum Computations
D. Aharonov, M. Ben-Or, Elad Eban, U. Mahadev
2008International Conference on Supercomputing238 citations
Semantic Scholar
Fault-tolerant quantum computation with long-range correlated noise.
D. Aharonov, A. Kitaev, J. Preskill
2005Physical Review Letters219 citations Open access
Semantic Scholar
Quantum NP - A Survey
D. Aharonov, Tomer Naveh
2002215 citations
Semantic Scholar
Lattice problems in NP ∩ coNP
D. Aharonov, O. Regev
2005JACM212 citations Open access
Semantic Scholar
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling
D. Aharonov, Xun Gao, Zeph Landau, Yun-Chao Liu +1 more
2022Symposium on the Theory of Computing198 citations Open access
Semantic Scholar
Increasing sensing resolution with error correction.
Gilad Arrad, Yuval Vinkler, D. Aharonov, A. Retzker
2013Physical Review Letters182 citations Open access
Semantic Scholar
Quantum algorithmic measurement
D. Aharonov, Jordan S. Cotler, Xiao-Liang Qi
2021Nature Communications158 citations Open access
Semantic Scholar
Guest column: the quantum PCP conjecture
D. Aharonov, I. Arad, T. Vidick
2013SIGA141 citations Open access
Semantic Scholar
Fast-forwarding of Hamiltonians and exponentially precise measurements
Yosi Atia, D. Aharonov
2016Nature Communications127 citations Open access
Semantic Scholar
Limitations of Noisy Reversible Computation
D. Aharonov, M. Ben-Or, R. Impagliazzo, Noam Nisan
1996121 citations
Semantic Scholar
Quantum bit escrow
D. Aharonov, A. Ta-Shma, U. Vazirani, A. Yao
2000Symposium on the Theory of Computing117 citations
Semantic Scholar
The detectability lemma and quantum gap amplification
D. Aharonov, I. Arad, Zeph Landau, U. Vazirani
2008Symposium on the Theory of Computing110 citations Open access
Semantic Scholar
Quantum to classical phase transition in noisy quantum computers
D. Aharonov
199995 citations Open access
Semantic Scholar
Adiabatic Quantum State Generation
D. Aharonov, A. Ta-Shma
2007SIAM journal on computing (Print)78 citations
Semantic Scholar
The BQP-hardness of approximating the Jones polynomial
D. Aharonov, I. Arad
2006arXiv.org77 citations Open access
Semantic Scholar
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
D. Aharonov, Lior Eldar
2011IEEE Annual Symposium on Foundations of Computer Science75 citations Open access
Semantic Scholar
Polynomial simulations of decohered quantum computers
D. Aharonov, M. Ben-Or
1996Proceedings of 37th Conference on Foundations of Computer Science70 citations Open access
Semantic Scholar
The Quantum PCP Conjecture
D. Aharonov, I. Arad, T. Vidick
2013arXiv.org64 citations
Semantic Scholar
A lattice problem in quantum NP
D. Aharonov, O. Regev
200344th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.59 citations Open access
Semantic Scholar
The quantum FFT can be classically simulated
D. Aharonov, Zeph Landau, J. Makowsky
200656 citations
Semantic Scholar
Quantum Locally Testable Codes
D. Aharonov, Lior Eldar
2013SIAM journal on computing (Print)51 citations Open access
Semantic Scholar
Lattice Problems in NP cap coNP
D. Aharonov, O. Regev
2004IEEE Annual Symposium on Foundations of Computer Science51 citations
Semantic Scholar
Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version
D. Aharonov, I. Arad, Elad Eban, Zeph Landau
200847 citations
Semantic Scholar
On the Importance of Error Mitigation for Quantum Computation
D. Aharonov, O. Alberton, I. Arad, Yosi Atia +12 more
2025arXiv.org41 citations
Semantic Scholar
Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics
D. Aharonov, U. Vazirani
201240 citations Open access
Semantic Scholar
Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane
D. Aharonov, I. Arad, Elad Eban, Zeph Landau
200738 citations
Semantic Scholar
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law
D. Aharonov, A. Harrow, Zeph Landau, Daniel Nagaj +2 more
2014IEEE Annual Symposium on Foundations of Computer Science36 citations Open access
Semantic Scholar
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias
D. Aharonov, A. Chailloux, Maor Ganz, Iordanis Kerenidis +1 more
2014SIAM journal on computing (Print)36 citations Open access
Semantic Scholar
Quantum Error-Correction-Enhanced Magnetometer Overcoming the Limit Imposed by Relaxation.
David A. Herrera-Martí, T. Gefen, D. Aharonov, N. Katz +1 more
2014Physical Review Letters35 citations Open access
Semantic Scholar
The detectability lemma and its applications to quantum Hamiltonian complexity
D. Aharonov, I. Arad, U. Vazirani, Zeph Landau
201132 citations Open access
Semantic Scholar
Quantum Circuit Depth Lower Bounds For Homological Codes
D. Aharonov, Y. Touati
201829 citations
Semantic Scholar
Efficient algorithm for approximating one-dimensional ground states
D. Aharonov, I. Arad, S. Irani
200929 citations Open access
Semantic Scholar
Stoquastic PCP vs. Randomness
D. Aharonov, Alex Bredariol Grilo
2019IEEE Annual Symposium on Foundations of Computer Science23 citations Open access
Semantic Scholar
Entanglement vs. gap for one-dimensional spin systems
M. Hastings, D. Aharonov, D. Gottesman
200822 citations
Semantic Scholar
Simple and secure quantum key distribution with biphotons
I. Bregman, D. Aharonov, M. Ben-Or, H. Eisenberg
200722 citations Open access
Semantic Scholar
On Quantum Advantage in Information Theoretic Single-Server PIR
D. Aharonov, Zvika Brakerski, Kai-Min Chung, A. Green +2 more
2019IACR Cryptology ePrint Archive21 citations
Semantic Scholar
Quantum Hamiltonian complexity and the detectability lemma
D. Aharonov, I. Arad, Zeph Landau, U. Vazirani
201021 citations
Semantic Scholar
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
D. Aharonov, M. Ben-Or, F. Brandão, Or Sattath
2008Quantum21 citations Open access
Semantic Scholar
The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$NP
D. Aharonov, Lior Eldar
2015Quantum Information Processing20 citations
Semantic Scholar
Reliable high-accuracy error mitigation for utility-scale quantum circuits
D. Aharonov, O. Alberton, I. Arad, Yosi Atia +35 more
202519 citations
Semantic Scholar