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
Compare how annealing and gate-based systems express objectives, constraints and candidate solutions.
| Level | Intermediate |
|---|---|
| Pathway | Quantum Algorithms |
| Audience | Quantum algorithm developers and applied researchers |
| Tools | Python, Graph or optimisation library, Local circuit simulator |
| Prerequisites | Circuit notation, linear algebra and basic algorithm analysis. |
| Proposed duration | 60 to 90 minutes (proposed) |
| Status | Planned |
← QQ-318 QAOA in Code: Max-Cut ExampleQQ-320 Choosing the Right Algorithm for the Problem →