Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Improved simulation of stabilizer circuits
2004827 citationsScott Aaronson, Daniel GottesmanPhysical Review Aprofile →
The computational complexity of linear optics
2011435 citationsScott Aaronson, A. A. Архиповprofile →
Countries citing papers authored by Scott Aaronson
Since
Specialization
Citations
This map shows the geographic impact of Scott Aaronson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Scott Aaronson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Scott Aaronson more than expected).
This network shows the impact of papers produced by Scott Aaronson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Scott Aaronson. The network helps show where Scott Aaronson may publish in the future.
Co-authorship network of co-authors of Scott Aaronson
This figure shows the co-authorship network connecting the top 25 collaborators of Scott Aaronson.
A scholar is included among the top collaborators of Scott Aaronson based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Scott Aaronson. Scott Aaronson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Rocchetto, Andrea, Scott Aaronson, Simone Severini, et al.. (2019). Experimental learning of quantum states. IRIS Research product catalog (Sapienza University of Rome).44 indexed citations
7.
Aaronson, Scott, et al.. (2017). On the implausibility of classical client blind quantum computing. Edinburgh Research Explorer (University of Edinburgh).7 indexed citations
8.
Aaronson, Scott, et al.. (2016). Computability Theory of Closed Timelike Curves. Electronic colloquium on computational complexity. 23. 146.
9.
Aaronson, Scott & Andris Ambainis. (2014). . Theory of Computing. 10(1). 133–166.14 indexed citations
10.
Aaronson, Scott & A. A. Архипов. (2013). . Theory of Computing. 9(1). 143–252.268 indexed citations
11.
Aaronson, Scott & Paul F. Christiano. (2013). . Theory of Computing. 9(1). 349–401.8 indexed citations
12.
Bouland, Adam & Scott Aaronson. (2013). Any Beamsplitter Generates Universal Quantum Linear Optics. arXiv (Cornell University).1 indexed citations
13.
Aaronson, Scott, et al.. (2013). ψ-epistemic theories: The role of symmetry. DSpace@MIT (Massachusetts Institute of Technology).13 indexed citations
14.
Aaronson, Scott & Dieter van Melkebeek. (2011). . Theory of Computing. 7(1). 177–184.7 indexed citations
15.
Aaronson, Scott & Dieter van Melkebeek. (2010). A note on circuit lower bounds from derandomization.. Electronic colloquium on computational complexity. 17. 105.4 indexed citations
16.
Aaronson, Scott, Salman Beigi, Andrew Drucker, Bill Fefferman, & Peter W. Shor. (2009). . Theory of Computing. 5(1). 1–42.25 indexed citations
17.
Aaronson, Scott & Greg Kuperberg. (2007). . Theory of Computing. 3(1). 129–157.17 indexed citations
18.
Aaronson, Scott & Andris Ambainis. (2005). . Theory of Computing. 1(1). 47–79.73 indexed citations
19.
Gottesman, Daniel & Scott Aaronson. (2004). Improved simulation of stabilizer circuits (14 pages). Physical Review A. 70(5). 52328.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.