Fall 2020 Tuesday 6:30-9:20 PM Class Location: Virtual (Zoom)
ECE/CS 8381 Quantum Logic and Computing
Mitch Thornton, Office Junkins 328, 214-768-1371, firstname.lastname@example.org
Students needing academic accommodations for a disability must first register with Disability Accommodations & Success Strategies (DASS). Students can call 214-768-1470 or visit http://www.smu.edu/Provost/SASP/DASS to begin the process. Once approved and registered, students will submit a DASS Accommodation Letter to faculty through the electronic portal DASS Link and then communicate directly with each instructor to make appropriate arrangements. Please note that accommodations are not retroactive and require advance notice to implement.
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. (https://www.smu.edu/StudentAffairs/Chaplain/ReligiousHolidays).
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 2020-2021 SMU Undergraduate Catalog under “Enrollment and Academic Records/Excused Absences.”)
STUDENT LEARNING OUTCOMES
- Describe and model computation as a physical process
- Use linear and tensor algebra to model a quantum computation
- Understand the mathematical model of a qubit and mathematically model superposition, entanglement, and measurement
- Understand logical and physical reversibility and when it is needed
- Describe the complexity advantages of QC as compared to Turing machines
- Use basic unitary operators as atomic computational elements
- Analyze a quantum algorithm mathematically Circuits
STUDENT ACADEMIC SUCCESS PROGRAMS
Students needing assistance with writing assignments for SMU courses may schedule an appointment with the Writing Center through Canvas. Students wishing support with subject-specific tutoring or success strategies should contact SASP, Loyd All Sports Center, Suite 202;
Final course examinations shall be given in all courses where they are appropriate, and some form of final assessment is essential. Final exams or final assessments must be administered as specified in the official examination schedule, and shall not be administered during the last week of classes or during the Reading Period. Faculty must state clearly in the syllabus the date/time and form of the final exam or assessment. All exams, tests, and quizzes will be delivered online this fall so that all students, regardless of mode of instruction, have equitable access to testing.
CARING COMMUNITY CONNECTIONS (CCC) PROGRAM
This is a resource for anyone in the SMU community to refer students of concern to the Office of the Dean of Students. Faculty play a critical role in identifying students who are experiencing challenges, as you may be the first to notice a change in behavior such as class attendance or performance. The online referral form can be found at smu.edu/deanofstudentsccc. After a referral is submitted, students will be contacted to discuss the concern, strategize options, and be connected to appropriate resources. Additionally, should you have concerns about students and are unclear about what to do, please see the CCC Reference Guide, or contact the Office of the Dean of Students at 214-768-4564.
FOR PREGNANT AND PARENTING STUDENTS
Accommodations for pregnant and parenting students: Under Title IX students who are pregnant or parenting may request academic adjustments by contacting Elsie Johnson (email@example.com) in the Office of the Dean of Students, or by calling 214-768-4564. Students seeking assistance must schedule an appointment with their professors as early as possible, present a letter from the Office of the Dean of Students, and make appropriate arrangements. Please note that academic adjustments are not retroactive and, when feasible, require advance notice to implement.
COVID-1 ATTENDENCE STATEMENT
Students who are experiencing COVID-19 symptoms or who have been notified through contact tracing of potential exposure and need to self-quarantine or isolate must follow the protocols laid out in SMU’s Contact Tracing Protocol. To ensure academic continuity, students in these situations will not be penalized and will be provided appropriate modifications to assignments, deadlines, and testing. Please also note that SMUFlex classes might, in rare circumstances, go remote for two-week periods to accommodate COVID-related issues. To ensure these necessary accommodations, affected students must:
- Provide as much advance notification as possible to the instructor about a change in circumstances. Students must notify their instructor about a potential absence as well as plans for a return to class. For cases in which students test positive for COVID-19, they should fill out a CCC form at this link.
- Communicate promptly with the instructor to establish, as necessary, alternative assignments and/or changes to deadlines and exams. Students are then responsible for meeting the expectations laid out in these alternative arrangements.
- Continue participation in class via Zoom, as health circumstances permit. Attend class regularly, when not in a situation outlined above, in accordance with safety measures laid out by SMU CAN in the Pledge to Protect (including wearing masks, maintaining social distancing, and cleaning personal space after class). In-person participation in SMUFlex classes is required on students’ assigned red/blue rotation days except in cases when students are experiencing illness, are in self-quarantine or in isolation.
- Students facing multiple or extended COVID-19-related absences or illness can work with the Office of the Dean of Students to consider options such as fully remote learning or medical withdrawal.
This policy, aligned with the SMU Honor Code and the SMU Pledge to Protect, relies on mutual trust and respect between students and faculty to ensure safety, academic integrity, and instructional continuity.
E. Rieffel and W. Polak, Quantum Computing A Gentle Introduction, MIT Press, 2011, ISBN 978-0-262-01506-6.
M.A. Thornton, Modeling Digital Switching Circuits with Linear Algebra, Morgan & Claypool Publishers, ISBN 9781627052337 (paperback), ISBN 9781627052344 (eBook), April 2014.
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.
N.S. Yanofsky and M.A. Mannucci, Quantum Computing for Computer Scientists, Cambridge University Press, 2008, ISBN 978-0-521-879965.
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
A. Graham, Kronecker Products and Matrix Calculus with Applications, Ellis Horwood Limited, Halstead Press, John Wiley and Sons, 1981, ISBN 0-85312-391-8.
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.
D. Deutsch, Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. of the Royal Society of London A 400, pp. 97-117, 1985.
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.
P. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, arXiv:quant-ph/9508027v2, 1995, (SIAM J. Sci. Statist. Comput. 26 (1997) 1484).
L. Grover, A Fast Quantum Mechanical Algorithm for Database Search, Proceedings of ACM Symposium on Theory of Computing, pp. 212-219, 1996.
R. Tucci, QC Paulinesia (useful quantum gate identities), quant-ph archive, July 2004.
D.M. Miller, D. Maslov, and G.W. Dueck, Transformation-Based Synthesis of Reversible Logic, Proc. of IEEE/ACM Design Automation Conference (DAC), June 2-6, 2003, pp. 318-323.
D.M. Miller and M.A. Thornton, QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits, Proc. of IEEE Int. Symp. on Mulitple-Valued Logic, May 17-20, 2006, pp. 30-30 (on Proc. CD-ROM).
K. Fazel, M.A. Thornton, and J.E. Rice, ESOP-based Toffoli Gate Cascade Generation, Proc. of IEEE Pacific Rim Conf. on Communications, Computers, and Signal Processing, Aug. 22-24, 2007, pp. 206-209.
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.
L. Lederman, The God Particle: If the Universe is the Answer, What is the Question?, 1993, ISBN: 0-385-31211-3.
Quantum computers can solve some problems that are intractable on digital (Turing) computers. Quantum computers are based on quantum algorithms (or 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 algorithms and computers. This course will provide a survey of quantum informatics; the use of quantum mechanical theory to represent and manipulate information in quantum computers or special-purpose devices. Prior knowledge of quantum mechanics is not required, any needed quantum mechanical principles will be introduced as the course proceeds. Models of quantum informatic operators and computing are emphasized while topics in underlying devices are only be briefly surveyed.
PREREQUISITES Basic familiarity with concepts in linear algebra and introductory computer programming in a modern development environment. A limited amount of in-class review of these topics will be provided. Also, 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
Quantum Physics Paper Archive
(student acknowledgement form)
- Overview of Computing
- Information Processing as a Physical Process
- Relevant Results in Quantum Mechanics and Quantum Electrodynamics
- Qubits: Quantum Superposition and Entanglement
- Measurement and Decoherence
- Logical and Physical Reversibility
- Quantum Informatic Operators/Gates and Algorithms/Circuits
- Techonology Survey: Quantum Photonics and Superconducting Semiconductor Qubits
- Quantum Algorithm Compilation/Synthesis
- Review of Classical Theory of Computation - Emphasis on Complexity
- Survey of Various Quantum Algorithms (Deutsch-Jozsa, QFT, Shor, Grover, HHL, etc.)