Ashley Montanaro
Artificial Intelligence · 2015–2017
A researcher in the Science corpus: 6 papers; trusts 51 researchers and is trusted by 22 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 101 citations into it; #7,696 of 35,345 by trust here, #8,999 by citations
- Atomic and Molecular Physics, and Optics — 37 citations into it; #1,516 of 7,135 by trust here, #2,263 by citations
- Computational Theory and Mathematics — 36 citations into it
- Algorithms & Complexity — 6 citations into it
Whom Ashley Montanaro trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Leslie G. Valiant
- Scott Aaronson
- Dorit Aharonov
- Yazhen Wang
- Mario Szegedy
- Michael J. Bremner
- Yaoyun Shi
- Edward Farhi
- H. Nader
- Miklos Santha
Who trusts Ashley Montanaro overall
- Stefan Woerner
- Yohichi Suzuki
- John Preskill
- Carlo Ciliberto
- Daniel J. Egger
- Shumpei Uno
- Mark Herbster
- Vedran Dunjko
- Nathan Killoran
- Roman Orus
Papers from Ashley Montanaro's perspective
Ordered by how strongly the researchers Ashley Montanaro trusts endorse each paper. Same corpus, a different order for every researcher.
- Quantum Computation and Quantum Information: Bibliography
- Quantum Computation and Quantum Information
- I and J
- Quantum Computation by Adiabatic Evolution
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Proceedings of the Royal Society A)
- Quantum walks on graphs (Symposium on the Theory of Computing)
- Improved Simulation of Stabilizer Circuits (arXiv.org)
- The Complexity of Computing the Permanent
- AND T
- Complexity-Theoretic Foundations of Quantum Supremacy Experiments (Cybersecurity and Cyberforensics Conference)
Their papers
- Quantum speedup of Monte Carlo methods (2015) — 442 citations
- Average-case complexity versus approximate simulation of commuting quantum computations (2015) — 315 citations
- Quantum circuits and low-degree polynomials over F2 (2016) — 326 citations
- Quantum computational supremacy (2017) — 847 citations
- Classical boson sampling algorithms with superior performance to near-term experiments (2017) — 140 citations
- Quantum algorithms: an overview (2015) — 1,066 citations