Interactive proofs with efficient quantum prover for recursive Fourier sampling

First Page		Document Content
Date: 2012-09-21 16:35:50 Computational complexity theory Interactive proof system IP Quantum algorithm BQP Quantum computer PP NP Soundness Theoretical computer science Applied mathematics Quantum complexity theory		Interactive proofs with efficient quantum prover for recursive Fourier sampling Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 183,90 KB Share Document on Facebook

	Lecture 22, Tues April 11: Grover The next quantum algorithm we’ll cover is… Grover’s Algorithm which was discovered in 1995, shortly after Shor’s algorithm. Both Grover and Shor were working at Bell Labs at the DocID: 1xVQ3 - View Document
	Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor N into p×q in polynomial time by reducing the problem to per DocID: 1xTSU - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	Span-Program-Based Quantum Algorithm for Evaluating Formulas DocID: 1vrhV - View Document
	CSE 599d - Quantum Computing Grover’s Algorithm Dave Bacon Department of Computer Science & Engineering, University of Washington After Peter Shor demonstrated that quantum computers could efficiently factor, great in DocID: 1v35w - View Document