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 penalty formulations and mixers that preserve feasibility for a small optimisation problem.
| Level | Advanced |
|---|---|
| Pathway | Quantum Algorithms |
| Audience | Quantum algorithm developers and applied researchers |
| Tools | Python, Graph or optimisation library, Local circuit simulator |
| Prerequisites | Quantum algorithms and the mathematics of the selected problem. |
| Proposed duration | 60 to 90 minutes (proposed) |
| Status | Planned |
← QQ-332 Grouping Observables to Reduce MeasurementsQQ-334 Quantum Monte Carlo and Quantum Amplitude Estimation →