4.10. Quantum Information and Computing (QIC)

4.10. Quantum Information and Computing (QIC)

This area covers the mathematical theory of quantum information and computation, including the linear algebraic formalism of quantum mechanics, quantum algorithms, entanglement theory, error correction, and tensor network methods for quantum simulation.

Table 4.10: List of KUs in the Quantum Information and Computing area.

4.10.1. QIC/Quantum Mechanics Foundations for Computing  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Postulates of quantum mechanics formulated for computation: state spaces, observables, measurement, and unitary evolution.
Topics:
Core

  • Hilbert space formalism: state vectors, Dirac notation, and inner products
  • Observables as Hermitian operators: eigenvalues, eigenstates, and the spectral theorem
  • Measurement postulate: Born rule, projective measurements, and collapse of the state
  • Unitary evolution: the Schrödinger equation and the time evolution operator
  • Density matrices: mixed states, partial trace, and the Bloch sphere representation

Learning Outcomes:
Core:

  1. State the postulates of quantum mechanics and represent single-qubit states on the Bloch sphere [Familiarity]
  2. Compute measurement probabilities and post-measurement states using the Born rule and projection operators [Usage]
  3. Distinguish pure from mixed states using density matrices and the partial trace over a subsystem [Assessment]

4.10.2. QIC/Quantum Circuits and Gates  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Qubits, quantum gates, quantum circuits, universality, and the circuit model of quantum computation.
Topics:
Core

  • Single-qubit gates: Pauli, Hadamard, phase, and rotation gates
  • Multi-qubit gates: CNOT, Toffoli, and controlled-U gates
  • Quantum circuits: circuit diagrams, depth, and reversibility
  • Universality: the Solovay-Kitaev theorem and universal gate sets
  • Quantum parallelism, interference, and the role of superposition in computation

Learning Outcomes:
Core:

  1. Construct quantum circuits using standard gate sets and represent their action on basis states [Familiarity]
  2. Analyze the action of a quantum circuit on an input state using matrix multiplication and Dirac notation [Usage]
  3. Justify the universality of a gate set using the Solovay-Kitaev theorem and approximate a target unitary [Assessment]

4.10.3. QIC/Quantum Algorithms  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Quantum Fourier transform, phase estimation, Shor's factoring algorithm, Grover's search, and HHL for linear systems.
Topics:
Core

  • Quantum Fourier transform: circuit construction and complexity analysis
  • Quantum phase estimation algorithm and its role as a subroutine
  • Shor's factoring algorithm: period finding and reduction to factoring
  • Grover's search algorithm: quadratic speedup and amplitude amplification

Non Core

  • HHL algorithm for linear systems and quantum speedup for machine learning

Learning Outcomes:
Core:

  1. Describe the quantum Fourier transform and explain how phase estimation extracts eigenvalue information [Familiarity]
  2. Trace through Shor's and Grover's algorithms step by step and identify the source of quantum speedup [Usage]

NonCore:

  1. Analyze the resource requirements of the HHL algorithm and identify the conditions under which it achieves exponential speedup [Assessment]

4.10.4. QIC/Entanglement and Bell Inequalities  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Quantum entanglement: Bell states, Bell inequalities, CHSH inequality, no-cloning, and entanglement measures.
Topics:
Core

  • Bell states, entangled versus separable states, and the Schmidt decomposition
  • Bell inequalities and the CHSH inequality: local hidden variable theories vs. quantum mechanics
  • No-cloning theorem and no-communication theorem
  • Entanglement measures: entanglement entropy, concurrence, and negativity
  • Quantum teleportation and superdense coding protocols

Learning Outcomes:
Core:

  1. Verify that Bell states are maximally entangled and compute their Schmidt decomposition [Familiarity]
  2. Derive the CHSH inequality and show that quantum mechanics violates it for the singlet state [Usage]
  3. Quantify the entanglement of a bipartite state using entanglement entropy and concurrence [Assessment]

4.10.5. QIC/Quantum Error Correction  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Decoherence, quantum error models, stabilizer codes, the surface code, and fault-tolerant quantum computation.
Topics:
Core

  • Decoherence and quantum noise: bit-flip, phase-flip, and depolarizing channels
  • Quantum error-correcting codes: the Shor code and the 7-qubit Steane code
  • Stabilizer formalism: Pauli group, stabilizer codes, and syndrome measurement
  • Surface code: threshold theorem, logical qubits, and recent experimental realizations (2023-2025)
  • Fault-tolerant quantum computation: transversal gates and the threshold theorem

Learning Outcomes:
Core:

  1. Explain the Shor code construction and describe how it corrects arbitrary single-qubit errors [Familiarity]
  2. Apply the stabilizer formalism to encode a logical qubit and determine the syndrome for a given error [Usage]
  3. Analyze the surface code threshold and explain why it is the leading candidate for fault-tolerant quantum hardware [Assessment]

4.10.6. QIC/Tensor Networks and Quantum Simulation ↑ Back to top

Tensor network representations of quantum states (MPS, PEPS, MERA), contraction algorithms, and applications to quantum many-body simulation.
Topics:
Non Core

  • Tensor contractions: index notation, contraction order, and computational complexity
  • Matrix product states (MPS) and the density matrix renormalization group (DMRG)
  • Projected entangled pair states (PEPS) for 2D and higher-dimensional systems
  • Multi-scale entanglement renormalization ansatz (MERA) and holographic connections
  • Tensor networks in machine learning: tensor decompositions and quantum-inspired algorithms

Learning Outcomes:
NonCore:

  1. Describe the MPS representation of a many-body quantum state and explain how bond dimension controls approximation quality [Familiarity]
  2. Apply DMRG to compute the ground state of a 1D quantum spin chain and analyze convergence with bond dimension [Usage]
  3. Evaluate the computational cost of tensor network contraction and compare classical tensor network simulation with quantum hardware [Assessment]

Spotted a typo, an outdated course, a broken link, or have a suggestion? Let us know.

Scan to open on your phone