Home▸Quantum Computing▸Quantum Annealing for Route Optimization

Quantum Annealing for Route Optimization

Watch simulated quantum annealing solve a QUBO-encoded delivery-route problem: Trotter replicas of a spin lattice tunnel through energy barriers as the transverse field is ramped down, converging on a low-cost route.

Quantum Computing3DAdvanced60 FPS📱 Mobile-adapted⇄ 2D version

A small delivery-routing problem — five stops, find the shortest closed tour — is encoded as a QUBO exactly the way it would be submitted to a real quantum annealer, and solved here with Path-Integral Monte Carlo: several imaginary-time "Trotter replica" copies of the spin lattice, coupled to each other and driven by a transverse field that is ramped down over the anneal. Watch the stacked replica lattice settle as the field drops and the decoded route on the right shrinks toward a valid, low-cost tour, with live readouts for temperature, field strength, replica energy and the best route length found so far.

⚙ Under the hood

Solve a small QUBO-encoded delivery-route problem with Path-Integral Monte Carlo: watch stacked Trotter replicas of a spin lattice tunnel through energy barriers as the transverse field is ramped down, converging on a low-cost tour.

quantum annealingQUBOTrotter replicasTSPPath-Integral Monte Carlooptimization

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install