{"id":"science.transaction.wai/quantum-jobs","slug":"science-transaction-wai-quantum-jobs","title":"WAI Quantum job service","description":"A free quantum job service: OpenQASM 3 run, checked and signed, with no account or key.","version":"0.2.2","publisher":{"kind":"domain","id":"wai.transaction.science","label":"wai.transaction.science","url":"https://wai.transaction.science"},"website":"https://wai.transaction.science/quantum-run/","repository":"","remotes":[{"type":"streamable-http","url":"https://wai.transaction.science/quantum-jobs/mcp"}],"packages":[],"published":"2026-11-05","updated":"2026-11-05","status":"online","auth":"","latency_ms":1490,"checked":"2026-11-19","uptime":67,"checks":3,"tools":[{"name":"run_quantum_circuit","title":"Run a quantum circuit","description":"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 e","read_only":false},{"name":"run_quantum_set","title":"Run a set of quantum programs, or one over a grid","description":"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 a","read_only":false},{"name":"dry_run_quantum_job","title":"Plan a quantum job or set without running it","description":"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 refus","read_only":true},{"name":"get_quantum_job","title":"Read a quantum job","description":"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.","read_only":true},{"name":"verify_quantum_receipt","title":"Verify a result's receipt","description":"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.","read_only":true},{"name":"critique_qasm","title":"Critique a quantum program","description":"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.","read_only":true},{"name":"check_equivalent","title":"Check two quantum programs are the same circuit","description":"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 dec","read_only":true},{"name":"convert_program","title":"Convert a program between formats","description":"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, a","read_only":true},{"name":"improve_qasm","title":"Improve a quantum program","description":"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.","read_only":true},{"name":"classical_shortcuts","title":"Find a quantum program's classical shortcuts","description":"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 ","read_only":true},{"name":"compile_qasm","title":"Compile a quantum program, every pass checked","description":"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","read_only":true},{"name":"estimate_resources","title":"Estimate a quantum program's fault-tolerant resources","description":"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 ","read_only":true},{"name":"repair_qasm","title":"Repair a quantum program on its flagged lines","description":"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 li","read_only":true},{"name":"quantum_service_info","title":"What the quantum service can do","description":"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).","read_only":true},{"name":"qasm_diagnostics","title":"The reader's diagnostic codes","description":"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 ","read_only":true},{"name":"list_components","title":"List the engine's components","description":"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.","read_only":true},{"name":"list_targets","title":"List the device targets","description":"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.","read_only":true},{"name":"show_target","title":"Show a device target","description":"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.","read_only":true},{"name":"run_on_target","title":"Run a program as a device would","description":"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 recei","read_only":false},{"name":"quantum_circuit_examples","title":"Ready-to-run quantum examples","description":"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.","read_only":true},{"name":"qec_code","title":"Show an error-correcting code and certify its distance","description":"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 (","read_only":true},{"name":"qec_decode","title":"Decode a syndrome or a circuit's detectors","description":"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 ","read_only":true},{"name":"qec_threshold","title":"Measure logical failure rates over distances","description":"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 distan","read_only":true},{"name":"pulse_schedule","title":"Read a pulse program into its schedule","description":"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 r","read_only":true},{"name":"pulse_check","title":"Check a pulse run by running it again","description":"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","read_only":true},{"name":"gradient_qasm","title":"The exact gradient of a Hamiltonian's expectation by a program's parameters","description":"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 state","read_only":true},{"name":"optimize_qasm","title":"Minimise a Hamiltonian's expectation over a program's parameters","description":"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 ev","read_only":true},{"name":"vqe_ground_state","title":"Find a Hamiltonian's ground energy by the variational eigensolver","description":"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 n","read_only":true},{"name":"qaoa_maxcut","title":"Solve Max-Cut on a graph by QAOA","description":"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 maxim","read_only":true},{"name":"build_algorithm","title":"Write the program for a standard algorithm, checked against its reference","description":"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·ar","read_only":true},{"name":"run_landscape","title":"Run an energy-landscape job","description":"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 vari","read_only":true},{"name":"run_qudit","title":"Run a qudit job","description":"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 ","read_only":true},{"name":"run_wasmq","title":"Run a wasmQ envelope","description":"Run a wasmQ envelope (wai.quantum.wasmq/1 or /2, extensions/quantum-wasmq.md): an OpenQASM 3 program and the WebAssembly modules its `extern`s 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","read_only":true},{"name":"check_quantum_program","title":"Check a program against what it must do","description":"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 ","read_only":true},{"name":"grade_quantum_program","title":"Grade a program against a task's cases","description":"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 re","read_only":true},{"name":"attest_quantum_job","title":"Attest a job another host ran","description":"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 c","read_only":true},{"name":"write_circuit","title":"Write a quantum program for a task","description":"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 pr","read_only":false}],"server_info":{"name":"wai-quantum","title":"WAI quantum service","version":"0.2.5"},"category":"hr","tags":["design","developer"],"kind":"remote","source":"registry","submitted":{},"first_party":true,"domain_rank":545728,"score":100,"indexable":true,"first_seen":"2026-10-29","stars":0,"badges":["official","new"],"sponsor":null,"page":"https://agentsindex.org/agents/science-transaction-wai-quantum-jobs/"}