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
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 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.
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.
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.
Improved simulation of stabilizer circuits
Scott Aaronson;Daniel Gottesman.
Physical Review A (2004)
Photonic Boson Sampling in a Tunable Circuit
Matthew A. Broome;Alessandro Fedrizzi;Saleh Rahimi-Keshari;Justin Dove.
Quantum Search of Spatial Regions
Scott Aaronson;Andris Ambainis.
Theory of Computing (2005)
The Computational Complexity of Linear Optics
Scott Aaronson;Alex Arkhipov.
Theory of Computing (2013)
Guest Column: NP-complete problems and physical reality
Sigact News (2005)
Quantum Computing Since Democritus
Read the fine print
Nature Physics (2015)
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences (2005)
Quantum lower bounds for the collision and the element distinctness problems
Scott Aaronson;Yaoyun Shi.
Journal of the ACM (2004)
Algebrization: A New Barrier in Complexity Theory
Scott Aaronson;Avi Wigderson.
ACM Transactions on Computation Theory (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: