Dorit Aharonov
Artificial Intelligence · 2000–2005
A researcher in the Science corpus: 5 papers; trusts 14 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 28 citations into it; #6,520 of 35,345 by trust here, #7,606 by citations
- Computational Theory and Mathematics — 18 citations into it; #5,942 of 12,182 by trust here, #3,339 by citations
- Atomic and Molecular Physics, and Optics — 8 citations into it; #3,491 of 7,135 by trust here, #2,846 by citations
Whom Dorit Aharonov trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Yaoyun Shi
- Edward Farhi
- L. Lov'asz
- Jérémie Roland
- David L. Applegate
- Michael H. Freedman
- Jeffrey Goldstone
- Andrew M. Childs
- Sam Gutmann
- Nicolas J. Cerf
Who trusts Dorit Aharonov overall
- Andrew M. Childs
- Dominic W. Berry
- Ashley Montanaro
- Salvador Elías Venegas-Andraca
- Andris Ambainis
- Guang Hao Low
- Nathan Wiebe
- Dominik Janzing
- Julia Kempe
- Tameem Albash
Papers from Dorit Aharonov's perspective
Ordered by how strongly the researchers Dorit Aharonov trusts endorse each paper. Same corpus, a different order for every researcher.
- Quantum Computation by Adiabatic Evolution
- Adiabatic quantum state generation and statistical zero knowledge (Symposium on the Theory of Computing)
- Quantum Computation and Quantum Information: Bibliography
- The Complexity of the Local Hamiltonian Problem (Foundations of Software Technology and Theoretical Computer Science)
- Quantum search by local adiabatic evolution
- The Probabilistic Method
- I Computational Complexity
- Creating superpositions that correspond to efficiently integrable probability distributions
- Geometric quantum computation using nuclear magnetic resonance (Nature)
- How powerful is adiabatic quantum computation? (Proceedings IEEE International Conference on Cluster Computing)
Their papers
- Quantum walks on graphs (2000) — 751 citations
- A Polynomial Quantum Algorithm for Approximating the Jones Polynomial (2005) — 389 citations
- Adiabatic quantum computation is equivalent to standard quantum computation (2004) — 964 citations
- Adiabatic quantum state generation and statistical zero knowledge (2003) — 438 citations
- A Simple Proof that Toffoli and Hadamard are Quantum Universal (2003) — 251 citations