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 can

First Page		Document Content
Date: 2018-08-26 18:23:41 Theoretical 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 can Add to Reading List Source URL: www.scottaaronson.com Download Document from Source Website File Size: 312,43 KB Share Document on Facebook

	Asymptotically Optimal Algorithm for Stochastic Adwords Nikhil R. Devanur, Microsoft Research Balasubramanian Sivan, University of Wisconsin-Madison Yossi Azar, Tel-Aviv University In this paper we consider the adwords DocID: 1sXji - View Document
	Optimizing TTL Caches under Heavy-Tailed Demands Andrés Ferragut Ismael Rodríguez Fernando Paganini DocID: 1rqor - View Document
	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch DocID: 1qqb7 - View Document
	Optimizing TTL Caches under Heavy-Tailed Demands Andrés Ferragut Ismael Rodríguez Fernando Paganini DocID: 1q6LF - View Document
	CS264: Beyond Worst-Case Analysis Lecture #2: Instance-Optimal Geometric Algorithms∗ Tim Roughgarden† September 24, DocID: 1pPTu - View Document