Quantum Annealing for Route Optimization (2D)

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. This 2D view lays the replica grids out as a stacked isometric strip, the decoded route as a pannable/zoomable ring of stops, and a live strip-chart of temperature, field and energy against the anneal schedule.