pricing

Priced by the observable, not the qubit.

Width costs us nothing on these routes, so it costs you nothing: every tier takes 256 qubits per call. What a tier sells is the bundle budget — the largest observable a job may carry — and the credits a month includes. One credit per 10,000 words of the largest bundle, per observable; one to two credits per QEC point. A job that is refused or fails is not charged.

Free

$0

Run your own circuits. Enough bundle for a depth-4 random circuit at any width, or a 12-site quench. No card.

  • 60,000 words per bundle
  • 100 credits included
  • 64 qubits per call (abuse bound)
  • Certificates on every value
  • Citable records with permalinks
  • API keys, revocable

depth-4 brickwork at any width · TFIM 8–12 sites · d=5 coherent sweeps

Create an account

Verifier

$100/month

A group standing behind results, with the bundle budget for 24-site quenches and depth-5 brickwork.

  • 600,000 words per bundle
  • 25,000 credits included
  • 256 qubits per call (abuse bound)
  • Certificates on every value
  • Citable records with permalinks
  • API keys, revocable

TFIM to 24 sites · depth-5 brickwork at any width

Choose Verifier

Enterprise

Talk to us

Offline certified jobs above the single-request budget, d=7 coherent QEC, the fermionic chart at 200+ sites, and IV&V contracts.

  • 4,000,000 words per bundle
  • 1,000,000 credits included
  • 2,000 qubits per call (abuse bound)
  • Certificates on every value
  • Citable records with permalinks
  • API keys, revocable

TFIM to 100 sites certified · 200 sites exact (fermionic chart) · d=7 QEC

Contact sales

Tier changes take effect when the payment processor confirms them, never on request. The width-side verification route keeps its own per-run credit cost. Bundle sizes quoted for the "fits" lines are the measured sizes in record cq-front-2026-09-01.

other ways to work with us

When the console is not the product.

Certified jobs

Above the single-request budget — 100-site quenches, d=7 coherent QEC, 33-million-term transforms — run offline and return a signed record. Priced per job.

Verification engagements

We reproduce a vendor or hardware claim you are evaluating against analytic or certified ground truth, and deliver a record you can re-run yourself. Fixed scope, fixed price.

Toolchain licensing

The routes behind a compiler, transpiler or QEC product's own CI, under an OEM licence with a private deployment.

Research groups

Site licences for departments and labs, with citation terms so a certificate can appear in a paper.

Ask about an engagement

scope

What it does, and what it does not.

Stating the boundary next to the result is the point. In a field where every benchmark is self-reported, the vendor that publishes its own limits is the one worth checking.

In class

  • Exact expectation values and typed observables on structured circuits, at widths no state vector holds.
  • Local observables on deep circuits: exact through the light cone (depth 5 in a 1D brickwork), certified beyond it — the cost is set by depth, not width (measured n=12 to 1,000).
  • Condensed-matter quenches: certified observable transport (TFIM to 100 sites within 4e-7 of an MPS oracle) and exact matchgate dynamics in the fermionic chart (TFIM order parameter at 200 sites in 7.7 s).
  • QEC: code-capacity thresholds at any distance in O(n) per shot, and the exact coherent-error logical channel of the rotated surface code at d=3 and d=5.
  • Analytic ground truth a third party can check without trusting us.

Out of class

  • Full-distribution shot sampling. No counts are produced; `materialized_gate_count` is 0 by construction.
  • Scrambled circuits at depth of order the width: the observable fills the 4^n Pauli space (65,535 words at n=8, depth 14). That is the #P wall on the readout side, and no representation moves it.
  • Interacting spin models at long times (XXZ, Hubbard): the value is returned with its certificate, and past 24 sites the certificate stops certifying.
  • Any claim about hardware fidelity. This is a classical engine, not a QPU.