Quantum Modeler · Traveling Salesperson (TSP)

Traveling Salesperson (TSP)

Visit every city once and return to fixed start 0. Inspect a symmetric distance tour, its QUBO encoding, and an independent exact reference.

Execute at most 8 total qubits using an ideal classical statevector simulator. Symbolic scaling does not execute or solve a larger instance.

Build your problem

Presets replace problem inputs. Your execution and projection settings stay as entered. Edit any input, then build to calculate new results.

This position encoding executes 2–3 cities: (cities − 1)² decision qubits. In a symmetric three-city problem both tours have equal distance; this demonstrates feasibility and encoding, not a meaningful optimization choice.

Problem inputsSpace or comma-separated nonnegative distances. The diagonal must be zero and both directions must match exactly. Node 0 is the depot or fixed start.
Large-target projection (optional)

Leave all target fields blank for this exact encoded input. Enter independent target statistics to estimate resources; only the small instance is executed.

Grey examples are suggestions; enter values for your own target.Fixed-start position encoding: (cities − 1)² decision variables. No target distance matrix is inferred.

Use the Quantum Compiler for native compile-only inputs within its resource limits. A projection does not construct or compile the target.

Execution settings

Depth 1 QAOA, at most 64 parameter evaluations. One completed build uses one run when usage limits are enabled.

Qubit budget

All decision and auxiliary variables count toward the limit. The API validates all constraints before reserving a run.

Read the mathematical methodology

Ready to validate a small instance.

Routing and scheduling models

TSP · Job Scheduling · Vehicle Routing. Tiny validated examples execute within eight total qubits; larger inputs use the Problem Compiler.

No quantum advantage, real-QPU performance, physical-qubit requirement, or production-scale solution quality is claimed.