Quantum Problem Compiler · Learn

Inspect the mathematical formulation

Follow source data into decision variables, constraints and auxiliary variables.

Understand

Native review shows the objective, variable mapping, constraints, energy relationship and penalty rationale. Decision variables represent choices; auxiliary variables encode conditions such as inequality slack.

Fixed-start TSP uses (n − 1)² city/position variables and city/position one-hot constraints. Its validated penalty is 1 + n × maximumDistance.

Scheduling uses one variable per permitted operation/start-time pair. Penalties enforce one start, precedence and machine non-overlap. Routing enumerates all capacity-feasible simple depot-return routes, deduplicates reversals, and adds fleet-count slack. It rejects oversized expansion instead of truncating the route set.

Review counts from the actual encoding. Customer count, city count or operation count alone is not the number of variables.

Visualize

Review an example, then select a native constraint. Its terms point to the corresponding entries in the existing variable mapping.

Loading the local example explorer…

Experiment

Compare TSP city constraints with position constraints. Switch to Routing and inspect decision versus auxiliary roles. Compare these with Scheduling start-time variables.

Return to the example controls

Apply

Confirm only after the native objective, constraints and variable mapping match your intent. Exported source identifiers help trace the formulation back to the input.

Open Quantum Problem Compiler

Check your understanding

Why can a model need more bits than it has customers or operations?