Dorit Aharonov

Affiliations:
  • The Hebrew University, Jerusalem, Israel


According to our database1, Dorit Aharonov authored at least 39 papers between 1996 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Translationally Invariant Constraint Optimization Problems.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings.
Quantum, 2022

Hamiltonian complexity in the thermodynamic limit.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Technical perspective: On proofs, entanglement, and games.
Commun. ACM, 2021

Two Combinatorial MA-Complete Problems.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
A combinatorial MA-complete problem.
Electron. Colloquium Comput. Complex., 2020

StoqMA vs. MA: the power of error reduction.
CoRR, 2020

2019
On Quantum Advantage in Information Theoretic Single-Server PIR.
IACR Cryptol. ePrint Arch., 2019

Stoquastic PCP vs. Randomness.
Electron. Colloquium Comput. Complex., 2019

Hamiltonian Sparsification and Gap-Simulation.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
On the Complexity of Two Dimensional Commuting Local Hamiltonians.
Proceedings of the 13th Conference on the Theory of Quantum Computation, 2018

2017
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting.
CoRR, 2017

2016
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias.
SIAM J. Comput., 2016

2015
Quantum Locally Testable Codes.
SIAM J. Comput., 2015

The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP.
Quantum Inf. Process., 2015

2014
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Guest column: the quantum PCP conjecture.
SIGACT News, 2013

Quantum physics: A grip on misbehaviour.
Nat., 2013

The Quantum PCP Conjecture.
CoRR, 2013

2011
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Interactive Proofs For Quantum Computations.
Proceedings of the Innovations in Computer Science, 2010

2009
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial.
Algorithmica, 2009

The detectability lemma and quantum gap amplification.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation.
SIAM Rev., 2008

Fault-Tolerant Quantum Computation with Constant Error Rate.
SIAM J. Comput., 2008

2007
Adiabatic Quantum State Generation.
SIAM J. Comput., 2007

The Power of Quantum Systems on a Line.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
The BQP-hardness of approximating the Jones Polynomial.
CoRR, 2006

2005
Lattice problems in NP cap coNP.
J. ACM, 2005

2003
Adiabatic quantum state generation and statistical zero knowledge.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A Lattice Problem in Quantum NP.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2001
Quantum walks on graphs.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Quantum bit escrow.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Noisy quantum computation (חשוב קוונטי רועש.).
PhD thesis, 1999

1998
Quantum Circuits with Mixed States.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
Fault-Tolerant Quantum Computation With Constant Error.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Polynomial Simulations of Decohered Quantum Computers.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996


  Loading...