This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Boolean circuits and classical reversible gates. Turing machines and computational complexity classes. Oracles. Quantum gates and quantum circuits. BB84 quantum cryptography. Quantum teleportation. Quantum circuits for calculating functions. Quantum oracles and Deutsch's problem. Universal sets of quantum gates. Quantum Fourier transform. Period nding and phase estimation. Shor's factoring algorithm. Grover's search algorithm....
View
Full
Document
This note was uploaded on 10/15/2008 for the course EE 520 taught by Professor Brun during the Fall '08 term at USC.
 Fall '08
 Brun

Click to edit the document details