Advanced -> Quantum Algorithms
Theory-breadth quantum coverage taught first through a classical simulator for the Deutsch-Jozsa promise problem and its Hadamard-layer amplitude invariant.
- Topic slug:
advanced/quantum-algorithms
- Tutorial page: Open tutorial
- Ladder page: Open ladder
- Repo problems currently tagged here:
1
- Repo companion pages:
4
- Curated external problems:
2
Microtopics
- deutsch-jozsa
- promise-problem
- phase-oracle
- hadamard-layer
- constant-vs-balanced
- quantum-simulator
- classical-transform-compare
Learning Sources
Repo Companion Material
Curated External Problems
Core
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Deutsch-Jozsa Oracle Benchmark |
MIT OCW 6.845 |
Theory |
Promise Problems |
Theory Benchmark; Simulator |
Boolean Cube; Signs |
Deutsch-Jozsa; Phase Oracle; Hadamard; Constant Vs Balanced |
The canonical first quantum benchmark for this repo because one clean amplitude invariant separates the promised constant and balanced oracle families. |
Stretch
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Quantum computation notes |
Waterloo |
Theory |
Further Theory |
Lecture Notes; Theory Breadth |
Deutsch-Jozsa; Hadamard Layers |
Grover; Shor; Quantum States; Amplitudes |
A strong follow-up once Deutsch-Jozsa is clear and you want broader theory without pretending the repo lane already covers full quantum implementation work. |
Repo Problems
| Code |
Title |
Fit |
Difficulty |
Pattern |
Note |
Solution |
DEUTSCHJOZSA |
Deutsch-Jozsa Oracle Benchmark |
primary |
medium |
- |
Note |
Code |
Regeneration
python3 scripts/generate_problem_catalog.py