Quantum
Home / Courses / QQ-326

QQ-326 · Quantum Algorithms

Oracles, Ancillas and Uncomputation

Intermediate 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

Translate a small Boolean predicate into a reversible oracle and account for workspace cleanup.

LevelIntermediate
PathwayQuantum Algorithms
AudienceQuantum algorithm developers and applied researchers
ToolsCircuit diagrams, Local circuit simulator, Python
PrerequisitesCircuit notation, linear algebra and basic algorithm analysis.
Proposed duration60 to 90 minutes (proposed)
StatusPlanned

← QQ-325 Algorithm Inputs, Outputs and Cost AssumptionsQQ-327 Phase Kickback as an Algorithm Primitive →