Fall 2023 Wednesday 6:30-9:20 PM Class Location: Caruth Hall 0179

DISABILITY ACCOMMODATIONS
Students who need 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 they are registered and approved, students then submit a DASS Accommodation Letter through the electronic portal, DASS Link, and then communicate directly with each of their instructors to make appropriate arrangements. Please note that accommodations are not retroactive, but rather require advance notice in order to implement.

SEXUAL HARASSMENT
All forms of sexual harassment, including sexual assault, dating violence, domestic violence and stalking, are violations of SMU's Title IX Sexual Harassment Policy and may also violate Texas law. Students who wish to file a complaint or to receive more information about the grievance process may contact Samantha Thomas, SMU's Title IX Coordinator, at accessequity@smu.edu or 214-768-3601. Please note that faculty are mandatory reporters. If students notify faculty of sexual harassment, faculty must report it to the Title IX Coordinator. For more information about sexual harassment, including resources available to assist students, please visit www.smu.edu/sexualharassment.

PREGNANT AND PARENTING STUDENTS
Under Title IX, students who are pregnant or parenting may request academic adjustments by contacting the Office of Student Advocacy, 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.

RELIGIOUS OBSERVANCE
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. Click here for a list of holidays.

Medical-Related Absences
To ensure academic continuity and avoid any course penalties, students should follow procedures described by their instructors in order to be provided with appropriate modifications to assignments, deadlines, and exams.

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 that were missed as a result of their participation. It is the responsibility of the student to make arrangements for make-up work with the instructor prior to any missed scheduled examinations or other missed assignments. (See current Catalog under "Academic Records/Excused Absences.")

FINAL EXAMS
Final course examinations shall be given in all courses where appropriate, and some form of final assessment is essential. Final exams and assessments must be administered as specified in the official examination schedule and cannot be administered or due during the last week of classes or during the Reading Period. Exams cannot be administered or due during the last week of classes or during the Reading Period. Syllabi must state clearly the form of the final exam or assessment, and the due date and time must match the official SMU exam schedule. SMU policy states that all exceptions to the examination schedule may be made only upon written recommendation of the chair of the department sponsoring the course and with the concurrence of the dean of that school, who will allow exceptions only in accordance with guidelines from the Office of the Provost.

ACADEMIC DISHONESTY
Students are expected to embrace and uphold the SMU Honor Code. Violations of the Honor Code will be acted upon in accordance with the policies and procedures outlined in the Mustang Student Handbook.

STUDENT ACADEMIC SUCCESS PROGRAMS
Students needing assistance with writing assignments for SMU courses may schedule an appointment with the Writing Center through Canvas. Students who would like support for subject-specific tutoring or success strategies should contact SASP, Loyd All Sports Center, Suite 202; 214-768-3648; smu.edu/sasp. Tutor schedules are available at smu.edu/tutorschedule.

CARING COMMUNITY CONNECTIONS PROGRAM
CCC is a resource for anyone in the SMU community to refer students of concern to the Office of the Dean of Students. The online referral form can be found at smu.edu/deanofstudentsccc. After a referral form is submitted, students will be contacted to discuss the concern, strategize options, and be connected to appropriate resources. Anyone who is unclear about what steps to take if they have concerns about students should contact the Office of the Dean of Students at 214-768-4564.

MENTAL HEALTH RESOURCES: ON-CALL AND ON-GOING COUNSELING SERVICES
Throughout the academic year, students may encounter different stressors or go through life experiences which impact their mental health and academic performance. Students who are in distress or have concerns about their mental health can schedule a same-day or next-day appointment to speak with a counselor by calling Counseling Services. Counselors are available at any time, day or night for students in crisis at this number: 214.768.2277 (then select option 2). They will be connected with a counselor immediately. Students seeking on-going counseling should call the same number: 214.768.2277 (then select option 1) during normal business hours to schedule an initial appointment. SMU Teletherapy provides another free option for on-demand counseling and video appointments with a medical professional.

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

TEXTS
M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000, ISBN 0-521-63503-9.

REFERENCES
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).

E. Rieffel and W. Polak, Quantum Computing A Gentle Introduction, MIT Press, 2011, ISBN 978-0-262-01506-6.

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 1-58488-681-1.

A. Graham, Kronecker Products and Matrix Calculus with Applications, Ellis Horwood Limited, Halstead Press, John Wiley and Sons, 1981, ISBN 0-85312-391-8.

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.

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.

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.

L. Lederman, The God Particle: If the Universe is the Answer, What is the Question?, 1993, ISBN: 0-385-31211-3.

COURSE DESCRIPTION
Quantum computers can solve some problems that are intractable on digital (Turing) computers in a more efficient manner.  Quantum computers are based on quantum algorithms (called 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 logic and computing; 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 logic 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. CS 4381 - Digital Computer Design (Grade of C or better)
2. ECE/CS 5385 - Microprocessor Architecture and Interfacing (Grade of C or better)
3. ECE 5381 - Digital Computer Design (Grade of C or better)
4. ECE 5385 - Microprocessors in Digital Design (Grade of C or better)
5. ECE 5383 Introduction to Quantum Informatics (Grade if C or better)
6. Consent of instructor

WEB RESOURCES
Quantum Physics Paper Archive

ADMINISTRATION
Class Schedule
Grading Policy (student acknowledgement form)
Presentation/Project Suggestions

TOPICS
 - Overview of Computing as a Physical Process
 - Overview of Logic and Relations to Quantum Logic
 - Qubits: Quantum Superposition and Entanglement
 - Measurement and Decoherence
 - Logical and Physical Reversibility
 - Quantum Logic/Computing Operators/Gates and Algorithms/Circuits
 - 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.)