Quantum Computing · Assignments
Assignments
Comprehensive problem sets synthesizing concepts across chapters
Comprehensive assignments that bring together ideas from across multiple chapters. Each assignment tests understanding of transitions, configurations, and core mathematical principles.
In this chapter · 1 sections
Course Problem Sets
These comprehensive problem sets bring together foundational models, mathematical proofs, circuit constructions, and physical principles from across multiple chapters. Unlike isolated exercises, each assignment asks you to synthesize ideas: tracing how classical reversibility grounds quantum gate models, how geometry dictates state distinguishability, and how composite entanglement sets the boundary between classical and quantum information processing.
Work through each assignment after completing its prerequisite chapters. Attempt every problem independently by hand, showing all intermediate algebraic steps, before expanding the complete worked solutions to verify your reasoning.
Assignments Directory
-
01
Assignment 1: Foundations of Quantum Computation (Chapters 1–6)
10 multi-part analytical problems covering classical, reversible, probabilistic, and quantum models of computation: deterministic configuration trajectories, Turing invariants and cycle topologies, stochastic vs. unitary norm conservation (\(\ell_1\) vs. \(\ell_2\)), multi-path interference and which-path information, inner products and state geometry, Pauli operator decompositions, local vs. entangling composite operations, the no-cloning theorem, quantum teleportation and no-signalling, and quantum parallelism with oracle evaluation and preimage superpositions.
-
02
Assignment 2: Algorithms, Universality, and Complexity (Chapters 7–10)
Comprehensive problem set covering the Deutsch–Jozsa and Simon algorithms, phase kickback, universal fault-tolerant gate sets (Solovay–Kitaev), Grover's search and geometric reflections, and quantum query complexity lower bounds via the polynomial method.
In preparation · Following Chapters 7–10
How to Approach the Assignments
Work from first principles. Rather than memorizing formulas, derive state evolutions, inner products, and operator identities step by step. When calculating state transformations, write down the full tensor product representation or state sum before applying gates.
Distinguish mathematical definitions from physical postulates. State clearly when a property follows from the mathematics of vector spaces (such as linearity or the Cauchy–Schwarz inequality) versus when it relies on a physical postulate of quantum mechanics (such as unitarity of closed evolution or the Born rule for projective measurement).
Compare with physical intuition. Check limiting cases whenever possible: what happens when \(\theta = 0\) or \(\theta = \pi/4\)? Does an entangled state reduce to a product state? Does an unconditioned marginal density matrix reflect the no-signalling principle? Checking these boundaries will quickly catch algebraic errors.