2.11. Quantum Computing and Algorithms (QCA)

2.11. Quantum Computing and Algorithms (QCA)

This area introduces the fundamental principles of quantum computing and quantum algorithms, bridging the gap between quantum mechanics and computational mathematics. It covers quantum bits, quantum gates, quantum circuits, and the development of quantum algorithms that offer potential speedups over classical approaches. The focus is on understanding the mathematical foundations of quantum computation and implementing quantum algorithms using classical simulation tools.

Table 2.11: List of KUs in the Quantum Computing and Algorithms area.

2.11.1. QCA/Quantum Mechanics Foundations for Computation  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Quantum states and state vectors
  • Superposition and entanglement
  • Quantum measurement and observables
  • Hilbert spaces and Dirac notation
  • Unitary evolution and quantum dynamics

Learning Outcomes:
Core:

  1. Describe quantum states using Dirac notation [Familiarity]
  2. Explain superposition and entanglement phenomena [Familiarity]
  3. Apply quantum measurement principles [Usage]
  4. Analyze unitary transformations in quantum systems [Assessment]

2.11.2. QCA/Qubits and Quantum Circuits  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Qubit representation and Bloch sphere
  • Quantum gates and circuits
  • Universal quantum gate sets
  • Quantum noise and error models
  • Quantum circuit simulation

Learning Outcomes:
Core:

  1. Represent qubits using mathematical formalism [Usage]
  2. Design quantum circuits using standard gates [Usage]
  3. Implement universal quantum gate sets [Usage]
  4. Simulate quantum circuits on classical computers [Usage]

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

Topics:
Core

  • Deutsch-Jozsa algorithm
  • Grover's search algorithm
  • Shor's factoring algorithm
  • Quantum Fourier Transform
  • Quantum walk algorithms

Learning Outcomes:
Core:

  1. Implement Deutsch-Jozsa algorithm [Usage]
  2. Apply Grover's algorithm for search problems [Usage]
  3. Analyze Shor's factoring algorithm [Assessment]
  4. Use Quantum Fourier Transform in algorithms [Usage]

2.11.4. QCA/Post-Quantum Cryptography and Quantum Simulation  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Quantum threat to classical cryptography
  • Lattice-based cryptography
  • Code-based cryptography
  • Quantum simulation of physical systems
  • Quantum error correction

Learning Outcomes:
Core:

  1. Analyze quantum threats to cryptographic systems [Assessment]
  2. Implement lattice-based cryptographic schemes [Usage]
  3. Simulate quantum systems using classical computers [Usage]
  4. Apply quantum error correction codes [Usage]

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

Scan to open on your phone