D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 38 Citations 8,001 145 World Ranking 6353 National Ranking 3057

Research.com Recognitions

Awards & Achievements

2019 - ACM Fellow For contributions to quantum computing and computational complexity

2012 - National Science Foundation Alan T. Waterman Award Computer Science

2009 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Quantum mechanics
  • Algorithm
  • Algebra

Scott Aaronson mainly focuses on Quantum computer, Discrete mathematics, Quantum algorithm, Quantum information and Quantum capacity. His Quantum computer study is focused on Quantum in general. His Discrete mathematics research incorporates themes from Computational complexity theory, Upper and lower bounds, Quantum complexity theory and Combinatorics.

Scott Aaronson has researched Upper and lower bounds in several fields, including Hypercube, Unitary matrix, Black hole thermodynamics and Collision problem. As part of one scientific family, Scott Aaronson deals mainly with the area of Quantum capacity, narrowing it down to issues related to the Quantum no-deleting theorem, and often Theoretical computer science and No-communication theorem. His research in Polynomial hierarchy focuses on subjects like Model of computation, which are connected to Conjecture, Computational problem and Computational physics.

His most cited work include:

  • Improved simulation of stabilizer circuits (587 citations)
  • Photonic Boson Sampling in a Tunable Circuit (479 citations)
  • The computational complexity of linear optics (479 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Discrete mathematics, Quantum computer, Quantum, Quantum algorithm and Combinatorics. His research integrates issues of Upper and lower bounds and Advice in his study of Discrete mathematics. In his study, which falls under the umbrella issue of Quantum computer, Open quantum system is strongly linked to Quantum information.

In the field of Quantum, his study on Quantum state and Quantum money overlaps with subjects such as Oracle. Scott Aaronson works mostly in the field of Quantum algorithm, limiting it down to concerns involving Quantum capacity and, occasionally, Quantum no-deleting theorem. His research investigates the connection with BQP and areas like Polynomial hierarchy which intersect with concerns in Model of computation.

He most often published in these fields:

  • Discrete mathematics (42.81%)
  • Quantum computer (30.89%)
  • Quantum (28.44%)

What were the highlights of his more recent work (between 2018-2021)?

  • Quantum (28.44%)
  • Discrete mathematics (42.81%)
  • Depression (8.87%)

In recent papers he was focusing on the following fields of study:

Quantum, Discrete mathematics, Depression, Quantum algorithm and Quantum state are his primary areas of study. His studies in Quantum integrate themes in fields like State, Spoofing attack and Combinatorics. His studies examine the connections between Discrete mathematics and genetics, as well as such issues in Advice, with regards to Function and Busy beaver.

His work deals with themes such as Transcranial magnetic stimulation, Internal medicine and Vagus nerve stimulation, which intersect with Depression. The Quantum algorithm study combines topics in areas such as Natural number, Upper and lower bounds, Regular language and Trichotomy theorem. His biological study deals with issues like Time complexity, which deal with fields such as Quantum computer.

Between 2018 and 2021, his most popular works were:

  • Experimental learning of quantum states (30 citations)
  • Gentle measurement of quantum states and differential privacy (28 citations)
  • Quantum Approximate Counting, Simplified (20 citations)

In his most recent research, the most cited papers focused on:

  • Quantum mechanics
  • Algorithm
  • Algebra

Scott Aaronson mostly deals with Quantum, Quantum algorithm, Depression, Combinatorics and State. The concepts of his Quantum study are interwoven with issues in Distribution, Cross entropy and Spoofing attack. His study in Quantum algorithm is interdisciplinary in nature, drawing from both Discrete mathematics, Natural number, Trichotomy theorem and Computational geometry.

His study in Discrete mathematics focuses on Classification theorem in particular. His Combinatorics study combines topics from a wide range of disciplines, such as Matching, Omega and Unitary transformation. His study looks at the relationship between State and fields such as Quantum state, as well as how they intersect with chemical problems.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Improved simulation of stabilizer circuits

Scott Aaronson;Daniel Gottesman.
Physical Review A (2004)

890 Citations

Photonic Boson Sampling in a Tunable Circuit

Matthew A. Broome;Alessandro Fedrizzi;Saleh Rahimi-Keshari;Justin Dove.
Science (2013)

698 Citations

Quantum Search of Spatial Regions

Scott Aaronson;Andris Ambainis.
Theory of Computing (2005)

507 Citations

The Computational Complexity of Linear Optics

Scott Aaronson;Alex Arkhipov.
Theory of Computing (2013)

448 Citations

Guest Column: NP-complete problems and physical reality

Scott Aaronson.
Sigact News (2005)

365 Citations

Quantum Computing Since Democritus

Scott Aaronson.
(2013)

342 Citations

Read the fine print

Scott Aaronson.
Nature Physics (2015)

337 Citations

Quantum Computing, Postselection, and Probabilistic Polynomial-Time

Scott Aaronson.
Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences (2005)

315 Citations

Quantum lower bounds for the collision and the element distinctness problems

Scott Aaronson;Yaoyun Shi.
Journal of the ACM (2004)

309 Citations

Algebrization: A New Barrier in Complexity Theory

Scott Aaronson;Avi Wigderson.
ACM Transactions on Computation Theory (2009)

261 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Scott Aaronson

Andris Ambainis

Andris Ambainis

University of Latvia

Publications: 70

Fabio Sciarrino

Fabio Sciarrino

Sapienza University of Rome

Publications: 41

Andre R. Brunoni

Andre R. Brunoni

Universidade de São Paulo

Publications: 34

Roberto Osellame

Roberto Osellame

National Research Council (CNR)

Publications: 33

Aram W. Harrow

Aram W. Harrow

MIT

Publications: 31

Ran Raz

Ran Raz

Princeton University

Publications: 28

Colleen Loo

Colleen Loo

University of New South Wales

Publications: 28

Linda L. Carpenter

Linda L. Carpenter

Brown University

Publications: 27

Sven Höfling

Sven Höfling

University of Würzburg

Publications: 23

Igor L. Markov

Igor L. Markov

Facebook (United States)

Publications: 22

Mark S. George

Mark S. George

Medical University of South Carolina

Publications: 20

Zafiris J. Daskalakis

Zafiris J. Daskalakis

University of California - San Diego School of Medicine

Publications: 19

Sarah H. Lisanby

Sarah H. Lisanby

National Institutes of Health

Publications: 18

Eduard Vieta

Eduard Vieta

University of Barcelona

Publications: 18

Mingsheng Ying

Mingsheng Ying

University of Technology Sydney

Publications: 17

Donel Martin

Donel Martin

University of New South Wales

Publications: 17

Something went wrong. Please try again later.