Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem
summary
Clusters of CVRP nodes reduce the problem to small TSP instances (4–6 nodes) and are encoded as a QUBO with penalty terms (one binary per location/time step). Experiments compare variational algorithms (QAOA vs VQE) across optimizers and hardware limits, measuring feasibility ratio and TSP length ratio. QAOA repeatedly fails due to a rugged loss landscape and cannot overcome an energy threshold, while VQE shows a threshold effect and produces useful feasible routes on these toy instances.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:24Quantum optimization in supply chains
- 4:30Vehicle routing problem
- 6:41QUBO formulation
- 9:15Quantum algorithms and hardware
- 11:05QAOA versus VQE
- 13:56Evaluating quantum solutions
- 16:47Why VQE outperforms QAOA
- 17:50Live demo and Q&A
related talks
19mQuantum inspired Traffic Light Optimization
17mExploring Quantum Algorithms for Optimal Sensor Placement in Production Environments
52mThe Virtues of the Quantum Approximate Optimization Algorithm
29mA Verified Optimizer for Quantum Circuits
21mBeating classical heuristics for the binary paint shop problem with the QAOA
11mExpanding the VOQC Toolkit
18mAutomated distribution of quantum circuits via hypergraph partitioning
17mQVM: Quantum Gate Virtualization Machine