Pilot
Regional LTL carrier · ~1,200 vehicles — 6.2% lower routing cost across 3,418 stops, every time-window and capacity constraint honored.
The hardest decisions in your business are complex for one reason: the problems beneath them are NP-hard. The QuGradient Quantum Optimizer solves them — six solver engines, eight industries, running on the infrastructure you already own.
Spun out of QuMatrix · backed by 350+ peer-reviewed papers and a decade of applied optimization.
See it work
Problem in, engine selected, solution benchmarked — in ninety seconds.
The opportunity
Routing a fleet, pairing a crew, dispatching a grid, rostering a hospital, constructing a portfolio, allocating spectrum — different vocabularies, the same NP-hard mathematics. Classical solvers return "good enough, eventually," and at enterprise scale the gap between good enough and optimal is worth tens of millions a year. QuGradient closes that gap with quantum optimization that holds up under your real constraints.
Pilot
Regional LTL carrier · ~1,200 vehicles — 6.2% lower routing cost across 3,418 stops, every time-window and capacity constraint honored.
One Optimizer
In what order, and along which path? Routing, vehicle routing, pickup-and-delivery, sequencing.
Who does what, and when? Job-shop scheduling, crew pairing, rostering, DAG workflows.
Where does everything go, and how much? Bin packing, facility location, dispatch, capacity planning.
Which subset do we pick? Portfolio construction, knapsack, feature selection, candidate screening.
What are the natural groups? Max-cut, graph partitioning, segmentation, anomaly isolation.
How is the network built, and who gets what? Graph colouring, spectrum assignment, topology design.
Why it's different
Six engines built against problem archetypes, not verticals. An airline pairing crews and a hospital rostering nurses are the same NP-hard problem in two vocabularies.
QUBO/Ising formulations, quantum annealing, variational circuits, quantum walks, and quantum-inspired evolutionary and swarm search.
HPC/SMP, GPU quantum simulators, quantum annealers, gate-based QPUs. Your execution target is a runtime setting, not an architectural commitment.
You supply data, objective and constraints in your own terms; QG-CORE classifies, formulates, selects the engine, and returns a solution benchmarked against your baseline.
Where it's applied
QG-ROUTE · QG-SCHED · QG-ALLOC
QG-ROUTE · QG-SCHED · QG-ALLOC
QG-GRAPH · QG-ROUTE · QG-SCHED
QG-SELECT · QG-CLUSTER · QG-ALLOC
QG-SCHED · QG-ALLOC · QG-GRAPH
QG-SCHED · QG-ALLOC · QG-ROUTE
QG-SELECT · QG-SCHED · QG-CLUSTER
QG-CLUSTER · QG-ROUTE · QG-SELECT
How it works
You provide the business problem, your data, objectives and constraints.
QG-CORE matches the problem against the archetype library.
It's compiled into canonical QUBO/Ising form.
The right engine, algorithm variant and backend are chosen and executed.
You receive a solution, benchmarked against your own baseline.
The platform
One orchestration engine powers all six solvers. Hybrid quantum-classical and quantum-inspired solvers, where they measurably win; classical methods where they don't. We don't claim a quantum computer is in the loop when it isn't.
Why now
QuGradient is the deployable form of QuMatrix's research: the algorithms are mature, the benchmarks are documented, and quantum optimization is proving its value in pilots today — ready to run against your real constraints, in any of eight industries.
Built on QuMatrix — 350+ papers and a decade of applied optimization across energy, logistics and beyond.
The research →QG-ROUTE and QG-SCHED are the most mature engines; every claim is tied to a benchmark on real data, labeled honestly.
QG-ROUTE →Bring a slice of your data and we benchmark the Optimizer against your current solver — then connect what wins to your operations.
See the research →Two ways to start
Bring a slice of your data and we'll show you the delta in a 30-minute call — the Optimizer benchmarked against the solver you run today.