Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein-

First Page		Document Content
Date: 2018-08-26 18:23:23 Theoretical computer science Quantum computing Quantum mechanics Quantum information science Emerging technologies Quantum algorithms Randomized algorithm Qubit Shor's algorithm DeutschJozsa algorithm		Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein- Add to Reading List Source URL: www.scottaaronson.com Download Document from Source Website File Size: 761,57 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 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/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document