Aaronson, Scott
The University of Texas at Austin
11 papers on CoChatORCID 0000-0003-1333-4045
Most cited papers
- Verified
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 1,515
- Verified
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 874
- Verified
Photonic Boson Sampling in a Tunable Circuit
Broome, M. A., Fedrizzi, A., Rahimi-Keshari, S., Dove, J., Aaronson, S., Ralph, T. C., & White, A. G. (2013) · Science
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 634
- Verified
Read the fine print
Aaronson, S. (2015) · Nature Physics
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 567
- Verified
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs
Cited by 218
- Verified
A very preliminary analysis of DALL-E 2
Marcus, G., Davis, E., & Aaronson, S. (2022) · arXiv
Generative Adversarial Networks and Image SynthesisMultimodal Machine Learning Applications
Cited by 82
- Verified
The Computational Complexity of Linear Optics
Aaronson, S., & Arkhipov, A. (2014) · Research in Optical Sciences
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 75
- Verified
The Classification of Reversible Bit Operations
Aaronson, S., Grier, D., & Schaeffer, L. (2015) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum-Dot Cellular Automata
Cited by 33
- Verified
Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton
Aaronson, S., Carroll, S. M., & Ouellette, L. (2014) · arXiv
Cellular Automata and ApplicationsComplex Systems and Dynamics
Cited by 16
- Verified
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking
Aaronson, S., & Gunn, S. (2019) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 12
- Verified
Improved separation between quantum and classical computers for sampling and functional tasks
Marshall, S. C., Aaronson, S., & Dunjko, V. (2024) · arXiv
Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free