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.
| Level | Intermediate |
|---|---|
| Pathway | Quantum Algorithms |
| Audience | Quantum algorithm developers and applied researchers |
| Tools | Circuit diagrams, Local circuit simulator, Python |
| Prerequisites | Circuit notation, linear algebra and basic algorithm analysis. |
| Proposed duration | 60 to 90 minutes (proposed) |
| Status | Planned |
← QQ-325 Algorithm Inputs, Outputs and Cost AssumptionsQQ-327 Phase Kickback as an Algorithm Primitive →