Quantum Computing (Graduate)

Course Description

COT5600 – Quantum Computing is a 3-credit-hour graduate-level computer science course that develops advanced competency in quantum computing. The course extends the undergraduate-level treatment in COT4601 with the depth, theoretical rigor, and research orientation appropriate for graduate computer science students. Topics include rigorous treatment of quantum mechanical foundations relevant to computing; advanced quantum algorithms (the standard quantum algorithms at advanced rigor; phase estimation; HHL algorithm at conceptual level for linear systems; advanced search and optimization algorithms); quantum complexity theory at intermediate level (BQP, QMA, the relationship to classical complexity classes); quantum error correction at intermediate level (stabilizer codes, surface codes at introductory level, fault-tolerant quantum computing); quantum information theory foundations (entropy, channel capacity at conceptual level); and the engagement with current quantum computing research literature.

Quantum computing is in a period of rapid evolution with substantial industry investment from IBM Quantum, Google Quantum AI, Microsoft Azure Quantum, Rigetti, IonQ, Quantinuum, PsiQuantum, and many academic institutions. Graduate students typically engage substantively with research literature, develop original analyses or implementations, and (in many institutional implementations) prepare work suitable for conference presentation or thesis research. Coursework typically combines lecture and example-based instruction with substantial programming projects using quantum software development kits.

COT5600 is a Florida common course offered at approximately 2 Florida institutions. The course transfers as the equivalent course at Florida public postsecondary institutions per SCNS articulation policy where the receiving graduate program accepts the course; graduate course transfer is typically more restrictive than undergraduate transfer.

Learning Outcomes

Required Outcomes

Upon successful completion of this course, students will be able to:

