CLASSICAL EXACT
—
Build route costs.
Find the best combination.
Route distance —Gap to optimum —
→→
Reuses exact results for smaller subproblems to find the shortest complete plan.
SAME PROBLEM. SAME COMPUTER.
Classical vs. quantum.
Deliver to 15 cities with 4 vehicles.
What changes is how we search for a route.
QUANTUM-ASSISTED SIMULATED
—
Simulate atoms.
Sample, check, and merge.
Route distance —Gap to optimum —
→→
A heuristic: quantum simulation proposes choices; classical code checks capacity and finishes routes.
Time spent
Both bars use the same linear scale. All time is measured wall-clock time.
The comparison will appear when measured data loads.
This is a CPU simulation, not a real quantum computer.
A 5.2 μs laser pulse is not the full algorithm runtime. Real QPU wall time was not measured.
What exactly was timed?
Same cities, demands, vehicle count, and capacity. Different guarantees: classical returns the proven optimum; the quantum-assisted heuristic may return a longer route. Classical timing includes exact subset tours and exact partition optimization. Quantum timing includes layout fitting, full state-vector simulation, sampling, validation, and classical trivial/size-fallback routing. No cached exact reference supplies the quantum solution.
These three runs use the same fixed solver seed. They measure timing variability for this workload, not solution variability or a general scaling advantage. File export, module imports, offline scoring, network queues, and real hardware are outside the timer.
Download raw timings ↓