Examples
Runnable Python notebooks for every problem type and solver. Clone from GitHub or open in Colab.
10-city TSP with GPU Annealing
Generate a random distance matrix, submit to GPU annealing, stream results, visualize the best tour.
Portfolio optimization (mean-variance)
Markowitz mean-variance portfolio selection as a QUBO. Includes covariance estimation and risk constraint tuning.
MaxCut with QAOA (depth 4)
Formulate a 64-node MaxCut instance as a QUBO, solve with QAOA at circuit depth p=4, compare to GPU annealing.
Job shop scheduling (10 jobs × 5 machines)
Classic 10×5 job shop scheduling benchmark. Penalty method for precedence and machine constraints.
1000-city TSP with Hybrid Solver
Large-scale TSP using automatic domain decomposition. Demonstrates multi-pass Hybrid Solver on a TSPLIB instance.
CVRP with capacity constraints
Capacitated Vehicle Routing Problem with 50 customers, 5 vehicles. QUBO formulation with capacity penalty.
Custom QUBO from scratch
Build a QUBO matrix from scratch for a custom constraint satisfaction problem and benchmark across all solvers.
Real-time re-optimization (streaming)
Submit a TSP, read the WebSocket stream in real time, and update a live route visualization as the solver improves.
GPU-native quantum-inspired optimization for combinatorial problems at any scale.