Skip to main content
Glama

WAI Quantum job service

Server Details

A free quantum job service: OpenQASM 3 run, checked and signed, with no account or key.

If you are the author of this connector, you can claim ownership. Claimed connector authors can inspect health checks, view analytics, and manage their listing.
Status
Healthy
Uptime
81.8% over the last 24 hours
Last Tested
Transport
Streamable HTTP · MCP 2025-11-25
URL
ChatGPT
–
Claude
–

TDQS

B3.4/5.0

Scored across 37 tools

Disambiguation4/5

The tools mostly target clearly distinct resources and actions: run jobs, check programs, compile/convert, QEC operations, receipts, and resource planning. Close clusters such as check_quantum_program vs check_equivalent, optimize_qasm vs qaoa_maxcut/vqe_ground_state, and compile_qasm vs improve_qasm/repair_qasm require careful reading, but the descriptions generally clarify their boundaries.

Naming Consistency4/5

Nearly all names use consistent snake_case, with clear verb_noun forms such as run_quantum_circuit, verify_quantum_receipt, compile_qasm, and qec_decode. Minor deviations appear in algorithm- or domain-prefixed names like qaoa_maxcut, vqe_ground_state, pulse_schedule, and qec_code, but the convention is still predictable.

Tool Count2/5

With 37 tools, the surface is well past the practical 25-tool ceiling and feels heavy for an agent to navigate reliably. The broad quantum-service domain justifies many capabilities, but several specialized tools could likely be consolidated or discoverable through fewer entry points.

Completeness4/5

The surface covers a very wide lifecycle: execution, job retrieval, dry runs, verification/attestation, compilation, conversion, diagnostics, repair, optimization, QEC, pulse scheduling, resource estimation, and receipts. Minor gaps remain around job management operations such as listing or cancelling jobs, but core workflows are well covered.

Available Tools

37 tools
attest_quantum_jobAttest a job another host ranA
Read-onlyIdempotent
Inspect

Sign off a job another host sealed (the job service, a provider, another person's machine), after verifying it: its receipt and every rule of its form, any verdict or compile it seals worked out again, and, given a trust list and a time, its key held to them (the provider protocol's section 8.8). A job that is not valid is refused and nothing is sealed. Then what its answer must do (intent) is checked against it by the strongest layer the engine has, and the job's digest, the intent and the verdict are sealed with the service's key (wai.quantum.signoff/1). attested, beside the sign-off and outside its seal, says what the job was checked against. verify_quantum_result works the sign-off out again. Verifying the job and checking the intent are held to the service's bounds, and an attestation past them is refused with the local command (wai-quantum attest).

Inputs: job (required), at_ms, trust, intent, +1 more. Returns: A job another host sealed, attested (attest_quantum_job on either MCP server, w…

build_algorithmWrite the program for a standard algorithm, checked against its referenceA
Read-onlyIdempotent
Inspect

An OpenQASM 3 program for a standard algorithm, with how to read its result, what it gives, and the equivalence ladder's verdict on it against a reference matrix or truth table built from the definitions (check: exact on every basis state up to 8 qubits, the adder's up to 16; past that unchecked). qpe: the phase φ of p(2πφ) on counting qubits; amplitude_estimation: the amplitude a that A = ry(2·arcsin √a) gives the good state, by phase estimation of the Grover operator; adder: the ripple-carry adder of bits-bit integers in place (with a and b, prepared and measured); qsvt: quantum signal processing from phases, of a signal x or of a real symmetric 2 × 2 matrix through its block encoding (all phases zero give the Chebyshev polynomial). Sealed with the service's key. Run the program with run_quantum_circuit.

