QTM106 · Quantum Algorithms and Real-World Applications
About Course
Study the algorithms that define quantum computing, from the quantum Fourier transform, phase estimation and Shor's algorithm to Grover search and variational methods, and assess realistically where they apply in industry and security.
Who it is for
Developers, analysts and technology strategists who can write Qiskit code and want to understand and evaluate quantum algorithms in depth.
Prerequisites
QTM105; comfort with Python, NumPy and basic optimization concepts.
What you will be able to do
- Explain how the quantum Fourier transform and phase estimation underpin Shor's algorithm and estimate why it threatens RSA and elliptic-curve cryptography
- Implement Grover's algorithm and compute the optimal number of iterations for a given search space
- Build and optimize a QAOA circuit for a small MaxCut problem and compare it with a classical solution
- Evaluate a proposed industry application for quantum advantage using resource, data-loading and baseline criteria
Lessons
- Lesson 1 · The QFT, phase estimation and Shor's algorithm
- Lesson 2 · Grover search and variational algorithms
- Lesson 3 · Applications, evidence and post-quantum migration
- Lesson 4 · Lab and assignment
Lab: Grover search and QAOA for MaxCut
You implement Grover's algorithm on three qubits with a phase oracle, vary the number of iterations and observe the success probability rise and fall. You then formulate MaxCut on a five-node delivery-zone graph as an Ising Hamiltonian, build a depth-1 and depth-2 QAOA circuit and optimize its parameters with SciPy using the Estimator. Finally, you compare the best cut with a brute-force classical answer.
Free tools: Google Colab (free) with Qiskit, SciPy and NetworkX
Assessed assignment
Write a technical evaluation of one proposed quantum application in a sector of your choice, such as portfolio optimization for a bank, battery materials for a manufacturer or vehicle routing for a delivery company. Describe the algorithm family that would be used, estimate the qubits and gate depth needed with published resource estimates and identify the best classical baseline. Include a small proof-of-concept notebook (Grover, QAOA or VQE) on a toy version of the problem and compare it with the classical result. Conclude with a realistic timeline and a recommendation on what the organization should do in the next two years.
| Criterion | Weight | What excellent work looks like |
|---|---|---|
| Algorithm understanding | 25% | Correctly explains the algorithm, its speedup type and its assumptions such as oracles or data loading. |
| Resource and baseline analysis | 30% | Uses credible resource estimates and a strong classical baseline; avoids inflated claims. |
| Proof-of-concept notebook | 25% | Notebook runs, is well documented and compares quantum and classical results fairly. |
| Strategic recommendation | 20% | Timeline and next steps are realistic, specific and include post-quantum security where relevant. |
Portfolio piece
A quantum application evaluation report with a working Grover, QAOA or VQE proof of concept and a classical comparison.
Next step
Continue with QTM107 · Final Project: A Quantum Computing Readiness Report · 8 hours · $56.00
Course Content
QTM106 · Quantum Algorithms and Real-World Applications (8 h)
-
Lesson 1 · The QFT, phase estimation and Shor’s algorithm
-
Lesson 2 · Grover search and variational algorithms
-
Lesson 3 · Applications, evidence and post-quantum migration
-
Lesson 4 · Lab and assignment
-
QTM106 Assessment · Quantum Algorithms and Real-World Applications
