NP Solvers
# π World's Fastest Quantum Optimization + AI Agent Control Two powerful capabilities in one API: ## 1. Quantum Optimization Solve NP-hard problems at unprecedented scale: - **QUBO**: 10,000 variables in 5ms - **Ising**: 10,000 spins in 1ms - **QAOA**: 50,000 qubits in 86ms - **VQE**: 50,000 qubits in 3.4ms ## 2. Q2E Agent Control (NEW) Governance layer for multi-agent AI systems: -β¦
NP Solvers endpoints
| Method | Endpoint | Description |
|---|---|---|
| POST |
solveSAT /v3turbo/solve/sat |
Solve Boolean satisfiability problems with 500+ variables using DPLL algorithm. |
| POST |
solvePortfolio /v3turbo/solve/portfolio |
Find optimal asset allocation given expected returns and covariance. Maximizes Sharpe ratio. |
| POST |
solveTSP /v3turbo/solve/tsp |
Solve the Traveling Salesman Problem for up to 200 cities. Uses quantum-inspired 2-opt + simulated annealing. Returns optimal route and cost. |
| POST |
solveMaxCut /v3turbo/qaoa/maxcut |
Find maximum edge cut in a graph using Quantum Approximate Optimization. Useful for clustering, network partitioning. |
| POST |
solveKnapsack /v3turbo/solve/knapsack |
Solve the 0/1 knapsack problem - maximize value within capacity constraint. Provably optimal for up to 50 items. |