Top results
scott aaronson (mit) forrelation a problem admitting enormous quantum speedup, which i and others have studied under various names over the years, which is interesting complexity-theoretically…
scott aaronson (mit) the limits of computation: quantum computers and beyond things we never see… warp drive perpetuum mobile Übercomputer the (seeming) impossibility…
1. advertisement for those who enjoyed the “memory” session on monday multiplying 10-digit numbers using flickr: the power of recognition memory by andrew drucker (my…
scott aaronson associate professor, eecs quantum computers and beyond mooreâs law extrapolating: robot uprising? but even a killer robot would still be âmerelyâ a turing…
slide 1am with multiple merlins scott aaronson mit scott aaronson (mit) dana moshkovitz (mit) russell impagliazzo (ucsd) slide 2 two-prover games (the first slide of, like,…
. . . . . . . ...... complexity-theoretic foundations of quantum supremacy experiments scott aaronson, lijie chen ut austin, tsinghua university → mit july 7, 2017 scott…
slide 1multilinear formulas and skepticism of quantum computing scott aaronson, uc berkeley http://www.cs.berkeley.edu/~aaronson slide 2 outline (1)four objections to quantum…
slide 1the complexity of sampling histories scott aaronson, uc berkeley http://www.cs.berkeley.edu/~aaronson august 5, 2003 slide 2 words you should stop me if i use polysize…
quantum lower bounds you probably haven’t seen before (which doesn’t imply that you don’t know of them) scott aaronson, uc berkeley 9/24/2002 a history of quantum lower…
c:\t\bqpph.dviscott aaronson∗ abstract the relationship between bqp and ph has been an open problem since the earliest days of quantum computing. we present evidence
qchvpra.dviscott aaronson∗ institute for advanced study, princeton this paper initiates the study of hidden variables from a quantum computing perspective. for us,
occamprs.dviscott aaronson∗ traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. but using
scott aaronson institut pour l'Étude avançée le principe de la postselection could you ever learn enough about a person to predict his or her future behavior reliably?…
8/14/2019 the incredible power of post selection (scott aaronson) 1/33a max feature presentationpbqppspace=8/14/2019 the incredible power of post selection (scott aaronson)…
c:\t\optics.dviscott aaronson∗ alex arkhipov† abstract we give new evidence that quantum computers—moreover, rudimentary quantum computers built entirely
scott aaronson andrew drucker mit june 6, 2010 scott aaronson, andrew drucker mit, a full characterization of quantum advice 1/20 ‘big picture’ question what
slide 1quantum computing and hollywood san jose state university april 15, 2004 scott aaronson uc berkeley www.cs.berkeley.edu/~aaronson slide 2 computers are useless. they…
slide 1lower bounds for local search by quantum arguments scott aaronson (uc berkeley) http://www.cs.berkeley.edu/~aaronson august 14, 2003 slide 2 quantum background needed…
quantum computing and hidden variables scott aaronson∗ institute for advanced study, princeton this paper initiates the study of hidden variables from a quantum computing…
slide 1a theory of isolatability scott aaronson andrew drucker mit slide 2 freeze-dried computation motivating question: how much useful computational work can one store…