MCP server that wraps the Dagster GraphQL API — manage runs, assets, schedules, sensors, and backfills from any MCP client
Nothing to run from here
Quantum Expectations is installed from its publisher's own source and answers where it runs, so this marketplace is not in the path of a single call. There is no address here to send one to, and a panel that pretended otherwise would be showing you an answer we made up. Install it and call it from your own client — the Installation tab has the entry for each one.
13
tools declared
—
trust score
remote
at its publisher
—
calls last 7d
What it does
Quantum error-correction feasibility: success probability, qubit overhead, records, trends.
Quickstart
# 1 — add it to Claude Code
claude mcp add --scope user --transport http quantum-expectations-mcp https://www.quantum-expectations.com/api/mcp
# 2 — ask your agent for something these tools do
# compute_expectation, compute_required_error_rate, compute_fault_tolerant_resources and 10 more
Quantum Expectations costs nothing on mcprush: there is no plan to choose here, no cap to set and nothing mcprush can bill you for.
Publishernot claimed
QEAll 1 server
quantum-expectations1 server
1 category
Collected from a public index. Nobody has claimed this account, so nothing here was written by its author — claim it if it is yours.
Installation
Where are you running it?
Every route below installs the same thing and ends at the same approval screen. Nothing here runs on your machine and nothing runs on ours: this server answers at its publisher’s own address, and what you install is the connection straight to it.
Claude Codedeclared by this listing
This is a public server: it answers at its publisher’s own address and this marketplace is not in the path. Claude Code registers it in one command; --scope user makes it available in every project. The transport below is http, as the publisher's own manifest declares it.
claude mcp add --scope user --transport http quantum-expectations-mcp https://www.quantum-expectations.com/api/mcpReconnect, or start a new session, and the tools appear in the model’s tool list.
Free on mcprush, and it answers at its publisher’s own address: this marketplace is not in the path, so there is no key of ours to hold and no card to add.
What it writes
One config entry pointing straight at the publisher’s own address — this marketplace is not in the path, and nothing from this listing executes on your machine.
What you approve
13 tools, with what each one reads, writes and reaches shown before you agree — the same list on every route above. Read the tool surface.
Tool surface
What the model actually sees. Descriptions are diffed on every release — see version history.
Given a quantum circuit (2-qubit error rate p, qubit count n, depth d, optional connectivity class), compute the effective error rate, success probability, and optional surface-code or qLDPC overhead. Without error correction a 2d-lattice connectivity is charged as a routing multiplier on depth (result.routingOverheadFactor); hardwareId supplies the device's class automatically. The response is se
| Parameter | Type | Required | Notes |
|---|---|---|---|
| qubitErrorRate | number | no | Per-gate 2-qubit error rate p, in (0, 0.1]. Supply exactly one of qubitErrorRate or hardwareId. |
| hardwareId | string | no | Alias for qubitErrorRate: resolves to the 2-qubit error rate of the given SOTA hardware entry from list_current_quantum_computers. Supply exactly one of qubitErrorRate or hardwareId. |
| connectivity | string | no | Two-qubit connectivity of the device: "all-to-all" (ion transport), "reconfigurable" (atom shuttling, treated as all-to-all) or "2d-lattice" (fixed nearest-neighbour couplers, charged as a routing mul |
| numQubits | integer | yes | — |
| compDepth | integer | yes | — |
| useErrorCorrection | boolean | no | — |
| errorCorrectionCode | string | no | Either "surface" (default when useErrorCorrection=true) or a qLDPC code id from list_qldpc_codes. "surface-code" is accepted as an alias for "surface". |
| distanceSurfaceCode | number | no | Surface code distance: odd integer in [3, 31]. Required when useErrorCorrection=true and the surface code is selected; ignored when a qLDPC code is selected. |
| verbose | boolean | no | When false, omits hardwareContext, formulas, assumptions, caveats, glossary, examples, and exampleProblems from the response — leaving only modelVersion, scenario, and result. Use for parameter sweeps |
Inverse of compute_expectation. Given a circuit (numQubits, compDepth) and an acceptable effective error rate, return the required per-gate logical error rate (requiredLogicalErrorRatePerGate: a number, or null only when the target is genuinely unreachable; never 0) and, for every EC option (no-EC, surface-code per distance, every qLDPC code), the required physical error rate plus the subset of cu
| Parameter | Type | Required | Notes |
|---|---|---|---|
| numQubits | integer | yes | Number of logical qubits n in the circuit. |
| compDepth | integer | yes | Circuit depth d (sequential 2-qubit gate layers). Accepts values up to 1e13. |
| acceptableErrorRatePercent | number | yes | Upper bound on the effective error rate, as a percent. Default website convention is 33 (i.e. ≤33% effective error is "acceptable"). |
Given an algorithm stated as (numLogicalQubits, tCount) and a physical error rate (or hardwareId), derive the full surface-code + magic-state-distillation footprint from the general laws of the Litinski lattice-surgery cost model (no per-scenario constants): distillation factory choice, tile layout, required code distance, total physical qubits, and wall-clock time. Results are reported under TWO
| Parameter | Type | Required | Notes |
|---|---|---|---|
| numLogicalQubits | integer | yes | Number of logical data qubits the algorithm needs. |
| tCount | integer | yes | Total number of T gates (magic states consumed). Convention: state Toffoli-counted algorithms in T gates before calling (1 Toffoli ≈ 4–7 T depending on decomposition). |
| qubitErrorRate | number | no | Physical 2-qubit error rate p in (0, 0.1]. Supply exactly one of qubitErrorRate or hardwareId. |
| hardwareId | string | no | Alias for qubitErrorRate: resolves to the error rate of a SOTA hardware entry. |
| targetSuccessProbability | number | no | Target end-to-end success probability. The failure budget (1 − target) is split evenly between T-state error and logical (memory/surgery) error, matching Litinski §4. |
| dataBlock | string | no | Data-block layout (Litinski §2): compact = fewest qubits, fast = shortest time per T gate. |
| cycleTimeSeconds | number | no | Surface-code cycle time in seconds. Default 1 µs (Litinski convention; Google 2024 measured 1.1 µs on superconducting hardware). Trapped-ion/neutral-atom cycles are orders of magnitude slower. |
Run the same circuit against multiple current SOTA hardware entries in one call so an agent can rank platforms without N sequential compute_expectation calls. Defaults to every entry in list_current_quantum_computers when hardwareIds is omitted.
| Parameter | Type | Required | Notes |
|---|---|---|---|
| numQubits | integer | yes | — |
| compDepth | integer | yes | — |
| useErrorCorrection | boolean | no | — |
| errorCorrectionCode | string | no | Either "surface" (default when useErrorCorrection=true) or a qLDPC code id. "surface-code" is accepted as an alias for "surface". |
| distanceSurfaceCode | number | no | Surface code distance: odd integer in [3, 31]. Required when useErrorCorrection=true and the surface code is selected; ignored when a qLDPC code is selected. |
| hardwareIds | array | no | Subset of QUANTUM_COMPUTERS ids to compare. Omit to compare every entry. |
Return the representative-entry table of current SOTA quantum computers (id, hardware type, physical qubit count, 2-qubit error rate, connectivity class with a note on the coupling graph, source URL). Same data that powers the website's "Current Quantum Computers" table. For the model's capability prediction per entry in QUOPS units, read hardwareContext.currentQuantumComputers[].modelCapability f
No parameter schema on file.
Return the measured QUOPS capability scores (arXiv:2609.12146): per device, the largest random universal circuit size executed at polarization >= 1/sqrt(e) inside the cone w^2 <= s <= w^3, with width, QUOPS rate, architecture (physical, physical-postselected, logical) and source URL, plus the utility-scale targets in the same unit (RSA-2048 and FeMoco). These are measurements, the yardstick the si
No parameter schema on file.
Return per-platform gate-cycle timings (2Q gate time, readout time, in SI seconds) plus the testbed they were measured on (representativeDevice) and the native 2Q gate name, with source URLs. Joins list_current_quantum_computers via hardwareType, but the numbers are BEST-CASE DEMONSTRATIONS from small testbeds, not measurements on the joined devices, which run their gates and array readout ord
No parameter schema on file.
Compute the Quantum Volume Rate (QV/second): QVR = V_Q / (log2(V_Q) * t_2Q + t_meas). First-order estimate of how fast a device prepares one QV-sized square circuit (one native 2Q gate per QV layer + one end-of-circuit measurement). OVERSTATES achievable rate: real compilation inflates the 2Q-gate count per layer; omits reset/SPAM, mid-circuit measurement, and classical-control latency. For a prod
| Parameter | Type | Required | Notes |
|---|---|---|---|
| quantumVolume | integer | yes | Quantum volume V_Q (integer ≥ 2, e.g. 64 for a depth-log2=6 square circuit). |
| t2QSeconds | number | yes | Native 2-qubit gate time in seconds (e.g. 60e-9 for a 60 ns CZ). |
| tMeasurementSeconds | number | yes | End-of-circuit measurement/readout time in seconds (e.g. 5e-3 for 5 ms). |
Fit a log-linear trend (ln(value) = slope * year + intercept) to one historic series — fidelity or qubit-count — for one hardware type. Atomic primitive: compose with list_current_quantum_computers, compute_required_error_rate, or your own modelling to answer "when might hardware reach X?". residualStdDev is the BIASED (maximum-likelihood) RMS — divides by n, not (n - 2); on small series (n ≈ 3–5)
| Parameter | Type | Required | Notes |
|---|---|---|---|
| seriesType | string | yes | Which historic series to fit: "fidelity" (2-qubit gate error rate) or "qubit-count" (physical qubits). |
| hardwareType | string | yes | Hardware platform as used by get_historic_series. |
| targetValue | number | no | Optional. When supplied, the response includes yearAtTargetValue — the extrapolated year the fit crosses this value (error rate for fidelity series, qubit count for qubit-count series). Null if slope |
Return the curated list of example quantum algorithms with published resource estimates (qubit count, depth/gate count, source paper URL). Useful for comparing what algorithms need vs. what hardware can deliver. Each entry carries a provenance field: 'published-circuit' means the figure is reproducible from the source, 'attested-estimate' means the source withholds the circuit and the figure res
No parameter schema on file.
Return the catalog of supported qLDPC codes (id, label, family, n, k, d, circuitLevelDistance, ancilla counts, roundsPerLogicalOp, threshold, fitCoefficients {c0, c1, c2}, logicalErrorExponent [alpha = d_circ/2], source URLs, provenance, caveats). The per-block, per-syndrome-cycle logical error rate is p^alpha * exp(c0 + c1*p + c2*p^2) for p <= threshold (the source paper's own fitting form; c1 =
No parameter schema on file.
Return the full historic time series — either two-qubit gate error rates ("fidelity") or physical qubit counts ("qubit-count") — broken down by hardware type. Each datapoint carries a source URL. Use this to extrapolate trends — "when might hardware reach X?" — or pair with fit_historic_series for a log-linear fit on one hardware type.
| Parameter | Type | Required | Notes |
|---|---|---|---|
| seriesType | string | yes | "fidelity" → 2-qubit gate error rates; "qubit-count" → physical qubit counts. |
Return the plain-text site brief describing scope, assumptions, the honesty clause, and the API contract. Mirrors the /agent.txt document served by the website.
No parameter schema on file.
Free
$0 forever
- Every tool — any call limit is its publisher’s, not ours
- No card, and mcprush charges nothing for it
- Runs at its publisher’s own address — this marketplace is not in the path
- Nothing to cap, because mcprush bills nothing
What counts against your monthly calls
| Tool | Unit | Calls used | Out of the allowance |
|---|
Nothing here is billable: mcprush charges nothing to install Quantum Expectations or to call it, at any volume.
Call allowance · this installenforced at the gateway
Monthly allowance, in calls
—
—
Alert at 80% · then the tool returns a normal MCP error
Used this month: —
—Grade not published
No rule-by-rule report on file for this release
Two independent axes, because powerful and malicious are different questions. The grade is threat only. The capability level is blast radius, and it is never a penalty on the grade — it is priced as one subtract-only term in the score, where you can see it.
This listing is an address its publisher runs, and you connect to it directly — this marketplace is not in the path. The scanner reads packages and public source, and an address is neither. So there is no grade — not a withheld one, an unmeasured one.
Release history
This is an address its publisher runs: which release it serves is theirs to choose, so there is nothing here to pin. The history below is for reading; the current release on file is 0.6.0.
0.6.0
undated
latestNo release note was published with this version.
—
no reviews yet
Who can review
One review per account, from a signed-in account that does not publish this listing. Nothing else is asked — you can say what you think before you install it. Publishers can reply once per review, and a review can be edited or deleted by whoever wrote it.
Sign in to write one
Any signed-in account that does not publish Quantum Expectations can review it, once — before installing it or after. A review from an account that has installed it is marked as one.
No reviews yet
Nobody has reviewed this listing. The rating on the card is the mean of the reviews written here and nothing else, so there is no rating until somebody writes the first — which takes a signed-in account that does not publish it, and nothing else.