• Apply linear algebra and quantum mechanics at advanced level, including rigorous treatment of complex Hilbert spaces; tensor products at advanced level; the postulates of quantum mechanics with rigorous treatment; density matrices and mixed states; the engineering use in quantum computing.
• Apply advanced qubit and quantum state theory, including pure and mixed states; the density matrix formalism; partial traces; the Schmidt decomposition; the engineering applications.
• Apply advanced quantum gates and circuits, including the universal gate set theory at rigorous level; the Solovay-Kitaev theorem at conceptual level (efficient approximation by discrete gate sets); circuit depth and width considerations; the engineering applications.
• Apply advanced quantum measurement, including projective measurement; POVM (positive operator-valued measurement); the Naimark dilation theorem at conceptual level; the engineering applications.
• Apply advanced quantum entanglement, including entanglement measures; Bell inequalities with rigorous treatment; entanglement distillation at introductory level; the engineering applications.
• Apply standard quantum algorithms at advanced rigor, including Deutsch-Jozsa, Bernstein-Vazirani, Simon's algorithm, Grover's search, and Shor's algorithm with rigorous analysis; the engineering implications.
• Apply quantum phase estimation, including the algorithm structure; the relationship to other quantum algorithms; the engineering applications.
• Apply HHL algorithm at conceptual level for solving linear systems on quantum computers; the engineering implications and limitations.
• Apply advanced quantum search and optimization, including amplitude amplification (the generalization of Grover's search); quantum walks at introductory level; the engineering applications.
• Apply quantum complexity theory at intermediate level, including BQP at advanced level; QMA (the quantum analog of NP); the relationship to classical complexity classes (BQP contains P; BQP is contained in PSPACE; the unknown relationship to NP); BQP-complete problems; the engineering implications.
• Apply quantum error correction at intermediate level, including the stabilizer formalism; common stabilizer codes (the three-qubit, five-qubit, seven-qubit codes); the surface code at introductory level; fault-tolerant quantum computing concepts; the threshold theorem; the engineering implications.
• Apply quantum information theory foundations, including von Neumann entropy; quantum channels; channel capacity at conceptual level; the engineering applications.
• Engage with quantum computing research literature, including the location and rigorous evaluation of peer-reviewed quantum computing research; the conventions of the field; the role of major venues (Quantum Information Processing — QIP; Theory of Quantum Computation, Communication and Cryptography — TQC; arXiv quant-ph).
• Develop substantive quantum computing projects applying advanced quantum algorithms or quantum programming to substantial problems, with the depth appropriate for graduate computer science work.

Optional Outcomes

• Apply quantum machine learning at intermediate level, including variational quantum eigensolvers (VQE); quantum approximate optimization algorithm (QAOA); quantum kernel methods; the engineering applications and current research state.
• Apply quantum cryptography at intermediate level, including BB84 with rigorous security argument; quantum digital signatures; post-quantum cryptography considerations.
• Apply quantum simulation at intermediate level, including Hamiltonian simulation; quantum chemistry algorithms; the engineering applications.
• Apply introductory topological quantum computing, including topological qubits at conceptual level; the connection to Microsoft's quantum computing strategy.
• Apply introductory continuous-variable quantum computing, including the connection to photonic quantum computing.
• Develop work suitable for conference presentation (QIP, TQC at introductory level for the most ambitious students) or peer-reviewed publication.

Major Topics

Required Topics

• Quantum Computing at Graduate Level: The role of quantum computing in modern computer science research and engineering practice; the relationship to classical computing; the standards for graduate-level quantum computing work; the rapidly evolving research landscape.
• Mathematical Preliminaries — Advanced: Complex Hilbert spaces with rigorous treatment; tensor products at advanced level; spectral decomposition of Hermitian operators; the trace and partial trace; positive semidefinite matrices.
• Postulates of Quantum Mechanics — Rigorous: The state space postulate (states as unit vectors in Hilbert space, or more generally as density matrices); the evolution postulate (unitary evolution; the Schrödinger equation); the measurement postulate (projective measurement and POVM); the composite system postulate (tensor product structure); the engineering implications at rigorous level.
• Density Matrices and Mixed States: The density matrix formalism; pure vs. mixed states; the partial trace and its operational meaning; the Schmidt decomposition; the engineering applications.
• Universal Quantum Gates and Circuits: The universal gate set theory at rigorous level; the Solovay-Kitaev theorem at conceptual level (any single-qubit unitary can be efficiently approximated by a discrete gate set like Clifford+T); circuit depth and width; the engineering implications.
• Advanced Quantum Measurement: Projective measurement with rigorous treatment; POVM (positive operator-valued measurement) and its operational meaning; the Naimark dilation theorem at conceptual level; the engineering applications.
• Quantum Entanglement — Advanced: Entanglement measures (entanglement entropy, concurrence); the Bell inequalities with rigorous treatment; the violation of Bell inequalities and its implications for hidden variable theories; entanglement distillation at introductory level; the engineering applications.
• Quantum Algorithms — Advanced Treatment: Deutsch-Jozsa, Bernstein-Vazirani, Simon's algorithm with rigorous analysis; the framework of hidden subgroup problem and quantum advantage in this framework; the engineering implications.
• Grover's Search — Advanced: Rigorous analysis; amplitude amplification as a generalization; the engineering applications and limitations (the optimality of Grover's algorithm in the query model).
• Shor's Factoring — Advanced: Rigorous analysis of the period-finding subroutine; the quantum Fourier transform with rigorous treatment; the engineering and cryptographic implications (the threat to RSA when sufficiently large fault-tolerant quantum computers exist).
• Quantum Phase Estimation: The algorithm structure; the analysis; the relationship to Shor's algorithm and quantum simulation algorithms; the engineering applications.
• HHL Algorithm: The algorithm for solving systems of linear equations on quantum computers; the analysis at conceptual level; the engineering implications and limitations (the qualifications about input/output that limit practical advantage).
• Quantum Walks: Discrete-time and continuous-time quantum walks at introductory level; the relationship to classical random walks; the engineering applications (search algorithms, simulation).
• Quantum Complexity — BQP: The class BQP at advanced level; the relationship to other complexity classes (BQP contains P; BQP is contained in PSPACE; the conjectured strict separation BQP ≠ P; the unknown relationship between BQP and NP).
• Quantum Complexity — QMA: The quantum analog of NP; QMA-complete problems; the engineering implications.
• Quantum Error Correction — Stabilizer Formalism: The Pauli group; stabilizer codes; the encoding and decoding circuits; common stabilizer codes (three-qubit bit-flip and phase-flip, five-qubit perfect code, seven-qubit Steane code, nine-qubit Shor code).
• Quantum Error Correction — Surface Codes: The surface code at introductory level; the topological structure; the engineering applications (the surface code is the leading candidate for fault-tolerant quantum computing).
• Fault-Tolerant Quantum Computing: The concept of fault tolerance; the threshold theorem at intermediate level; the engineering implications (the long-term path to fault-tolerant quantum computing).
• Quantum Information Theory — Foundations: Von Neumann entropy; the relative entropy; quantum channels and their properties (completely positive trace-preserving maps); channel capacity at conceptual level; the engineering applications.
• Quantum Computing Research Engagement: The location and evaluation of peer-reviewed quantum computing research; the role of major venues (QIP — the primary theory venue; TQC; APS March Meeting; arXiv quant-ph); current research directions (NISQ — noisy intermediate-scale quantum; quantum machine learning; quantum simulation; fault-tolerant quantum computing).
• Quantum Computing Project: Substantive project applying advanced quantum algorithms or quantum programming to a substantial problem, with the depth appropriate for graduate computer science work.

