CPSC 436Q: Quantum Computation (2024W1)

Schedule

Italicized entries are tentative.

Overview

This is an advanced undergraduate introductory course to quantum computation but assumes no prior knowledge of quantum information.

Tentative list of topics:

• Bits, randomized bits, and qubits
• Notation and postulates of quantum information
• Query and Turing models of classical and quantum computation
• Quantum algorithms that are provably faster than any classical algorithm in the query model
• Limitations of quantum algorithms in the query model
• Quantum algorithms that are faster than all known classical algorithms in the Turing model
• Quantum advantage in communication and cryptography
• Fragility of quantum information and quantum error correction

Project

You will work in a team of 2-3 to write an expository paper on a topic of your choice from the quantum computation and information literature. You should submit a project proposal, a project progress report, and your completed paper. A list of candidate project topics, along with some commentary, will be released on Sept 27. (You will not be disadvantaged if you choose a topic outside this list.)

Dates and guidelines (adapted from here):

• Proposal (worth 5%, due Oct 14): a paragraph summarizing the topic, a timeline, and a list of selected references.
• Progress report (worth 15%, due Nov 11): this includes a partial draft of your final paper showing that you are making progress, a paragraph summarizing what remains to be done, and an updated timeline. The partial draft should be at most 5 pages in length excluding references.
• Final paper (worth 80%, due Dec 6): a paper covering your chosen topic. Original research is encouraged but not expected. Your paper should cover the topic using multiple references and not just summarize one reference. Your target audience should be your classmates. 40% of the marks will be for scientific content and the other 40% will be for presentation. The paper should be at most 12 pages in length excluding references.