Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarScott Aaronson
Person information
- affiliation: University of Texas at Austin, Department of Computer Science, TX, USA
- affiliation: Massachusetts Institute of Technology (MIT), Department of Electrical Engineering and Computer Science, Cambridge, MA, USA
- affiliation: Institute for Advanced Study, Princeton, NJ, USA
- affiliation: University of Waterloo, Institute for Quantum Computing, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j34]- [j33]Scott Aaronson, Andris Ambainis:
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing. SIAM J. Comput. 47(3): 982-1038 (2018) - [c37]
- [i104]Scott Aaronson, Xinyi Chen, Elad Hazan, Ashwin Nayak:
Online Learning of Quantum States. CoRR abs/1802.09025 (2018) - [i103]
- [i102]Scott Aaronson:
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. CoRR abs/1808.02420 (2018) - [i101]Scott Aaronson:
PDQP/qpoly = ALL. Electronic Colloquium on Computational Complexity (ECCC) 25: 99 (2018) - [i100]Scott Aaronson:
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 25: 137 (2018) - 2017
- [c36]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. Computational Complexity Conference 2017: 22:1-22:67 - [c35]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. ITCS 2017: 23:1-23:34 - [c34]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The computational complexity of ball permutations. STOC 2017: 317-327 - [i99]Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, Elham Kashefi:
On the implausibility of classical client blind quantum computing. CoRR abs/1704.08482 (2017) - [i98]
- [i97]Andrea Rocchetto, Scott Aaronson, Simone Severini, Gonzalo Carvacho, Davide Poderini, Iris Agresti, Marco Bentivegna, Fabio Sciarrino:
Experimental learning of quantum states. CoRR abs/1712.00127 (2017) - [i96]
- [i95]Scott Aaronson:
Shadow Tomography of Quantum States. Electronic Colloquium on Computational Complexity (ECCC) 24: 164 (2017) - 2016
- [j32]Adam Yedidia, Scott Aaronson:
A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory. Complex Systems 25(4) (2016) - [c33]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. Conference on Computational Complexity 2016: 25:1-25:19 - [c32]Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. Conference on Computational Complexity 2016: 26:1-26:28 - [c31]Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The Fewest Clues Problem. FUN 2016: 12:1-12:12 - [c30]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The Space "Just Above" BQP. ITCS 2016: 271-280 - [c29]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. STOC 2016: 863-876 - [p1]
- [i94]Adam Yedidia, Scott Aaronson:
A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory. CoRR abs/1605.04343 (2016) - [i93]Scott Aaronson:
The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes. CoRR abs/1607.05256 (2016) - [i92]Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban:
The Computational Complexity of Ball Permutations. CoRR abs/1610.06646 (2016) - [i91]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. CoRR abs/1612.05903 (2016) - [i90]Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson:
Doubly infinite separation of quantum information and communication. Electronic Colloquium on Computational Complexity (ECCC) 23: 16 (2016) - [i89]Scott Aaronson:
The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes. Electronic Colloquium on Computational Complexity (ECCC) 23: 109 (2016) - [i88]Scott Aaronson, Mohammad Bavarian, Giulio G. Giusteri:
Computability Theory of Closed Timelike Curves. Electronic Colloquium on Computational Complexity (ECCC) 23: 146 (2016) - [i87]Scott Aaronson, Lijie Chen:
Complexity-Theoretic Foundations of Quantum Supremacy Experiments. Electronic Colloquium on Computational Complexity (ECCC) 23: 200 (2016) - 2015
- [j31]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Quantum Information & Computation 15(11&12): 901-913 (2015) - [c28]Scott Aaronson, Andris Ambainis:
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. STOC 2015: 307-316 - [i86]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. CoRR abs/1504.05155 (2015) - [i85]Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson:
Doubly infinite separation of quantum information and communication. CoRR abs/1507.03546 (2015) - [i84]
- [i83]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. CoRR abs/1511.01937 (2015) - [i82]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CoRR abs/1511.08682 (2015) - [i81]
- [i80]Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. Electronic Colloquium on Computational Complexity (ECCC) 22: 66 (2015) - [i79]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. Electronic Colloquium on Computational Complexity (ECCC) 22: 175 (2015) - [i78]Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. Electronic Colloquium on Computational Complexity (ECCC) 22: 203 (2015) - 2014
- [j30]Scott Aaronson:
The Equivalence of Sampling and Searching. Theory Comput. Syst. 55(2): 281-298 (2014) - [j29]Scott Aaronson, Travis Hance:
Generalizing and derandomizing Gurvits's approximation algorithm for the permanent. Quantum Information & Computation 14(7-8): 541-559 (2014) - [j28]Scott Aaronson, Alex Arkhipov:
Bosonsampling is far from uniform. Quantum Information & Computation 14(15-16): 1383-1423 (2014) - [j27]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. SIAM J. Comput. 43(3): 1131-1183 (2014) - [j26]Scott Aaronson, Andris Ambainis:
The Need for Structure in Quantum Speedups. Theory of Computing 10: 133-166 (2014) - [c27]Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz:
AM with Multiple Merlins. IEEE Conference on Computational Complexity 2014: 44-55 - [c26]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. ICALP (1) 2014: 26-38 - [i77]Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz:
AM with Multiple Merlins. CoRR abs/1401.6848 (2014) - [i76]
- [i75]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. CoRR abs/1408.3193 (2014) - [i74]Scott Aaronson, Andris Ambainis:
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. CoRR abs/1411.5729 (2014) - [i73]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The space "just above" BQP. CoRR abs/1412.6507 (2014) - [i72]Scott Aaronson, Russell Impagliazzo, Dana Moshkovitz:
AM with Multiple Merlins. Electronic Colloquium on Computational Complexity (ECCC) 21: 12 (2014) - [i71]Aran Nayebi, Scott Aaronson, Aleksandrs Belovs, Luca Trevisan:
Quantum lower bound for inverting a permutation with advice. Electronic Colloquium on Computational Complexity (ECCC) 21: 109 (2014) - [i70]Scott Aaronson, Andris Ambainis:
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. Electronic Colloquium on Computational Complexity (ECCC) 21: 155 (2014) - [i69]Scott Aaronson, Adam Bouland, Joseph F. Fitzsimons, Mitchell Lee:
The space "just above" BQP. Electronic Colloquium on Computational Complexity (ECCC) 21: 181 (2014) - 2013
- [b1]Scott Aaronson:
Quantum Computing since Democritus. Cambridge University Press 2013, ISBN 978-0-521-19956-8, pp. I-XXX, 1-370 - [j25]Scott Aaronson, Alex Arkhipov:
The Computational Complexity of Linear Optics. Theory of Computing 9: 143-252 (2013) - [j24]Scott Aaronson, Paul Christiano:
Quantum Money from Hidden Subspaces. Theory of Computing 9: 349-401 (2013) - [c25]Francisco Mota, Scott Aaronson, Luis Filipe Coelho Antunes, Andre Souto:
Sophistication as Randomness Deficiency. DCFS 2013: 172-181 - [i68]
- [i67]
- [i66]Adam Bouland, Scott Aaronson:
Any Beamsplitter Generates Universal Quantum Linear Optics. CoRR abs/1310.6718 (2013) - [i65]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. CoRR abs/1312.0036 (2013) - [i64]Scott Aaronson:
BosonSampling Is Far From Uniform. Electronic Colloquium on Computational Complexity (ECCC) 20: 135 (2013) - [i63]Adam Bouland, Scott Aaronson:
Any Beamsplitter Generates Universal Quantum Linear Optics. Electronic Colloquium on Computational Complexity (ECCC) 20: 147 (2013) - [i62]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. Electronic Colloquium on Computational Complexity (ECCC) 20: 164 (2013) - 2012
- [j23]Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski:
Quantum money. Commun. ACM 55(8): 84-92 (2012) - [j22]Scott Aaronson:
Impossibility of succinct quantum proofs for collision-freeness. Quantum Information & Computation 12(1-2): 21-28 (2012) - [c24]
- [i61]
- [i60]Scott Aaronson, Travis Hance:
Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent. CoRR abs/1212.0025 (2012) - [i59]Scott Aaronson, Paul Christiano:
Quantum Money from Hidden Subspaces. Electronic Colloquium on Computational Complexity (ECCC) 19: 24 (2012) - [i58]Scott Aaronson, Travis Hance:
Generalizing and Derandomizing Gurvits's Approximation Algorithm for the Permanent. Electronic Colloquium on Computational Complexity (ECCC) 19: 170 (2012) - [i57]Scott Aaronson, Paul Christiano:
Quantum Money from Hidden Subspaces. IACR Cryptology ePrint Archive 2012: 171 (2012) - 2011
- [j21]Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Subgroup Membership. Chicago J. Theor. Comput. Sci. 2011 (2011) - [j20]Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola:
Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011) - [j19]Scott Aaronson, Dieter van Melkebeek:
On Circuit Lower Bounds from Derandomization. Theory of Computing 7(1): 177-184 (2011) - [c23]
- [c22]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. ICALP (1) 2011: 61-72 - [c21]
- [c20]
- [i56]Scott Aaronson:
Impossibility of Succinct Quantum Proofs for Collision-Freeness. CoRR abs/1101.0403 (2011) - [i55]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. CoRR abs/1101.5355 (2011) - [i54]Scott Aaronson:
Why Philosophers Should Care About Computational Complexity. CoRR abs/1108.1791 (2011) - [i53]
- [i52]
- [i51]Scott Aaronson:
A Counterexample to the Generalized Linial-Nisan Conjecture. CoRR abs/1110.6126 (2011) - [i50]Scott Aaronson:
Impossibility of Succinct Quantum Proofs for Collision-Freeness. Electronic Colloquium on Computational Complexity (ECCC) 18: 1 (2011) - [i49]Scott Aaronson, Andrew Drucker:
Advice Coins for Classical and Quantum Computation. Electronic Colloquium on Computational Complexity (ECCC) 18: 8 (2011) - [i48]Scott Aaronson:
A Linear-Optical Proof that the Permanent is #P-Hard. Electronic Colloquium on Computational Complexity (ECCC) 18: 43 (2011) - [i47]Scott Aaronson:
Why Philosophers Should Care About Computational Complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 108 (2011) - 2010
- [j18]
- [c19]Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor:
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31 - [c18]
- [c17]
- [i46]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. CoRR abs/1004.0377 (2010) - [i45]
- [i44]Scott Aaronson, Alex Arkhipov:
The Computational Complexity of Linear Optics. CoRR abs/1011.3245 (2010) - [i43]Scott Aaronson, Andrew Drucker:
A Full Characterization of Quantum Advice. Electronic Colloquium on Computational Complexity (ECCC) 17: 57 (2010) - [i42]Scott Aaronson, Dieter van Melkebeek:
A note on circuit lower bounds from derandomization. Electronic Colloquium on Computational Complexity (ECCC) 17: 105 (2010) - [i41]Scott Aaronson:
A Counterexample to the Generalized Linial-Nisan Conjecture. Electronic Colloquium on Computational Complexity (ECCC) 17: 109 (2010) - [i40]Scott Aaronson:
The Equivalence of Sampling and Searching. Electronic Colloquium on Computational Complexity (ECCC) 17: 128 (2010) - [i39]Scott Aaronson, Alex Arkhipov:
The Computational Complexity of Linear Optics. Electronic Colloquium on Computational Complexity (ECCC) 17: 170 (2010) - [i38]Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek:
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electronic Colloquium on Computational Complexity (ECCC) 17: 174 (2010)
2000 – 2009
- 2009
- [j17]Scott Aaronson:
On perfect completeness for QMA. Quantum Information & Computation 9(1): 81-89 (2009) - [j16]Scott Aaronson, Sudipto Guha, Jon M. Kleinberg, Frank McSherry, Dieter van Melkebeek, Amit Sahai:
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006). SIAM J. Comput. 39(1): vii (2009) - [j15]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Theory of Computing 5(1): 1-42 (2009) - [j14]Scott Aaronson, Avi Wigderson:
Algebrization: A New Barrier in Complexity Theory. TOCT 1(1): 2:1-2:54 (2009) - [c16]Scott Aaronson:
Quantum Copy-Protection and Quantum Money. IEEE Conference on Computational Complexity 2009: 229-242 - [i37]Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Group Membership. CoRR abs/0902.3175 (2009) - [i36]
- [i35]Scott Aaronson, Andris Ambainis:
The Need for Structure in Quantum Speedups. CoRR abs/0911.0996 (2009) - [i34]Scott Aaronson:
BQP and the Polynomial Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 16: 104 (2009) - [i33]Scott Aaronson, Andris Ambainis:
The Need for Structure in Quantum Speedups. Electronic Colloquium on Computational Complexity (ECCC) 16: 110 (2009) - 2008
- [j13]
- [c15]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. IEEE Conference on Computational Complexity 2008: 223-236 - [c14]
- [c13]Scott Aaronson, Avi Wigderson:
Algebrization: a new barrier in complexity theory. STOC 2008: 731-740 - [i32]Scott Aaronson, John Watrous:
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. CoRR abs/0808.2669 (2008) - [i31]Scott Aaronson, Avi Wigderson:
Algebrization: A New Barrier in Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 15(005) (2008) - [i30]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Electronic Colloquium on Computational Complexity (ECCC) 15(051) (2008) - [i29]Scott Aaronson:
On Perfect Completeness for QMA. Electronic Colloquium on Computational Complexity (ECCC) 15(067) (2008) - [i28]Scott Aaronson, John Watrous:
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. Electronic Colloquium on Computational Complexity (ECCC) 15(092) (2008) - 2007
- [j12]Scott Aaronson:
Review of "The Access Principle by John Willinsky, " MIT Press, 2005. SIGACT News 38(4): 19-23 (2007) - [j11]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. Theory of Computing 3(1): 129-157 (2007) - [c12]Scott Aaronson, Greg Kuperberg:
Quantum versus Classical Proofs and Advice. IEEE Conference on Computational Complexity 2007: 115-128 - [c11]
- 2006
- [j10]Scott Aaronson:
Lower Bounds for Local Search by Quantum Arguments. SIAM J. Comput. 35(4): 804-824 (2006) - [c10]Scott Aaronson:
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. IEEE Conference on Computational Complexity 2006: 261-273 - [c9]Scott Aaronson:
Oracles Are Subtle But Not Malicious. IEEE Conference on Computational Complexity 2006: 340-354 - [i27]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. CoRR abs/quant-ph/0604056 (2006) - [i26]Scott Aaronson, Greg Kuperberg:
Quantum Versus Classical Proofs and Advice. Electronic Colloquium on Computational Complexity (ECCC) 13(055) (2006) - [i25]Scott Aaronson:
The Learnability of Quantum States. Electronic Colloquium on Computational Complexity (ECCC) 13(106) (2006) - 2005
- [j9]Scott Aaronson:
Quantum lower bound for recursive fourier sampling. Quantum Information & Computation 5(2): 176-177 (2005) - [j8]Scott Aaronson:
Guest Column: NP-complete problems and physical reality. SIGACT News 36(1): 30-52 (2005) - [j7]Scott Aaronson:
Limitations of Quantum Advice and One-Way Communication. Theory of Computing 1(1): 1-28 (2005) - [j6]