Quantum
Home / Courses / QQ-321

QQ-321 · Quantum Algorithms

Algorithm Complexity: Speedups, Real and Claimed

Advanced Planned

Planned, not yet open. This page shows the outline from the course plan. The course has not been developed and cannot be enrolled in yet.

Planned outline

Interpret query, circuit and end-to-end complexity claims and identify costs that an asymptotic comparison may omit.

LevelAdvanced
PathwayQuantum Algorithms
AudienceQuantum algorithm developers and applied researchers
ToolsCircuit diagrams, Resource worksheet
PrerequisitesQuantum algorithms and the mathematics of the selected problem.
Proposed duration60 to 90 minutes (proposed)
StatusPlanned

← QQ-320 Choosing the Right Algorithm for the ProblemQQ-322 Implementing Algorithms on NISQ Hardware →