Summer 2007 M-Wed 12:00-2:20 PM Location: Caruth 128
CSE 5/7390 Special Topics in
Introduction to Quantum Logic and Quantum Computing
CLASS INSTRUCTOR
Mitch Thornton, Caruth 220A, 214-768-1371, mitch@engr.smu.edu
OFFICE HOURS
Mon, Wed: 2:30-3:30PM or by appointment
DISABILITY ACCOMMODATIONS
Students needing academic accommodations for a disability must first contact Ms. Rebecca Marin, Coordinator, Services for Students with Disabilities (214-768-4557) to verify the disability and establish eligibility for accommodations. They should then schedule an appointment with the professor to make appropriate arrangements. (See University Policy No. 2.4).
OBSERVANCE OF RELIGIOUS HOLIDAYS
Religiously observant students wishing to be absent on holidays that require missing class should notify their professors in writing at the beginning of the semester, and should discuss with them, in advance, acceptable ways of making up any work missed because of the absence. (See University Policy No. 1.9.)
EXCUSED ABSENCES FOR UNIVERSITY EXTRACURRICULAR ACTIVITIES
Students participating in an officially sanctioned, scheduled University extracurricular activity should be given the opportunity to make up class assignments or other graded assignments missed as a result of their participation. It is the responsibility of the student to make arrangements with the instructor prior to any missed scheduled examination or other missed assignment for making up the work. (See the University Undergraduate Catalog).
TEXTS
D.C. Marinescu and G.M. Marinescu, Approaching Quantum Computing, Pearson Prentice-Hall, 2005, ISBN 0-13-145224-X, (errata).
M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000, ISBN 0-521-63503-9.
REFERENCES
G.P. Berman, G.D. Doolen, R. Mainieri, and V.I. Tsifrinovich, Introduction to Quantum Computers, World Scientific, 1998, ISBN 981-02-3549-6.
A.O. Pittenger, An Introduction to Quantum Computing Algorithms, Birkhauser, 2003, ISBN 0-8176-4127-0.
I. Burda, Introduction to Quantum Computation, Universal Publishers, 2005, ISBN 1-58112-466-X.
G. Chen, D.A. Church, B.-G. Englert, C. Henkel, B. Rohwedder, M.O. Scully, and M.S. Zubairy, Quantum Computing Devices Principles, Designs, and Analysis, Chapman & Hall/CRC Applied Mathematics, 2007, ISBN
1-58488-681-1.
PAPERS
T. Raja, V.D. Agrawal, and M.L. Bushnell, A Tutorial on Emerging Nanotechnology Devices, Proceedings of the VLSI Design Conference, 2004, pp. 343-360.
A. Einstein, B. Podolsky, and N. Rosen, Can Quantum-Mechnical Description of Physical Reality Be Considered Complete?, Physical Review, vol. 47, May 15, 1935,
pp. 777-780, (the EPR paper).
J.S. Bell, On the Einstein Podolsky Rosen Paradox,
Physics, 1, 1964, pp. 195-200.
A. Aspect, J. Dalibard, and G. Roger, Experimental Test of Bell's Inequalities Using Time-Varying Analyzers,
Physical Review Letters, vol. 49, no. 25, Dec. 1982, pp. 1804-1807.
A. Barenco, et al., Elementary Gates for Quantum Computation, quant-ph archive, March 1995.
G. Cybenko, Reducing Quantum Computations to Elementary Unitary Operations, Computing in Science and Engineering, March/April 2001.
D. Coppersmith, An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report RC 19642, July 1994.
R. Tucci, QC Paulinesia (useful quantum gate identities), quant-ph archive, July 2004.
READING/HISTORY
A.D. Aczel, Entanglement The Greatest Mystery in Physics, Raincoast Books, 2002, ISBN 1-55192-549-4.
G.J. Milburn, The Feynman Processor, Perseus Books, 1998, ISBN 0-7382-0173-1.
J. Brown, The Quest for the Quantum Computer, Simon & Schuster, 2000, ISBN 0-684-87004-5.
COURSE DESCRIPTION
Quantum computers can solve problems that are intractable on digital computers. Quantum computers are based on quantum logic circuits that manipulate qubits instead of binary digits (bits). Qubits allow for inherent parallelism not present in digital electronic bits and this parallelism is exploited in quantum circuits and computers. This course will provide a survey of quantum logic and quantum computing from the viewpoint of a computer scientist or computer engineer. This is not a course in quantum mechanics. Any needed quantum mechanical principles will be introduced as the course proceeds. The focus of the course will be on issues of quantum logic circuit design and quantum computer algorithms. Models of quantum logic elements and computing are emphasized while topics in underlying circuit devices will only be briefly surveyed.
PREREQUISITES (any one of the following)
1. CSE 4381 - Digital Computer Design (Grade of C or better)
2. CSE 5385 - Microprocessor Architecture and Interfacing (Grade of C or better)
3. EE 5381 - Digital Computer Design (Grade of C or better)
4. EE 5385 - Microprocessors in Digital Design (Grade of C or better)
5. Consent of instructor
WEB RESOURCES
Quantum Physics Paper Archive
ADMINISTRATION
Class Schedule
Grading Policy
Class Project Guidelines
TOPICS
- Overview of Nanotechnology
- Quantum-dot Cellular Automata (QCA) Circuits
- Qubits and Entanglement
- Measurement and Decoherence
- Mathematical Models
- Logical and Physical Reversibility
- Quantum Logic Gates and Circuits
- Quantum Logic Synthesis
- Review of Classical Theory of Computation
- Survey of Various Quantum Algorithms
|