Quantum Complexity Theory: Lecture Notes

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Prof. Scott Aaronson
Publisher: Massachusetts Institute of Technology (MIT)
Year: 2010

Language: English
City: Cambridge, MA
Tags: 6.845; quantum mechanics; quantum physics; mathematics; computer science; quantum computing; quantum information science; quantum computers; quantum information systems; quantum algorithms; quantum complexity theory; quantum computability; theoretical computer science; computer architecture

Introduction
Course structure
Computability and Complexity Theory
Quantum mechanics
What is quantum mechanics?
Quantum mechanics as an extension of classical statistics
Recap of Last Lecture
Error Propagation
The Query Model
Deutsch-Jozsa Algorithm
Bernstein-Vazarani Algorithm [93]
Simon's Algorithm [93]
BPPA = BQPA
Shor's Algorithm [94]