Polynomial Simulations of Decohered Quantum Computers. - Dorit Aharonov; Michael Ben-Or (FOCS, 1996)

Fault-Tolerant Quantum Computation With Constant Error. - Dorit Aharonov; Michael Ben-Or (STOC, 1997)

Quantum Circuits with Mixed States. - Dorit Aharonov; Alexei Y. Kitaev; Noam Nisan (STOC, 1998)

Noisy quantum computation (חשוב קוונטי רועש.). - Dorit Aharonov (1999)

Quantum bit escrow. - Dorit Aharonov; Amnon Ta-Shma; Umesh V. Vazirani; Andrew Chi-Chih Yao (STOC, 2000)

Quantum walks on graphs. - Dorit Aharonov; Andris Ambainis; Julia Kempe; Umesh V. Vazirani (STOC, 2001)

A Lattice Problem in Quantum NP. - Dorit Aharonov; Oded Regev 001 (FOCS, 2003)

Adiabatic quantum state generation and statistical zero knowledge. - Dorit Aharonov; Amnon Ta-Shma (STOC, 2003)

Lattice problems in NP cap coNP. - Dorit Aharonov; Oded Regev 001 (J. ACM, 2005)

The BQP-hardness of approximating the Jones Polynomial. - Dorit Aharonov; Itai Arad (CoRR, 2006)

The Power of Quantum Systems on a Line. - Dorit Aharonov; Daniel Gottesman; Sandy Irani; Julia Kempe (FOCS, 2007)

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. - Dorit Aharonov; Wim van Dam; Julia Kempe; Zeph Landau; Seth Lloyd; Oded Regev 001 (SIAM J. Comput., 2007)

Adiabatic Quantum State Generation. - Dorit Aharonov; Amnon Ta-Shma (SIAM J. Comput., 2007)

Fault-Tolerant Quantum Computation with Constant Error Rate. - Dorit Aharonov; Michael Ben-Or (SIAM J. Comput., 2008)

The detectability lemma and quantum gap amplification. - Dorit Aharonov; Itai Arad; Zeph Landau; Umesh V. Vazirani (STOC, 2009)

A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. - Dorit Aharonov; Vaughan Jones; Zeph Landau (Algorithmica, 2009)

Interactive Proofs For Quantum Computations. - Dorit Aharonov; Michael Ben-Or; Elad Eban (ICS, 2010)

The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. - Dorit Aharonov; Itai Arad; Zeph Landau; Umesh V. Vazirani (FOCS, 2011)

On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems. - Dorit Aharonov; Lior Eldar (FOCS, 2011)

The Quantum PCP Conjecture. - Dorit Aharonov; Itai Arad; Thomas Vidick (CoRR, 2013)

Quantum physics: A grip on misbehaviour. - Stefano Pironio; Dorit Aharonov (Nat., 2013)

Guest column: the quantum PCP conjecture. - Dorit Aharonov; Itai Arad; Thomas Vidick (SIGACT News, 2013)

Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. - Dorit Aharonov; Aram W. Harrow; Zeph Landau; Daniel Nagaj; Mario Szegedy; Umesh V. Vazirani (FOCS, 2014)

The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP. - Dorit Aharonov; Lior Eldar (Quantum Inf. Process., 2015)

Quantum Locally Testable Codes. - Dorit Aharonov; Lior Eldar (SIAM J. Comput., 2015)

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. - Dorit Aharonov; André Chailloux; Maor Ganz; Iordanis Kerenidis; Loïck Magnin (SIAM J. Comput., 2016)

Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting. - Dorit Aharonov; Maor Ganz; Loïck Magnin (CoRR, 2017)

On the Complexity of Two Dimensional Commuting Local Hamiltonians. - Dorit Aharonov; Oded Kenneth; Itamar Vigdorovich (TQC, 2018)

Hamiltonian Sparsification and Gap-Simulation. - Dorit Aharonov; Leo Zhou (ITCS, 2019)

Stoquastic PCP vs. Randomness. - Dorit Aharonov; Alex Bredariol Grilo (Electron. Colloquium Comput. Complex., 2019)

On Quantum Advantage in Information Theoretic Single-Server PIR. - Dorit Aharonov; Zvika Brakerski; Kai-Min Chung; Ayal Green; Ching-Yi Lai; Or Sattath (IACR Cryptol. ePrint Arch., 2019)

StoqMA vs. MA: the power of error reduction. - Dorit Aharonov; Alex B. Grilo; Yupan Liu (CoRR, 2020)

A combinatorial MA-complete problem. - Dorit Aharonov; Alex Bredariol Grilo (Electron. Colloquium Comput. Complex., 2020)

Two Combinatorial MA-Complete Problems. - Dorit Aharonov; Alex B. Grilo (ITCS, 2021)

Technical perspective: On proofs, entanglement, and games. - Dorit Aharonov; Michael Chapman (Commun. ACM, 2021)

Hamiltonian complexity in the thermodynamic limit. - Dorit Aharonov; Sandy Irani (STOC, 2022)

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. - Dorit Aharonov; Michael Ben-Or; Fernando G. S. L. Brandão; Or Sattath (Quantum, 2022)

Translationally Invariant Constraint Optimization Problems. - Dorit Aharonov; Sandy Irani (CCC, 2023)

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. - Dorit Aharonov; Xun Gao; Zeph Landau; Yunchao Liu 002; Umesh V. Vazirani (STOC, 2023)

On the Importance of Error Mitigation for Quantum Computation. - Dorit Aharonov; Ori Alberton; Itai Arad; Yosi Atia; Eyal Bairey; Zvika Brakerski; Itsik Cohen; Omri Golan; Ilya Gurwich; Oded Kenneth; Eyal Leviatan; Netanel H. Lindner; et al. (CoRR, 2025)