Quantum computing offers genuine advantages for combinatorial optimisation problems that are intractable for classical solvers at scale. The Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), and supply chain scheduling all map naturally to the Quadratic Unconstrained Binary Optimisation (QUBO) formulation solved by QAOA on QCOS.

The Quantum Advantage for Logistics

Classical OR solvers (CPLEX, Gurobi, OR-Tools) find approximate solutions to VRP in polynomial time, but struggle as problem size grows. QAOA provides:

Travelling Salesman Problem (TSP)

QUBO Formulation

TSP maps to QUBO through binary variables x[i,t] = 1 if city i is visited at time step t. The Hamiltonian combines two constraint penalties and the distance objective:
where W[i,j] is the distance matrix and A > B × W_max ensures constraint satisfaction.

Python Example — 5-City TSP with QAOA


Vehicle Routing Problem (VRP)

VRP extends TSP to multiple vehicles with capacity and time-window constraints. Use the /api/v1/algorithms/qaoa endpoint with problem_type: "vrp":

Supply Chain Scheduling

Map job-shop scheduling to QUBO for quantum-optimised production planning:

Cost Estimation Before Submission

Before running on expensive QPU backends, always estimate costs:

Real-World Results