<--- Back to Details
First PageDocument Content
Computational complexity theory / Theoretical computer science / Theory of computation / Complexity classes / Quantum computing / Quantum complexity theory / Emerging technologies / Quantum algorithm / BQP / PP / P versus NP problem / NP
Date: 2018-08-26 18:23:45
Computational complexity theory
Theoretical computer science
Theory of computation
Complexity classes
Quantum computing
Quantum complexity theory
Emerging technologies
Quantum algorithm
BQP
PP
P versus NP problem
NP

Lecture 24, Tues April 18: Collision and Other Applications of Grover We’ve seen the application of Grover’s algorithm to searching game trees. Now let’s see another important application, to… The Collision Probl

Add to Reading List

Source URL: www.scottaaronson.com

Download Document from Source Website

File Size: 249,65 KB

Share Document on Facebook

Similar Documents

Lecture 27, Thurs April 27: Quantum Error Correction At the end of the last lecture, we discussed some of the difficulties with achieving a quantum speedup using currently available quantum computing devices, like D-Wave

Lecture 27, Thurs April 27: Quantum Error Correction At the end of the last lecture, we discussed some of the difficulties with achieving a quantum speedup using currently available quantum computing devices, like D-Wave

DocID: 1xVv9 - View Document

Lecture 17, Thurs March 23: Quantum Query Complexity, Deutsch-Jozsa People often want to know where the true power of quantum computing comes from. ● Is it the ability of amplitudes to interfere with one another? ● I

Lecture 17, Thurs March 23: Quantum Query Complexity, Deutsch-Jozsa People often want to know where the true power of quantum computing comes from. ● Is it the ability of amplitudes to interfere with one another? ● I

DocID: 1xVqy - View Document

Lecture 16, Tues March 21: Quantum Computing, Universal Gate Sets Guest Lecture by Tom Wong Having seen lots of quantum protocols, we’re finally ready to tackle the holy grail of the field: a programmable quantum compu

Lecture 16, Tues March 21: Quantum Computing, Universal Gate Sets Guest Lecture by Tom Wong Having seen lots of quantum protocols, we’re finally ready to tackle the holy grail of the field: a programmable quantum compu

DocID: 1xUtD - View Document

Lecture 29, Thurs May 4: Experimental Realizations of QC In this course, we’ve had 28 lectures about the theory of quantum computing and information. So it behooves us to take one lecture to survey the current state of

Lecture 29, Thurs May 4: Experimental Realizations of QC In this course, we’ve had 28 lectures about the theory of quantum computing and information. So it behooves us to take one lecture to survey the current state of

DocID: 1xTQp - View Document

Practical Post-Quantum Cryptography for Trusted Computing Matthias J. Kannwischer, PhD Student Workshop on Trusted Computing and its Applications 25 January 2018

Practical Post-Quantum Cryptography for Trusted Computing Matthias J. Kannwischer, PhD Student Workshop on Trusted Computing and its Applications 25 January 2018

DocID: 1xTFq - View Document