No photo of Dorit Aharonov

View Scopus Profile

Dorit Aharonov

 https://orcid.org/0000-0002-9378-8495
    Calculated based on number of publications stored in Pure and citations from Scopus
    1996 …2023

    Research activity per year

    Filter
    Conference contribution

    Search results

    • 2023

      A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

      Aharonov, D., Gao, X., Landau, Z., Liu, Y. & Vazirani, U., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 945-957 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      28 Scopus citations

    • Translationally Invariant Constraint Optimization Problems

      Aharonov, D. & Irani, S., Jul 2023, 38th Computational Complexity Conference, CCC 2023. Ta-Shma, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 23:1-23:15 15 p. 23. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 264).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2022

      Hamiltonian complexity in the thermodynamic limit

      Aharonov, D. & Irani, S., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 750-763 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      8 Scopus citations
    • 2021

      Two combinatorial MA-complete problems

      Aharonov, D. & Grilo, A. B., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 36:1-36:20 20 p. 36. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations
    • 2019

      Hamiltonian sparsification and gap-simulation

      Aharonov, D. & Zhou, L., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      7 Scopus citations

    • On quantum advantage in information theoretic single-server PIR

      Aharonov, D., Brakerski, Z., Chung, K. M., Green, A., Lai, C. Y. & Sattath, O., 2019, Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Ishai, Y. & Rijmen, V. (eds.). Springer Verlag, p. 219-246 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11478 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • Stoquastic PCP vs. Randomness

      Aharonov, D. & Bredariol Grilo, A., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 1000-1023 24 p. 8948612. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      3 Scopus citations
    • 2018

      On the complexity of two dimensional commuting local hamiltonians

      Aharonov, D., Kenneth, O. & Vigdorovich, I., 1 Jul 2018, 13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018. Jeffery, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 2:1-2:21 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 111).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2014

      Local tests of global entanglement and a counterexample to the generalized area law

      Aharonov, D., Harrow, A. W., Landau, Z., Nagaj, D., Szegedy, M. & Vazirani, U., 7 Dec 2014, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, p. 246-255 10 p. 6979009. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      21 Scopus citations
    • 2011

      On the complexity of commuting local Hamiltonians, and tight conditions for topological order in such systems

      Aharonov, D. & Eldar, L., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 334-343 10 p. 6108194. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      32 Scopus citations

    • The 1D area law and the complexity of quantum states: A combinatorial approach

      Aharonov, D., Arad, I., Landau, Z. & Vazirani, U., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 324-333 10 p. 6108193. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      9 Scopus citations
    • 2010

      Interactive Proofs For Quantum Computations.

      Aharonov, D., Ben-Or, M. & Eban, E., 2010, Innovations in Computer Science - ICS 2010. Tsinghua University Press, p. 453-469 17 p.

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2009

      The detectability lemma and quantum gap amplification:Extended Abstract

      Aharonov, D., Arad, I., Landau, Z. E. & Vazirani, U., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 417-426 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      60 Scopus citations
    • 2007

      The power of quantum systems on a line

      Aharonov, D., Gottesman, D., Irani, S. & Kempe, J., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 373-383 11 p. 4389508. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      26 Scopus citations
    • 2006

      A polynomial quantum algorithm for approximating the Jones polynomial

      Aharonov, D., Jones, V. & Landau, Z., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 427-436 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      83 Scopus citations
    • 2003

      A lattice problem in quantum NP

      Aharonov, D. & Regev, O., 2003, Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003. IEEE Computer Society, p. 210-219 10 p. 1238195. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2003-January).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      18 Scopus citations
    • 2000

      Quantum bit escrow

      Aharonov, D., Ta-Shma, A., Vazirani, U. V. & Yao, A. C., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 705-714 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      94 Scopus citations
    Your message has successfully been sent.
    Your message was not sent due to an error.