Optimisation
When classical beats quantum, and how to read an optimisation claim.
1 lesson, 33 course topics, about 192 min at Plain. Opened pages are remembered in this browser only.
Start here
Can a classical machine out-optimise a quantum one?about 3 min at PlainThe lessons, in reading order
-
Can a classical machine out-optimise a quantum one?
You'll be able to say when a classical or analog machine beats a quantum one on an optimisation problem.
The course: The Feasible Region
Operations research, from linear programming to game theory and reinforcement learning. Open the course page.
Foundations Regions, corners and curves
Discrete When the answer must be whole, and when exact methods run out
Networks Flows, assignments and routes
Uncertainty Deciding when the world is not certain
Many goals and players When more than one objective, or more than one decision-maker, is involved
Games, part two Time, secrets, repetition, learning, signals, traffic, hardness and a quantum game
Capstone Inventory and supply chain
How this track counts toward your rank
Your rank is a code distance, d3 up to d25. Points come from questions you answer correctly and game levels you finish, never from opening a page, and each point belongs to one track. Your overall rank is set by your weakest track, and the top rank needs 80% of every track. This track holds 142 points: 1 lesson check question, 1 point each (1); 33 course topic checks, 2 points each (66); 25 game levels, up to 3 points each for gold (75). Its games: Max-Cut (9), The Annealing Volcano (9), Heuristic Arena (6), Be FunSearch (1).
| Rank | Points |
|---|---|
| d3 | 0 |
| d5 | 11 |
| d7 | 21 |
| d9 | 31 |
| d11 | 42 |
| d13 | 52 |
| d15 | 62 |
| d17 | 73 |
| d19 | 83 |
| d21 | 93 |
| d23 | 104 |
| d25 | 114 |