CSC687-A: Quantum Computing
Prof. B. Rosenberg
Fall Semester, 2003-4 (041)
MWF 8:00-8:50 AM
Memorial Building, Room 300
The Class Syllabus
Announcements
-
Monday, October 6:
Chip Elliott's visit
to discuss is work on a quantum channel.
- Midterm Reports: Presented in class
Friday October 17; Monday October 20.
- Fnal Reports: Presented in class
begining either Fri 28 Nov or Mon 1 December.
Notes
- Turing Machines
- Boolean circuits.
- Nondeterministric/Probablistic Turing Machines
- NP: reducibility and completeness
- Arthur Merlin games.
- Class BPP
- Π2, Σ2; Poly. Hierarchy.
- RP, co-RP and ZPP
- Grover's Algorithm
- Midterm presentations
- S.T. & M.D. Quantum teleportation.
- D.B. Quantum code breaking, shur's algorithm
- M.G. SAT in P-time on a quantum computer
- Y.Z. Quantum algoritm for discrete logs
- Y.P. Reversible computation
- Shor's algorithm
- Fourier analysis on groups.
(Notes)
- Quantum Fourier transforms
- Algorithm for factoring.
- Roots of unity in the integers mod n.
PDF
- Continued fractions,
PDF
- Quantum Cryptography
- BB84 algorithm
- Privacy amplificiation
- Quantum bit commitment
References