Inputs: algorithm (required), a, b, x, +7 more. Returns: An answer of the variational and algorithm library as every host gives it (engi…

check_equivalentCheck two quantum programs are the same circuitA
Read-only
Inspect

Whether two programs are the same circuit up to a global phase, and how the engine knows: Clifford circuits by their tableaus at any size, others on every basis state to 8 qubits, then by checked rewrites of one followed by the other's inverse to nothing (a proof at any width), then on random product states to 22 (evidence, not proof), otherwise unchecked with the reason. Its verdict is that decision; verification is the level it reached, as every tool's verdict states it. A check that would take long here is refused with the command that runs it locally.

Inputs: a (required), b (required). Returns: What check_equivalent answers.

check_quantum_programCheck a program against what it must doA
Read-onlyIdempotent
Inspect

One call for the inner loop: the program read (whether it reads, the reader's diagnostics with their lines and codes, its measures and smells); where the reader refuses it, the mechanical fixes the engine would make on the flagged lines and what needs a person; and given what it must do (intent, or a task with cases and constraints), each case run and graded passed, failed or unchecked by the strongest layer the engine has for its intent, with the verdict, its layer and that layer's limits, each constraint measured, what went wrong and where to look. next says what to do next. Nothing is sealed: when every case passes, grade_quantum_program seals the grade. Never call a program correct past what its verdict's level and layer say. Each case's intent is held to the service's bounds before it runs, and a case past them is refused with the local command (wai-quantum check).

Inputs: qasm (required), seed, task, shots, +2 more. Returns: A program checked against what it must do (check_quantum_program on either MCP…

classical_shortcutsFind a quantum program's classical shortcutsB
Read-only
Inspect

Every exact classical route to simulating a program, priced on it: the stabilizer tableau, the cut-rank sum, an exact matrix product state at a rigorous bond bound, the light cone of a one-qubit expectation value, and the state vector. The cheapest is named for each question. A cheap route proves the program classically easy; none being cheap proves nothing about hardness. A thorough search, with a contraction tree, runs locally: wai-quantum shortcuts --thorough.

Inputs: qasm (required). Returns: What classical_shortcuts answers.

compile_qasmCompile a quantum program, every pass checkedA
Read-only
Inspect

Compile an OpenQASM program through named passes (lowering, checked rewrites, phase folding, regions of CNOT and phase gates written again with fewer T gates, one- and two-qubit resynthesis, and every rotation off the multiples of π/4 written as a Clifford+T word within its share of the ε budget), each checked where it acts. With basis cz, zz or xx the program is written instead as one-qubit gates around a device basis's own two-qubit gate, each pair's block around at most three of it, nothing approximated, placed or routed. Returns the compiled program and a certificate sealed with the service's key: each pass's counts before and after, the digests of the circuit it was given and the circuit it gave (they chain from the program to the output), the layer its check stands on (stabilizer and exact_arithmetic are proofs, exact_simulation a comparison in doubles, bounded within a stated distance), its check and verdict (proof, exact or approximate with its distance), the budget and the bound the distances add to, and the layer of the strongest check the whole output passed. verify_quantum_receipt checks its receipt and compiles it again. Quote the bound; an approximate compile is not exact. A large or very fine compile is refused with the local command.

Inputs: qasm (required), dd, basis, level, +3 more. Returns: A compile sealed with the service's key, or why it was refused.

convert_programConvert a program between formatsA
Read-only
Inspect

Carry a program between OpenQASM 3, QIR (LLVM text, read under its base and adaptive profiles, written as QIR 2.0) and jeff (its Cap'n Proto message, as base64). The answer is the program written, the program as OpenQASM 3 (what every other tool takes), each note with its code (a rotation at an arbitrary angle, a custom gate read by its name, what a format leaves out), what was read and written, and the check: the output read back and held to the program by the equivalence ladder. A construct a reader cannot hold exactly is refused with its code (Q700 to Q721) and its place: quote the code, and never guess around it. A conversion larger than the service takes is refused with the command that runs it locally.

Inputs: to (required), from, check, profile, +2 more. Returns: What convert_program answers.

critique_qasmCritique a quantum programC
Read-only
Inspect

A program's measures, computed by the engine: gates by kind, two-qubit gates, depth and two-qubit depth, T count, whether it is a Clifford circuit, and a fidelity under reference error rates (a model, not a run). Also its smells, each with its lines: gates that cancel, rotations that merge or do nothing, idle qubits, and qubits acted on but never measured.

Inputs: qasm (required). Returns: What critique_qasm answers.

dry_run_quantum_jobPlan a quantum job or set without running itA
Read-only
Inspect

What the service would do with a job or a set, running nothing: the method and why, the memory, the estimated time and energy (each with its basis: this service's own timings and readings where it has them, otherwise the planner's nominal rate, and no energy figure without readings), the bounds that apply, where you stand against your limits, and whether the service would take it now, or the refusal it would give, with its code. Takes what run_quantum_circuit or run_quantum_set takes, and plans it as they run it, its verdict asked: what it says they take, they take. It counts as one submission.

Inputs: qasm, seed, noise, pulse, +16 more. Returns: What the service would do with a job or a set, running nothing: the plan's meth…

estimate_resourcesEstimate a quantum program's fault-tolerant resourcesA
Read-only
Inspect

What a fault-tolerant quantum computer would need to run a program. First its logical counts: T gates, Toffolis, rotations (each costed at the T count of its own synthesised Clifford+T word, within its share of the budget), measurements, T depth and total depth, and logical qubits with the ancillas that gates under several controls need. Then, on a physical qubit, the planar model's code distance (the gate-based surface code's model fitted to this engine's own decoders), T factories, physical qubits and runtime, and the frontier of estimates trading qubits for time. Takes a program, or a logical-counts or routine document. Every estimate is sealed in the resource-estimate receipt family, binding the program's digest and the ε budget; the answer's notes state the model's assumptions. Quote the figures with the qubit, the budget and the clock, and call them an estimate. Sealed with the service's key; verify_quantum_receipt checks the seals and re-runs it. A program with more than 256 distinct rotation angles, or a budget too fine for its rotations, is refused with the local command.

Inputs: name, qasm, clock, qubit, +6 more. Returns: A resource estimate as a host returns it (the command line's estimate --json, b…

get_quantum_jobRead a quantum jobB
Read-only
Inspect

A job's status, and its result when it is done. The service keeps every job across its restarts for its retention (a day on the public service); a job that was running when it stopped is run again once from its request (its interruptions say when), and stopped again it comes back interrupted, with the reason.

Inputs: id (required). Returns: A job, or a write's job (get_quantum_job reads either by its id).

grade_quantum_programGrade a program against a task's casesA
Read-onlyIdempotent
Inspect

Grade a program against a task (wai.quantum.grade/1, quantum-providers.md §8.10): each case run with its intent and graded passed, failed or unchecked, with the verdict that decided it and that verdict's layer and limits; each constraint measured; what went wrong with where to look; and whether the program passes. The grade is a job sealed with the service's key, the task and the program in its request, so anyone can run it again and get the same answer: verify_quantum_result works it out again. Quote each case's grade and layer; a case decided by evidence is not proved. Each case's intent is held to the service's bounds before any case runs, and a grade past them is refused with the local command (wai-quantum grade).

Inputs: grade (required). Returns: A grade as a host returns it: the request it was asked, and the result with its…

gradient_qasmThe exact gradient of a Hamiltonian's expectation by a program's parametersA
Read-onlyIdempotent
Inspect

The expectation E = ⟨ψ|H|ψ⟩ of a Hamiltonian at a program's parameters, and its gradient by each parameter, exactly: by adjoint differentiation or the parameter-shift rule on the double-precision state vector (at most 20 qubits, no noise, measurements only at the end). The reader follows each parameter into the gates, so an argument may be any expression of the built-in functions. The answer states its method, that it is f64 and approximate, and a bound on the rounding of the value and of each component (precision.rounding_bound). Sealed with the service's key. Quote the gradient with its bound.

Inputs: qasm (required), params (required), hamiltonian (required), gradient. Returns: An answer of the variational and algorithm library as every host gives it (engi…

improve_qasmImprove a quantum programC
Read-only
Inspect

The program with its smells fixed in its own text (all of them, and each alone), each candidate with its measures and the equivalence check's verdict against the program. A candidate the check finds different is never returned.

Inputs: qasm (required). Returns: What improve_qasm answers.

list_componentsList the engine's componentsA
Read-only
Inspect

Every component the service plans, runs, compiles and converts through: the simulation methods, the compiler passes, the noise channels and the program formats, each with its version, its origin and the BLAKE3 digest of its descriptor, which is the identity a result is sealed with. The service runs the built-ins alone and never loads a component from a request.

Inputs: no named parameters. Returns: Every component the engine plans, runs, compiles and converts through (engine::…

list_targetsList the device targetsB
Read-only
Inspect

The device targets the service knows by name: synthetic, made up in the shapes of published formats, each with its qubits, pairs, the gates a program compiles to, the spread of its T1 and readout errors, and its hash. A job may give its own target document instead.

Inputs: no named parameters. Returns: The device targets the service knows by name, all synthetic.

optimize_qasmMinimise a Hamiltonian's expectation over a program's parametersA
Read-onlyIdempotent
Inspect

Minimise E = ⟨ψ|H|ψ⟩ over a program's parameters from the given params, deterministically: gradient descent with a fixed step, Adam, or SPSA from a seeded stream (at most 2000 steps). Every step's parameters and value (and gradient, or SPSA's perturbation and estimate) are listed, each step a link of a digest chain from the request, best and final given; the same request gives the same bytes on every platform. Sealed with the service's key: the receipt binds the program, every step, the method and the seed, and verify_quantum_result (or wai-quantum verify) re-runs it. A minimum found is a minimum along this path, not a proof of the global one.

Inputs: qasm (required), params (required), hamiltonian (required), seed, +4 more. Returns: An answer of the variational and algorithm library as every host gives it (engi…

pulse_checkCheck a pulse run by running it againA
Read-onlyIdempotent
Inspect

Check a pulse job as a host returned it ({"request", "result"}, the result with its receipt): the receipt's signature, the program's digest against the request's text, and the request run again here with the result held to the one given field by field (the density matrix's digest among them), each difference named. A pulse run is the same bits on every platform, so a result that does not reproduce was not made from that request by this engine. Sealed with the service's key. Quote verified and the statement.

Inputs: result (required), request (required). Returns: A pulse answer as every host gives it (engine::pulse: pulse_schedule and pulse_…

pulse_scheduleRead a pulse program into its scheduleA
Read-onlyIdempotent
Inspect

Read a pulse program (OpenPulse calibrations: ports, frames, waveforms, play, delay, shift_phase, set_phase, shift_frequency, set_frequency, captures and barriers) into its schedule on frames: every instruction at its sample, each waveform's samples (gaussian, drag, gaussian_square, constant, sech, sine, or explicit), each gate call with the samples its calibration spans, and the digests a pulse run's receipt binds (the program, its calibrations, the schedule). Durations are whole samples of dt (pulse.dt_ns, default 0.5 ns) or refused. A construct the reader does not take is refused with a Q code and its line. Sealed with the service's key. To run it, give the program to run_quantum_circuit with method "pulse".

Inputs: qasm (required), pulse. Returns: A pulse answer as every host gives it (engine::pulse: pulse_schedule and pulse_…

qaoa_maxcutSolve Max-Cut on a graph by QAOAA
Read-onlyIdempotent
Inspect

Max-Cut by the quantum approximate optimisation algorithm: the program (|+⟩ⁿ, then for each layer rzz(gamma·w) on every edge and rx(2·beta) on every qubit) and its cost Hamiltonian built from the graph (at most 20 vertices, 16 layers), optimised as optimize_qasm does from the params or a linear ramp, and read against the maximum cut found by brute force: the expected cut and its ratio to the maximum, the likeliest assignment and whether it is optimal, and the probability of an optimal one. Sealed with the service's key.

Inputs: graph (required), seed, steps, layers, +4 more. Returns: An answer of the variational and algorithm library as every host gives it (engi…

qasm_diagnosticsThe reader's diagnostic codesB
Read-only
Inspect

Every code the OpenQASM reader gives (each refusal and warning carries one, as [Q103] at the end of its message): its outcome (refused, lowered, carried, preserved or warned) and its meaning; and beside them, under job_codes, the codes of what is asked of a program ([J011]: the request, the method, an intent, a repair, the host). A code never changes meaning once released. Give code for one of either.

Inputs: code. Returns: The reader's diagnostic codes, or one code's row; an unknown code is refused.

qec_codeShow an error-correcting code and certify its distanceA
Read-onlyIdempotent
Inspect

Show an error-correcting code and certify its distance: its checks (Z-type: they see X errors) and stabilizers (X-type), k counted by rank, a layout to draw it, the decoders it admits, and its distance certificate. In each sector the certificate gives the least weight of a logical found, a witness of that weight, and every lighter support ruled out by an exhaustive search over connected supports (a bivariate-bicycle code's translations checked as symmetries before use), re-checkable node for node. Give certificate to check one: its witnesses and the search run again. Sealed with the service's key. Quote the certificate's distance and its reading; a search stopped by bound settles nothing past it.

Inputs: code (required), bound, certify, certificate. Returns: An error-correction answer as every host gives it (engine::qec: qec_code, qec_d…

qec_decodeDecode a syndrome or a circuit's detectorsA
Read-onlyIdempotent
Inspect

Decode with the engine's decoders. At code capacity, give code and a syndrome (the violated checks) or an error (the flipped qubits: its syndrome is taken and its residual judged, logical or not): matching (exact) and union_find for codes whose qubits sit in at most two checks; color for colour codes (restriction to matching on the three restricted lattices, lifted at each colour, completed below half the distance by an exact search); relay_bp for any code (it can stall on a degenerate error of a topological code, and then says it did not converge); search for the lightest error with the syndrome up to max_weight. At circuit level, give memory ({distance, rounds, p}: the rotated surface-code memory experiment), circuit (the circuit text: tags, Pauli-target observables and coordinates read) or model (detector error model text, decompositions with ^ read), with the fired detectors (the prediction: which observables flipped) or shots (sampled and decoded: the failure rate and its standard error): matching (exact), correlated (exact matching twice through the model's decomposed faults, the second answer kept only when the model's mechanisms explain it more cheaply), union_find, bp_osd, or window (a sliding window: window {commit, buffer} rounds; every edge set below half the distance is corrected once the buffer is at least (d + 1)/2). Sealed with the service's key.

Inputs: code, seed, error, model, +8 more. Returns: An error-correction answer as every host gives it (engine::qec: qec_code, qec_d…

qec_thresholdMeasure logical failure rates over distancesA
Read-onlyIdempotent
Inspect

Measure logical failure rates over distances and physical error rates: family surface at circuit level (decoders matching, correlated or union_find; the code model P(d) = a·(p/p*)^((d+1)/2) per round fitted to the points), or color, toric or surface_capacity at code capacity. Each point gives its shots, failures, rate and standard error; below_threshold says, at each p, whether every larger distance failed less. Sealed with the service's key. Report rates with their errors: a crossing measured on few shots is not a threshold.

Inputs: p, seed, shots, family, +3 more. Returns: An error-correction answer as every host gives it (engine::qec: qec_code, qec_d…

quantum_circuit_examplesReady-to-run quantum examplesA
Read-only
Inspect

Worked examples, each a complete job (OpenQASM program and arguments) with what it shows: a Bell pair, a rotation, QAOA, noise, a 1000-qubit GHZ state, 100-qubit dynamics, 200 qubits as a matrix product state. Pass an example's job to run_quantum_circuit as it is, or adapt it.

Inputs: no named parameters. Returns: What quantum_circuit_examples answers.

quantum_service_infoWhat the quantum service can doB
Read-only
Inspect

The methods with their qubit limits and what each answers, the accuracy classes, the per-client limits, the current load, how jobs are kept and metered, the receipt keys, and the conventions (bit order, Pauli strings).

Inputs: no named parameters. Returns: What the service can do: its methods and their limits here, the accuracy classe…

repair_qasmRepair a quantum program on its flagged linesA
Read-only
Inspect

Repair a program the reader refuses, changing only the lines its diagnostics flag. The engine makes the fixes that are mechanical (a missing ;, an undeclared register's size, a measurement with no target, an unbounded while given the bound chosen, an angle the bit-exact method refuses rounded to the bits chosen with its rounding stated), and holds a fix you propose (proposed) to the flagged lines: any change to another line is rejected (J021) and nothing is changed. Returns the repaired program, each repair with its code and every line it changed, what needs a person with the reader's advice, and the verdict.

Inputs: qasm (required), rules, sizes, proposed, +3 more. Returns: A program repaired on the lines its diagnostics flag alone: the program as it n…

run_landscapeRun an energy-landscape jobA
Read-onlyIdempotent
Inspect

Run an energy-landscape job (wai.quantum.landscape/1): no circuit, but an energy over variables of three states (+, - and 0, where 0 is left out at its own cost), written in epuML, and a state of low energy found by the settling model's reference kernels, a classical emulator, in software. The answer gives the state, its exact energy, every arrangement checked where the program has at most 16 variables (truth, reached), the program's own checks, a verdict (solved, missed, failed or unchecked) with its reason, the work counted, the joules priced at rates measured elsewhere (never metered: say priced), and a replay digest anyone can reproduce. Sealed with the service's key; verify_quantum_receipt checks it, its form included (quantum-landscape §5.4). With "protocol": "wai.quantum.landscape/2" in the request it runs the second version (a cost for each variable, of either sign, and the constraints exactly and atmost, so colouring and assignment run): its joules are priced at temperature 0 only, and a sampling run's are stated unpriced, with why and no figure. Nothing here is a quantum effect. Quote the verdict and the numbers; a program refused is refused with its line.

Inputs: op (required), request (required). Returns: An energy-landscape answer as every host gives it (quantum_landscape; wai-quant…

run_on_targetRun a program as a device wouldAInspect

Run an OpenQASM program as it would run on a device target: compiled exactly to its gates, placed on its most reliable qubits and routes (the expected success given), checked against the circuit, and simulated under the noise its calibration gives, on the density matrix or by trajectories. Counts and expectation values with their distance from the ideal distribution, the noise derived, and a receipt that binds the target's hash. A model of the device, not a run on it. Every angle must be a dyadic multiple of 2π. Waits up to 50 s, as run_quantum_circuit does, and like it, each call is a new job unless it gives idempotency_key.

Inputs: target (required), qasm, seed, noise, +14 more. Returns: A job: queued, running, done with its result and receipt, or failed with its er…

run_quantum_circuitRun a quantum circuitAInspect

Run an OpenQASM program and return measurement counts, Pauli expectation values and/or amplitudes. The service chooses the method (bit-exact or double-precision state vector up to 32 qubits, single precision on a GPU to 33, stabilizer tableau for Clifford circuits up to 32768 qubits, matrix product states up to 4096, sparse Pauli dynamics for expectation values up to 1024 with an error bound, an exact density matrix or trajectories for noise), reports why and how accurate, and signs the result. Give intent (an exact distribution, or a reference program it must equal or whose state it must prepare) and the engine checks it with the run. Every answer carries verdict: the level the engine checked to (proof, evidence, executed, parsed, refused), whether the intent holds and a plain statement, sealed in the receipt. Waits up to 50 s; a longer job answers with status running and an id for get_quantum_job. Each call is a new job unless it gives idempotency_key, which makes sending it again safe.

Inputs: qasm, seed, noise, pulse, +15 more. Returns: A job: queued, running, done with its result and receipt, or failed with its er…

run_quantum_setRun a set of quantum programs, or one over a gridAInspect

Run several OpenQASM programs as one set (programs: each a program's text or a job), or one program over a grid of its inputs (qasm with sweep, as {"theta": [0.1, 0.2], "n": [2, 3]}: every combination; integer inputs written out, float and angle inputs bound to the double given). The set's other fields (shots, observables, seed, intent, …) apply to every item. Each item gets its own result and receipt, each stating its verdict, and one receipt over the set binds every item through a Merkle root; verify_quantum_receipt checks it whole. At most 100 items, run one after another in one job. Waits up to 50 s; a longer set answers with status running and an id for get_quantum_job. Each call is a new job unless it gives idempotency_key, which makes sending it again safe.

Inputs: qasm, seed, noise, pulse, +15 more. Returns: A job: queued, running, done with its result and receipt, or failed with its er…

run_quditRun a qudit jobA
Read-onlyIdempotent
Inspect

Run a qudit job (wai.quantum.qudit/1, quantum-sim.md §9): a register of qudits of dimension 2, 3, 4 or 6, a program of shift, clock, fourier, csum and phase gates run on it from |0…0⟩ in whole numbers at 2^-30, and the register measured with a seed. The answer gives the counts keyed by the qudits' digits (highest qudit first), the amplitudes asked for as integers, the state's BLAKE3 and norm, the digest of the constants its dimension reads, the work, and the accuracy: bit-exact, the same integers on every host, with a bound on the state's distance from the ideal and on the outcomes' total variation. Sealed with the service's key; verify_quantum_receipt checks the seal, and anyone can run the request again for the same bits. A request past a bound is refused before anything runs (J090, J091, J092).

Inputs: d (required), gates (required), qudits (required), seed, +3 more. Returns: A wasmQ envelope's or a qudit job's job (run_wasmq, run_qudit; POST /v1/wasmq,…

run_wasmqRun a wasmQ envelopeA
Read-onlyIdempotent
Inspect

Run a wasmQ envelope (wai.quantum.wasmq/1 or /2, extensions/quantum-wasmq.md): an OpenQASM 3 program and the WebAssembly modules its externs call between gates, in one content-addressed envelope. The quantum part is simulated here (the stabilizer tableau, or the second version's whole-number state vector for t, Toffoli and dyadic angles), each callout a metered call of its module; the run is the same bytes on every host and engine. The job gives the counts, the calls and the fuel each used, the modules' digests, the digest of every call, and the fault that stopped the run if one did (a fault is sealed, not an error). A second-version run's energy is what the service read of the worker that ran it: the process's CPU energy on macOS, the processor packages' over its window on Linux, or the unmetered form with the reason where the host reads none, never zero; the first version states only that it is unmetered. The run is a job: past the answer's wait its id comes back to poll with get_quantum_job, and an envelope past what the service takes is refused, naming the local command. Sealed with the service's key; verify_quantum_receipt holds the job to the profile's form (section 6.5). Give the envelope as base64, or name an example; an envelope the profile refuses is refused with its code (W001 to W017).

Inputs: example, envelope_base64. Returns: A wasmQ envelope's or a qudit job's job (run_wasmq, run_qudit; POST /v1/wasmq,…

show_targetShow a device targetB
Read-only
Inspect

A device target's qubits, pairs, native gates with the spread of their errors and durations, its calibration snapshot and its hash; with view, each qubit's place for drawing its coupling map with its readout and one-qubit errors, and each pair's two-qubit error. Give a built-in target's name or a target document.

Inputs: target (required), view. Returns: A device target in brief: its name and hash, where it came from, its calibratio…

verify_quantum_receiptVerify a result's receiptB
Read-only
Inspect

Whether a result's receipt (an Ed25519 signature) seals exactly that request and that result, and every rule of its form holds (reasons names what does not). Pass the job's own request (as run_quantum_circuit or get_quantum_job returns it: a run here asks for its verdict, so the request it seals says so) and its result.

Inputs: job, method, result, status, +1 more. Returns: Whether a result's receipt seals exactly that request and that result, and the…

vqe_ground_stateFind a Hamiltonian's ground energy by the variational eigensolverA
Read-onlyIdempotent
Inspect

The variational eigensolver: an ansatz (the program given as qasm with params, or ansatz {"layers": L}: layers of ry and rz on every qubit and a ring of cx, its parameters t0, t1, … from 0.1) optimised on the Hamiltonian as optimize_qasm does. At most 8 qubits the answer sets the energy found beside the exact ground energy by diagonalisation (reference.ground_energy and gap); the energy found is never below it. Sealed with the service's key. Report the gap: an ansatz that cannot reach the ground state stops above it.

Inputs: hamiltonian (required), qasm, seed, steps, +5 more. Returns: An answer of the variational and algorithm library as every host gives it (engi…

write_circuitWrite a quantum program for a taskAInspect

Have the service's own model write an OpenQASM 3 program for a task, the engine checking each attempt against what the task asks exactly as it checks a lesson's answer, and what went wrong going back to the model for another attempt, up to rounds repairs. The task is an exercise in the course's form (wai.quantum.exercise/1): a title and task in words, an optional starter program, and what the program must do, as an intent (an exact distribution, a reference program it must equal or whose state it must prepare) or cases that each have one, with optional constraints (gates allowed, counts, T count, smells), at most 16 cases and 8 intents in one place, its canonical form at most 64 KiB. The answer is a job whose result is the transcript (wai.quantum.write/1): the model by name, licence and the digest of its files, every byte checked, and the arithmetic it ran in, the prompt, each attempt's program and the engine's check, and whether one passed and at what level, signed (verify_quantum_receipt checks it with the job's request). Decoding is greedy, so the same task gives the same transcript in the same arithmetic (architecture, operating system, maths library, matmul kernel). Writes take minutes and run one at a time; a client holds one queued or running write. Call it as a task, or it waits 50 s and answers with status running and an id for get_quantum_job. A service without a model refuses it (J080); quantum_service_info says under write whether this one has one. Each call is a new write unless it gives idempotency_key.

Inputs: task (required), rounds, max_new, idempotency_key. Returns: A write's job (POST /v1/write, write_circuit): queued; running, with the attemp…

Tool Schema Changelog

Recent tool additions, removals, and schema changes observed during successful MCP inspections.

Loading tool schema changelog…

    Related MCP Connectors

    Related MCP Servers

    • F
      license
      Not graded
      quality
      D
      maintenance
      Enables AI models to invoke SpinQ's quantum computing hardware resources by creating and submitting quantum circuits (QASM) to the SpinQ cloud platform for execution and results retrieval.
      1
      -
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables users to simulate quantum circuits, evolve qubit state vectors, apply gates such as Hadamard and CNOT, perform Born-rule projective measurements with Monte Carlo shot histograms, and run Grover amplitude amplification through MCP-compatible clients.
      7
      MIT
    Try in Browser

    Glama MCP Gateway

    Add one secure layer between your agents and this server.

    Resources