science.transaction.wai/quantum-jobs
up checked
Unclaimed · Unverified
Agent searches it appeared in, last 30 days: 0. Run this server? Claim the listing: verified label, uptime alerts and analytics.
Publisher-provided title
WAI Quantum job service
Publisher-provided description
A free quantum job service: OpenQASM 3 run, checked and signed, with no account or key.
Summary by lookupd
Lets agents run, compile, verify and cost OpenQASM quantum circuits, with signed results and no account or API key needed.
Install
Claude Code, remote (streamable-http)
claude mcp add --transport http quantum-jobs https://wai.transaction.science/quantum-jobs/mcp
Codex, remote (streamable-http)
codex mcp add quantum-jobs --url https://wai.transaction.science/quantum-jobs/mcp
Cursor, remote (streamable-http) → .cursor/mcp.json
{
"mcpServers": {
"quantum-jobs": {
"url": "https://wai.transaction.science/quantum-jobs/mcp"
}
}
}Other clients: docs. Or tell your agent: Set up lookupd for me: read https://lookupd.com/agent.md and follow it.
Tools (showing 30 of 32)
Publisher-provided text
run_quantum_circuitRun an OpenQASM program and return measurement counts, Pauli expectation values and/or amplitudes. The service chooses the method (bit-exact or double-precisionrun_quantum_setRun 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 {"thetadry_run_quantum_jobWhat 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 serviceget_quantum_jobA 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 wasverify_quantum_receiptWhether 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).critique_qasmA 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 fidelicheck_equivalentWhether 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 basisconvert_programCarry 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)improve_qasmThe 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 thclassical_shortcutsEvery 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 bocompile_qasmCompile an OpenQASM program through named passes (lowering, checked rewrites, phase folding, one- and two-qubit resynthesis, and every rotation off the multipleestimate_resourcesWhat 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 owrepair_qasmRepair a program the reader refuses, changing only the lines its diagnostics flag. The engine makes the fixes that are mechanical (a missing `;`, an undeclaredquantum_service_infoThe 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 recqasm_diagnosticsEvery code the OpenQASM reader gives (each refusal and warning carries one, as `[Q103]` at the end of its message): its outcome (refused, lowered, carried, preslist_componentsEvery component the service plans, runs, compiles and converts through: the simulation methods, the compiler passes, the noise channels and the program formats,list_targetsThe 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 tshow_targetA 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 placrun_on_targetRun 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 gquantum_circuit_examplesWorked 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-qubiqec_codeShow 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,qec_decodeDecode 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 takenqec_thresholdMeasure logical failure rates over distances and physical error rates: family surface at circuit level (decoders matching, correlated or union_find; the code mopulse_scheduleRead a pulse program (OpenPulse calibrations: ports, frames, waveforms, play, delay, shift_phase, set_phase, shift_frequency, set_frequency, captures and barriepulse_checkCheck 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'gradient_qasmThe expectation E = ⟨ψ|H|ψ⟩ of a Hamiltonian at a program's parameters, and its gradient by each parameter, exactly: by adjoint differentiation or the parameteroptimize_qasmMinimise E = ⟨ψ|H|ψ⟩ over a program's parameters from the given params, deterministically: gradient descent with a fixed step, Adam, or SPSA from a seeded streavqe_ground_stateThe 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, itsqaoa_maxcutMax-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) andbuild_algorithmAn 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 matri
Details
- Version: 0.2.2
- Transports: streamable-http
- Uptime (7 days): 100%
- Median latency: 4418 ms
- First indexed:
- Last seen in registry:
- Website: https://wai.transaction.science/quantum-run/
Badge for your README
Shows this live status and links here; updates hourly.
[](https://lookupd.com/servers/science.transaction.wai/quantum-jobs)
- 62930 servers
- Last crawl: 2026-11-13T00:17:28.001Z
- API base:
https://api.lookupd.com - MCP URL:
https://api.lookupd.com/mcp