Scott Aaronson
Artificial Intelligence · 2004–2022
A researcher in the Science corpus: 8 papers; trusts 34 researchers and is trusted by 63 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 64 citations into it; #3,230 of 35,345 by trust here, #4,602 by citations
- Atomic and Molecular Physics, and Optics — 32 citations into it
- Computational Theory and Mathematics — 19 citations into it; #1,752 of 12,182 by trust here, #3,218 by citations
- Electrical and Electronic Engineering — 9 citations into it
Whom Scott Aaronson trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Leslie G. Valiant
- Christian Monyk
- Guifré Vidal
- Mark Zhandry
- Michael J. Bremner
- Yaoyun Shi
- Jeongwan Haah
- Daniel Gottesman
- J. Håstad
- John Watrous
Who trusts Scott Aaronson overall
- Sergey Bravyi
- Hsin-Yuan Huang
- Ashley Montanaro
- John Preskill
- Aram Wettroth Harrow
- Matthew Fisher
- Victor Veitch
- Michael J. Bremner
- Yaodong Li
- Richard Kueng
Papers from Scott Aaronson's perspective
Ordered by how strongly the researchers Scott Aaronson trusts endorse each paper. Same corpus, a different order for every researcher.
- AND T
- I and J
- Quantum computing, postselection, and probabilistic polynomial-time (Proceedings of the Royal Society A)
- Efficient classical simulation of slightly entangled quantum computations.
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Proceedings of the Royal Society A)
- Improved Simulation of Stabilizer Circuits (arXiv.org)
- Aspects of Generic Entanglement
- Quantum state tomography via compressed sensing. (Physical Review Letters)
- Quantum Computation and Quantum Information: Bibliography
- Classical simulation of noninteracting-fermion quantum circuits (arXiv.org)
Their papers
- A very preliminary analysis of DALL-E 2 (2022) — 177 citations
- Quantum computing, postselection, and probabilistic polynomial-time (2004) — 374 citations
- Read the fine print (2015) — 338 citations
- Shadow tomography of quantum states (2017) — 573 citations
- Complexity-Theoretic Foundations of Quantum Supremacy Experiments (2016) — 393 citations
- Photonic Boson Sampling in a Tunable Circuit (2012) — 581 citations
- The computational complexity of linear optics (2010) — 1,640 citations
- Improved Simulation of Stabilizer Circuits (2004) — 1,660 citations