default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDorit Aharonov
Person information
- affiliation: The Hebrew University, Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c24]Dorit Aharonov, Sandy Irani:
Translationally Invariant Constraint Optimization Problems. CCC 2023: 23:1-23:15- [c23]Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, Umesh V. Vazirani:
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. STOC 2023: 945-957 - 2022
- [j13]Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath:
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. Quantum 6: 668 (2022) - [c22]Dorit Aharonov, Sandy Irani:
Hamiltonian complexity in the thermodynamic limit. STOC 2022: 750-763 - [i13]Dorit Aharonov, Sandy Irani:
Translationally Invariant Constraint Optimization Problems. CoRR abs/2209.08731 (2022) - 2021
- [j12]Dorit Aharonov, Michael Chapman:
Technical perspective: On proofs, entanglement, and games. Commun. ACM 64(11): 130 (2021) - [c21]Dorit Aharonov, Alex B. Grilo:
Two Combinatorial MA-Complete Problems. ITCS 2021: 36:1-36:20 - 2020
- [i12]Dorit Aharonov, Alex B. Grilo:
A combinatorial MA-complete problem. CoRR abs/2003.13065 (2020) - [i11]Dorit Aharonov, Alex B. Grilo, Yupan Liu
:
StoqMA vs. MA: the power of error reduction. CoRR abs/2010.02835 (2020) - [i10]Dorit Aharonov, Alex Bredariol Grilo:
A combinatorial MA-complete problem. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c20]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. EUROCRYPT (3) 2019: 219-246 - [c19]Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. FOCS 2019: 1000-1023 - [c18]Dorit Aharonov, Leo Zhou:
Hamiltonian Sparsification and Gap-Simulation. ITCS 2019: 2:1-2:21 - [i9]Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. CoRR abs/1901.05270 (2019) - [i8]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. CoRR abs/1902.09768 (2019) - [i7]Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i6]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. IACR Cryptol. ePrint Arch. 2019: 232 (2019) - 2018
- [c17]Dorit Aharonov, Oded Kenneth, Itamar Vigdorovich:
On the Complexity of Two Dimensional Commuting Local Hamiltonians. TQC 2018: 2:1-2:21 - 2017
- [i5]Dorit Aharonov, Maor Ganz, Loïck Magnin:
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting. CoRR abs/1707.01187 (2017) - 2016
- [j11]Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin:
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. SIAM J. Comput. 45(3): 633-679 (2016) - 2015
- [j10]Dorit Aharonov, Lior Eldar:
The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP. Quantum Inf. Process. 14(1): 83-101 (2015) - [j9]Dorit Aharonov, Lior Eldar:
Quantum Locally Testable Codes. SIAM J. Comput. 44(5): 1230-1262 (2015) - 2014
- [c16]Dorit Aharonov, Aram W. Harrow, Zeph Landau, Daniel Nagaj, Mario Szegedy, Umesh V. Vazirani:
Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law. FOCS 2014: 246-255 - 2013
- [j8]Stefano Pironio, Dorit Aharonov:
Quantum physics: A grip on misbehaviour. Nat. 496(7446): 436-437 (2013) - [j7]Dorit Aharonov, Itai Arad, Thomas Vidick:
Guest column: the quantum PCP conjecture. SIGACT News 44(2): 47-79 (2013) - [i4]Dorit Aharonov, Itai Arad, Thomas Vidick:
The Quantum PCP Conjecture. CoRR abs/1309.7495 (2013) - [i3]Dorit Aharonov, Lior Eldar:
Quantum Locally Testable Codes. CoRR abs/1310.5664 (2013) - 2011
- [c15]Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. FOCS 2011: 324-333 - [c14]Dorit Aharonov, Lior Eldar:
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems. FOCS 2011: 334-343 - 2010
- [c13]Dorit Aharonov, Michael Ben-Or, Elad Eban:
Interactive Proofs For Quantum Computations. ICS 2010: 453-469
2000 – 2009
- 2009
- [j6]Dorit Aharonov, Vaughan Jones, Zeph Landau:
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial. Algorithmica 55(3): 395-421 (2009) - [c12]Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The detectability lemma and quantum gap amplification. STOC 2009: 417-426 - 2008
- [j5]Dorit Aharonov, Michael Ben-Or:
Fault-Tolerant Quantum Computation with Constant Error Rate. SIAM J. Comput. 38(4): 1207-1282 (2008) - [j4]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation. SIAM Rev. 50(4): 755-787 (2008) - [i2]Dorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath:
The Pursuit For Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings. CoRR abs/0810.4840 (2008) - 2007
- [j3]Dorit Aharonov, Amnon Ta-Shma:
Adiabatic Quantum State Generation. SIAM J. Comput. 37(1): 47-82 (2007) - [j2]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM J. Comput. 37(1): 166-194 (2007) - [c11]Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe:
The Power of Quantum Systems on a Line. FOCS 2007: 373-383 - 2006
- [c10]Dorit Aharonov, Vaughan Jones, Zeph Landau:
A polynomial quantum algorithm for approximating the Jones polynomial. STOC 2006: 427-436 - [i1]Dorit Aharonov, Itai Arad:
The BQP-hardness of approximating the Jones Polynomial. CoRR abs/quant-ph/0605181 (2006) - 2005
- [j1]Dorit Aharonov, Oded Regev:
Lattice problems in NP cap coNP. J. ACM 52(5): 749-765 (2005) - 2004
- [c9]Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev:
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. FOCS 2004: 42-51 - [c8]Dorit Aharonov, Oded Regev:
Lattice Problems in NP cap coNP. FOCS 2004: 362-371 - 2003
- [c7]Dorit Aharonov, Oded Regev:
A Lattice Problem in Quantum NP. FOCS 2003: 210-219 - [c6]Dorit Aharonov, Amnon Ta-Shma:
Adiabatic quantum state generation and statistical zero knowledge. STOC 2003: 20-29 - 2001
- [c5]Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani:
Quantum walks on graphs. STOC 2001: 50-59 - 2000
- [c4]Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao:
Quantum bit escrow. STOC 2000: 705-714
1990 – 1999
- 1999
- [b1]Dorit Aharonov:
Noisy quantum computation (חשוב קוונטי רועש.). Hebrew University of Jerusalem, Israel, 1999 - 1998
- [c3]Dorit Aharonov, Alexei Y. Kitaev, Noam Nisan:
Quantum Circuits with Mixed States. STOC 1998: 20-30 - 1997
- [c2]Dorit Aharonov, Michael Ben-Or:
Fault-Tolerant Quantum Computation With Constant Error. STOC 1997: 176-188 - 1996
- [c1]Dorit Aharonov, Michael Ben-Or:
Polynomial Simulations of Decohered Quantum Computers. FOCS 1996: 46-55
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