Optional Topics

• Quantum Machine Learning: Variational quantum eigensolvers (VQE); quantum approximate optimization algorithm (QAOA); quantum kernel methods; quantum neural networks at conceptual level; the engineering applications and current research state.
• Quantum Cryptography: BB84 with rigorous security argument; E91 (entanglement-based QKD); quantum digital signatures; post-quantum cryptography considerations.
• Quantum Simulation: Hamiltonian simulation algorithms (Trotter-Suzuki, qubitization); quantum chemistry algorithms; the engineering applications in chemistry, materials science, and drug discovery.
• Topological Quantum Computing: Topological qubits at conceptual level; the Majorana fermion approach; the connection to Microsoft's quantum computing strategy.
• Continuous-Variable Quantum Computing: The continuous-variable formalism; the connection to photonic quantum computing (PsiQuantum's approach); Gaussian states and operations.

Resources & Tools

• Common Texts: Quantum Computation and Quantum Information (Nielsen/Chuang — the standard graduate text in the field, often called "Mike and Ike"); Quantum Computer Science: An Introduction (Mermin); An Introduction to Quantum Computing (Kaye/Laflamme/Mosca); Quantum Information Theory (Wilde — graduate quantum information reference, free draft online); Classical and Quantum Computation (Kitaev/Shen/Vyalyi)
• Research Resources: Quantum Information Processing (QIP — the primary theory conference); Theory of Quantum Computation, Communication and Cryptography (TQC); APS March Meeting; arXiv quant-ph section for current research; Quantum journal (peer-reviewed, open access)
• Software: Qiskit (IBM, Python-based, free — the most widely adopted educational SDK with substantial graduate-level use); Cirq (Google, Python-based, free); PennyLane (Xanadu, focused on quantum machine learning); Q# (Microsoft); the IBM Quantum Experience and IBM Quantum Network for cloud access to real quantum hardware
• Online Resources: IBM Quantum Learning; Microsoft Quantum Katas; MIT OpenCourseWare 18.435J Quantum Computation; Stanford CS269Q Quantum Computer Programming; the Quantum Algorithm Zoo (comprehensive listing of quantum algorithms maintained by Stephen Jordan)

Career Pathways

COT5600 supports advanced career pathways in the rapidly growing quantum computing field:

• Quantum Software Engineering — Senior — Senior software engineering and research roles at quantum computing companies (IBM Quantum, Google Quantum AI, Microsoft Azure Quantum, Rigetti, IonQ, Quantinuum, PsiQuantum, others).
• Quantum Algorithm Research — Research and development of quantum algorithms; faculty career path in quantum computing.
• Quantum Cryptography Engineering and Research — Senior cryptography engineering roles addressing post-quantum cryptography; substantial investment from financial services, defense, and government.
• Quantum Computing Research at National Laboratories — Sandia, Los Alamos, Lawrence Berkeley, Oak Ridge, NIST; substantial federal investment in quantum computing.
• Defense Quantum Programs — Senior — DARPA, Air Force Research Laboratory, Naval Research Laboratory, and other defense organizations; relevant to Florida defense industry.
• Quantum Computing Startups — Senior roles at quantum computing startups; substantial venture investment in quantum computing.
• Doctoral Quantum Computing Study — Strong preparation for PhD work in quantum computing, quantum information theory, or quantum hardware.
• Florida Quantum Activity — Florida's National High Magnetic Field Laboratory at FSU has quantum hardware research; emerging Florida quantum activity in academia and industry.

Special Information

Graduate-Level Treatment

COT5600 differs from undergraduate COT4601 in several substantive ways: theoretical depth (graduate students engage with the rigorous mathematical foundations of quantum mechanics, complex Hilbert spaces, density matrices); methods sophistication (advanced topics such as POVM, stabilizer codes, surface codes, quantum information theory); research orientation (engagement with peer-reviewed quantum computing research; preparation for thesis or dissertation work); and depth of treatment for standard quantum algorithms.

The NISQ Era

Quantum computing is currently in the "Noisy Intermediate-Scale Quantum" (NISQ) era, characterized by quantum computers with hundreds of qubits but substantial noise. The long-term research goal is fault-tolerant quantum computing with error-corrected logical qubits, which would enable the full potential of quantum algorithms but requires substantial additional engineering progress. COT5600 typically addresses both current NISQ-era practice and long-term fault-tolerant quantum computing.

The Mathematical Demands

Graduate-level quantum computing is mathematically demanding. The course requires substantial linear algebra over complex vector spaces, comfort with abstract mathematical thinking, and willingness to engage with subtle conceptual distinctions. Graduate students with strong mathematical backgrounds typically find the course manageable; graduate students with weaker mathematical backgrounds often need substantial additional preparation.

The Physics-CS Boundary

Graduate quantum computing increasingly bridges computer science and physics. While COT5600 is a CS course, students with physics backgrounds (or physics-CS dual backgrounds) often have advantages. Graduate students should expect content that draws on physical intuition alongside CS algorithmic thinking.

General Education and Transfer

COT5600 is a Florida common course number that transfers as the equivalent course at Florida public postsecondary institutions per SCNS articulation policy where the receiving graduate program accepts the course. Graduate course transfer is more restrictive than undergraduate transfer.

Course Format

COT5600 is offered in face-to-face, hybrid, and online formats. The mathematical content and programming work translate to multiple formats; many institutions offer online sections.

Position in the Graduate Computer Science Curriculum

COT5600 is typically taken as a specialty graduate course for students with quantum computing research interests or career interests. The course supports subsequent specialized graduate work and dissertation research in quantum computing-related areas.

Difficulty and Time Commitment

COT5600 is challenging at the graduate level. The course requires substantial out-of-class time (typically 10-15 hours per week beyond class time), strong mathematical maturity, and persistence through abstract material.

Prerequisites

COT5600 typically requires bachelor's degree in computer science or related discipline (computer science, physics, mathematics, electrical engineering); admission to a graduate computer science program; proficiency in linear algebra (graduate-level expectations); foundational programming proficiency in Python; some institutions require or recommend COT4601 or comparable undergraduate quantum computing course.

AI Integration (Optional)

AI tools can serve as study aids in graduate quantum computing but pose substantive considerations.

Where AI Tools Help

• Concept exploration — alternative explanations of quantum mechanical concepts
• Implementation drafts — initial Qiskit/Cirq implementations as starting points (with substantial verification)
• Mathematical exploration — generating Python code with NumPy for exploring quantum state evolution
• Literature engagement — helping summarize research papers (with rigorous verification against the source)

Where AI Tools Mislead at Graduate Level

• Hallucinated quantum results — AI tools frequently generate plausible-looking but incorrect quantum content; quantum computing is sufficiently specialized that AI hallucinations are common; graduate students should verify content carefully against authoritative sources
• Hallucinated complexity claims — AI tools sometimes make claims about quantum speedup that are incorrect or overstated
• Confusing classical and quantum concepts — AI tools sometimes confuse subtle distinctions (classical probability vs. quantum amplitude; classical superposition vs. quantum superposition)
• Skipped formal rigor — the rigor that defines graduate-level work is precisely what AI tools tend to bypass

Academic Integrity at Graduate Level

Graduate-level academic integrity expectations are stricter than undergraduate. The use of AI tools to generate quantum algorithm implementations or analyses submitted as student work is academic dishonesty under most institutional policies. Graduate students should consult their institution's specific policies and recognize that the conceptual quantum thinking developed at the graduate level is foundational for the rapidly growing quantum computing field — bypassing its development through AI tools fundamentally compromises preparation for those careers.