Workshop Description
Many defence optimisation problems (fleet routing, sensor placement, logistics scheduling, spectrum allocation) can be formulated as QUBO (Quadratic Unconstrained Binary Optimisation) or Ising model problems suitable for quantum hardware. The Quantum Approximate Optimisation Algorithm (QAOA) and variational quantum eigensolver (VQE) are the leading gate-based approaches, while quantum annealing (D-Wave) offers an alternative for specific problem structures. However, current NISQ devices face significant limitations: noise restricts circuit depth, qubit counts limit problem size, and classical solvers (Gurobi, CPLEX, simulated annealing) remain highly competitive.
This workshop provides defence operations researchers with a technically rigorous comparison of quantum and classical optimisation approaches. Participants learn to formulate defence resource allocation problems as QUBO instances, understand the mapping from problem to quantum hardware, and critically evaluate published benchmark results. The interactive demonstration compares QAOA and classical solver performance on a defence logistics problem, illustrating where quantum approaches show promise and where classical methods still dominate.
What participants cover
- QAOA and VQE for combinatorial optimisation: algorithm mechanics, circuit depth, and convergence
- QUBO formulation: mapping defence resource allocation, routing, and scheduling to quantum hardware
- Quantum annealing (D-Wave): capabilities, limitations, and comparison with gate-based approaches
- Classical solver benchmarking: Gurobi, CPLEX, and simulated annealing performance baselines
- Benchmark-specific performance comparisons: where quantum shows promise versus where classical dominates
- Investment timing: when quantum optimisation may become operationally relevant for defence