<--- Back to Details
First PageDocument Content
Quantum information science / Theoretical computer science / Quantum mechanics / Quantum computing / Superconducting quantum computing / Qubit / Quantum simulator / Quantum teleportation / Quantum algorithm / Trapped ion quantum computer / Quantum supremacy / D-Wave Systems
Date: 2018-08-26 18:24:06
Quantum information science
Theoretical computer science
Quantum mechanics
Quantum computing
Superconducting quantum computing
Qubit
Quantum simulator
Quantum teleportation
Quantum algorithm
Trapped ion quantum computer
Quantum supremacy
D-Wave Systems

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

Add to Reading List

Source URL: www.scottaaronson.com

Download Document from Source Website

File Size: 205,34 KB

Share Document on Facebook

Similar Documents

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

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

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

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

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

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