This project is an experimental visualization tool for exploring how quantum annealing–inspired algorithms can be applied to the Traveling Salesman Problem (TSP). Instead of acting as a black-box solver, the application focuses on showing the internal dynamics of the optimization process. A TSP instance is encoded into a QUBO / Ising formulation, which is then processed by an annealing simulator representing a grid of interacting qubits.
The goal of the project is educational and exploratory rather than performance-oriented. The application provides visual representations of the qubit lattice, interactions between variables, and the evolution of the system during annealing. Users can modify parameters of the simulation and inspect how candidate routes emerge from the underlying qubit states.
This repository is primarily intended as a visual and conceptual tool for understanding the relationship between combinatorial optimization problems and quantum annealing models.