Circuits that outperform classical computation
These six algorithms show how superposition, entanglement, and interference combine to solve problems that classical computers cannot solve as efficiently. Each algorithm is presented as a step-by-step circuit walkthrough with motivation, intuition, and a quiz.
See prerequisite ideas, theorem links, simulator paths, and hardware links for this module.
10 questions — 90% or higher to pass
Complete all lessons first, then take the exam.