Travelled to:1 × Denmark
1 × Switzerland
2 × Canada
7 × USA
Collaborated with:∅ A.Drucker A.Ambainis P.Christiano A.Arkhipov A.Wigderson K.Balodis M.Bavarian
Talks about:quantum (7) comput (4) complex (3) problem (2) classic (2) optim (2) lower (2) bound (2) advic (2) multilinear (1)
Person: Scott Aaronson
DBLP: Aaronson:Scott
Contributed to:
2015
201420122011201120102008200520042002
1997Wrote 13 papers:
- STOC-2015-AaronsonA #named #problem #quantum
- Forrelation: A Problem that Optimally Separates Quantum from Classical Computing (SA, AA), pp. 307–316.
- ICALP-v1-2014-AaronsonABB
- Weak Parity (SA, AA, KB, MB), pp. 26–38.
- STOC-2012-AaronsonC #quantum
- Quantum money from hidden subspaces (SA, PC), pp. 41–60.
- ICALP-v1-2011-AaronsonD #quantum
- Advice Coins for Classical and Quantum Computation (SA, AD), pp. 61–72.
- STOC-2011-AaronsonA #complexity #linear
- The computational complexity of linear optics (SA, AA), pp. 333–342.
- STOC-2010-Aaronson #polynomial
- BQP and the polynomial hierarchy (SA), pp. 141–150.
- STOC-2010-AaronsonD #quantum
- A full characterization of quantum advice (SA, AD), pp. 131–140.
- STOC-2008-AaronsonW #complexity #named
- Algebrization: a new barrier in complexity theory (SA, AW), pp. 731–740.
- STOC-2005-Aaronson #complexity
- The complexity of agreement (SA), pp. 634–643.
- STOC-2004-Aaronson #multi #quantum
- Multilinear formulas and skepticism of quantum computing (SA), pp. 118–127.
- STOC-2004-Aaronson04a #bound #quantum
- Lower bounds for local search by quantum arguments (SA), pp. 465–474.
- STOC-2002-Aaronson #bound #problem #quantum
- Quantum lower bound for the collision problem (SA), pp. 635–642.
- SIGIR-1997-Aaronson #hypermedia
- Optimal Demand-oriented Topology for Hypertext Systems (SA), pp. 168–177.