R—01
Quantum optimization on operational problems
Applied rather than asymptotic. Instances taken from live industrial data.
Published QAOA results tend to use synthetic graphs. Real scheduling and allocation problems carry constraints that change the encoding entirely.
Questions
- Constraint encoding strategies that keep circuit depth tractable
- Penalty weight selection without exhaustive search
- Where digital annealing outperforms gate-model QAOA
- Instance structures that predict quantum benefit
Method
- Benchmarks against production classical solvers
- Reproducible harnesses published alongside results
- Noise-model simulation before hardware runs
- Negative results reported, not buried