Quantum Problem Compiler · Learn

Explore all Compiler families

Ten native families share one review and compilation workflow.

Understand

The Compiler supports Max-Cut, Knapsack, Assignment, Custom QUBO, Graph Coloring, Portfolio Selection, Set Cover, TSP, Job Scheduling and Vehicle Routing. Nine have dedicated Modelers; Assignment is available in the Compiler without a dedicated domain Modeler.

Graph Coloring uses a fixed color count. Portfolio uses supplied returns and covariance with a fixed selected count. Set Cover requires each element at least once. Assignment requires each task exactly once, respecting worker capacity and eligible pairs.

TSP requires a complete symmetric nonnegative distance matrix. Scheduling is fixed-horizon feasibility, not minimum makespan. Routing supports identical vehicles, positive demands, one depot, shared capacity and at most the given fleet; it excludes time windows, pickups, split deliveries and heterogeneous fleets.

The local Simulator limit is eight encoded variables. Four-city fixed-start TSP uses nine variables: it can compile, but cannot execute locally. Large-target projections in Modeler remain resource estimates, not solutions.

Visualize

Choose any of the ten families. Guidance and source templates come from the existing Compiler discovery catalog, with native review available for each.

Loading the local example explorer…

Experiment

Review TSP, Scheduling and Routing and compare their variable counts. Review Assignment and inspect eligible-pair variables. No family selection launches compilation automatically.

Return to the example controls

Apply

Open the matching Modeler when one exists, or use the Compiler for package generation. QUBO import preserves the expression; it does not add domain verification.

Open Quantum Problem Compiler

Check your understanding

Which family is supported by the Compiler without a dedicated Modeler?