Charged only when your result is delivered · No account required · Signed result certificates
Choose a worker, set its parameters and enter your email. Your card is authorised at checkout and charged only when the worker delivers; if it fails, you pay nothing. No subscription or account setup required. Every result is signed (Ed25519) and says where each number came from; quantum results include the IBM run ID.
Pick a worker to see what it needs and what it costs. Each one runs once on the hardware or machines described, and you collect the result.
Some questions about networks and portfolios grow too fast for ordinary computers to check exhaustively. Each worker below runs a small circuit on a real superconducting quantum processor and returns what the hardware measured, along with its run ID. These are small-scale experiments on noisy machines, so they are for learning, benchmarking and research, and they are not faster than a laptop today.
Routing, scheduling and graph problems solved with classical heuristics on instances generated from your settings, so you can compare methods on the same problem.
The problem: Picking the best subset from a list of assets is a combinatorial search. For up to 12 assets it can be checked thoroughly.
Combinatorial portfolio search run over asset combinations up to 12 assets. Returns evaluated combinations and variance.
$25.00 per workerThe problem: Delivery vehicles have limited capacity and customers want specific time windows. Routes that ignore either one fail in practice.
Routes a fleet of capacity-limited vehicles across stops with delivery windows. Evaluates distance, time windows, and fuel.
$39.00 per workerThe problem: Planning routes for several vehicles across many stops gets complicated quickly, and each added stop multiplies the options.
Multi-vehicle route optimization over a set of stops using simulated bifurcation.
$9.00 per workerThe problem: Splitting a network into two groups that cut the most links is a hard search problem with uses in layout and clustering.
Finds a large cut in a random graph using simulated bifurcation. Returns the cut value and the partition.
$9.00 per workerThe problem: Different solvers give different answers to the same hard problem. This runs the same graph problem with simulated annealing so you can compare.
The same graph problem solved with simulated annealing, for comparison with the bifurcation solver.
$9.00 per workerThe problem: A longer, slower search can find better answers to hard graph problems than a quick one.
The graph problem solved with a longer analog-style bifurcation run for a more thorough search.
$9.00 per workerEach worker page explains the problem, what you get, its rules and limits, and the exact price for your settings.
Stripe holds the amount on your card. Nothing is charged yet.
When the worker delivers, the hold becomes a charge and the result appears in My Workers with its signature. If it fails, the hold is released.
Questions about workers, billing, or access: support@linus-ai.com