First Page | Document Content | |
---|---|---|
Date: 2018-08-26 18:23:41Theoretical computer science Emerging technologies Quantum computing Computational complexity theory Quantum information science Computer science Quantum algorithm Time complexity Asymptotically optimal algorithm Grover's algorithm Quantum algorithm for linear systems of equations | Lecture 23, Thurs April 13: BBBV, Applications of Grover It’s great that we can get a quadratic speedup with Grover’s algorithm, but we were able to get an exponential speedup with Shor’s algorithm… So why canAdd to Reading ListSource URL: www.scottaaronson.comDownload Document from Source WebsiteFile Size: 312,43 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |