Quantum Expectations

com.quantum-expectations/quantum-expectationsVersion 0.10.1

Quantum error-correction feasibility: success probability, qubit overhead, records, trends.

Status

Responds99 msNov 14, 2026, 14:11 UTCAnswered our handshake without sign-in.

Registry data may be out of date

We could not refresh it, so this page shows the last copy.

Last checked: Nov 14, 2026, 14:11 UTC
Latency: 99 ms
Remotes responding: 1 of 1
Sign-in: No sign-in
Hosting: Hosted outside the EU (detected)
Registry data as of: Nov 14, 2026, 22:14 UTC

Data from the official MCP Registry, checked by run.zero. How we check

Connect

Streamable HTTP

https://www.quantum-expectations.com/api/mcpResponds99 msNov 14, 2026, 14:11 UTC

No sign-in

Claude Code

claude mcp add --transport http quantum-expectations https://www.quantum-expectations.com/api/mcp

Claude Desktop and claude.ai

1
2
3

Settings > Connectors > Add custom connector
Name: quantum-expectations
Remote MCP server URL: https://www.quantum-expectations.com/api/mcp

Cursor

{
  "mcpServers": {
    "quantum-expectations": {
      "url": "https://www.quantum-expectations.com/api/mcp"
    }
  }
}

VS Code

code --add-mcp '{"name":"quantum-expectations","type":"http","url":"https://www.quantum-expectations.com/api/mcp"}'

Built your own server? run.zero hosts MCP servers on European infrastructure.

Host your own MCP server on run.zero

Tools

13 tools

Tools of Quantum Expectations
	Description		Read-only	Idempotent	Open world
`compare_hardware_scenarios`Run the same circuit against several current state-of-the-art hardware entries in one call and return one result block per entry, computed at that entry's error rate and connectivity class (the result blocks carry no minimum runtime and take no connectivity override). Defaults to every entry in list_current_quantum_computers when hardwareIds is omitted. Answers "which platform runs this circuit best?".	Run the same circuit against several current state-of-the-art hardware entries in one call and return one result block per entry, computed at that entry's error rate and connectivity class (the result blocks carry no minimum runtime and take no connectivity override). Defaults to every entry in list_current_quantum_computers when hardwareIds is omitted. Answers "which platform runs this circuit best?".	No	Yes	Yes	No
`compute_expectation`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 (quantum low-density parity-check) 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 self-describing (formulas, assumptions, caveats, glossary, state-of-the-art hardware, historic series with source URLs), so one call carries the context to reason from. Answers "how likely is this circuit to succeed on this device or error rate?".	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 (quantum low-density parity-check) 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 self-describing (formulas, assumptions, caveats, glossary, state-of-the-art hardware, historic series with source URLs), so one call carries the context to reason from. Answers "how likely is this circuit to succeed on this device or error rate?".	No	Yes	Yes	No
`compute_fault_tolerant_resources`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. With errorCorrectionCode set to a qLDPC code that has architecture data (bb-144-12-12, bb-288-12-18; see the architecture field of list_qldpc_codes), the data is held in that code's modules instead (modules, per-instruction error rates and timesteps per T gate) and only the factory is a surface-code block. Results are reported under TWO published logical-error fits (conservative + optimistic) because they disagree by 13-268x (d=7 to d=25); both are returned. Returns an explicit `infeasible` block when no cataloged factory or code distance can satisfy the error budget. Computes resource numbers only: it does not compare against classical alternatives or judge whether a problem should run on a quantum computer.	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. With errorCorrectionCode set to a qLDPC code that has architecture data (bb-144-12-12, bb-288-12-18; see the architecture field of list_qldpc_codes), the data is held in that code's modules instead (modules, per-instruction error rates and timesteps per T gate) and only the factory is a surface-code block. Results are reported under TWO published logical-error fits (conservative + optimistic) because they disagree by 13-268x (d=7 to d=25); both are returned. Returns an explicit `infeasible` block when no cataloged factory or code distance can satisfy the error budget. Computes resource numbers only: it does not compare against classical alternatives or judge whether a problem should run on a quantum computer.	No	Yes	Yes	No
`compute_quantum_volume_rate`Compute the Quantum Volume Rate (QVR, in Quantum Volume (QV) per 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, state preparation and measurement (SPAM), mid-circuit measurement, and classical-control latency. It is not a production throughput metric such as IBM's CLOPS (circuit layer operations per second, arXiv:2110.14108).	Compute the Quantum Volume Rate (QVR, in Quantum Volume (QV) per 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, state preparation and measurement (SPAM), mid-circuit measurement, and classical-control latency. It is not a production throughput metric such as IBM's CLOPS (circuit layer operations per second, arXiv:2110.14108).	No	Yes	Yes	No
`compute_required_error_rate`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 error-correction (EC) option (no-EC, surface-code per distance, every qLDPC code), the required physical error rate plus the subset of current state-of-the-art hardware that already qualifies. An option whose inverse lands above the code threshold is capped at min(0.1, threshold) and carries a `note` (any sub-threshold p satisfies it); `unreachableReason` is reserved for genuinely unreachable options. Answers "what hardware do I need to run this algorithm?".	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 error-correction (EC) option (no-EC, surface-code per distance, every qLDPC code), the required physical error rate plus the subset of current state-of-the-art hardware that already qualifies. An option whose inverse lands above the code threshold is capped at min(0.1, threshold) and carries a `note` (any sub-threshold p satisfies it); `unreachableReason` is reserved for genuinely unreachable options. Answers "what hardware do I need to run this algorithm?".	No	Yes	Yes	No
`fit_historic_series`Fit a log-linear trend (ln(value) = slope * year + intercept) to one historic series — fidelity or qubit-count — for one hardware type. An atomic primitive for "when might hardware reach X?" questions; with targetValue it returns the year the fit reaches that value. residualStdDev is the BIASED (maximum-likelihood) root-mean-square (RMS) — divides by n, not (n - 2); on small series (n ≈ 3–5) the unbiased value is larger by √(n / (n - 2)).	Fit a log-linear trend (ln(value) = slope * year + intercept) to one historic series — fidelity or qubit-count — for one hardware type. An atomic primitive for "when might hardware reach X?" questions; with targetValue it returns the year the fit reaches that value. residualStdDev is the BIASED (maximum-likelihood) root-mean-square (RMS) — divides by n, not (n - 2); on small series (n ≈ 3–5) the unbiased value is larger by √(n / (n - 2)).	No	Yes	Yes	No
`get_agent_brief`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.	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	Yes	Yes	No
`get_historic_series`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. It is the raw data behind trend questions such as "when might hardware reach X?"; fit_historic_series fits a log-linear trend to one hardware type's series.	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. It is the raw data behind trend questions such as "when might hardware reach X?"; fit_historic_series fits a log-linear trend to one hardware type's series.	No	Yes	Yes	No
`list_current_quantum_computers`Return the representative-entry table of current state-of-the-art 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. The model's capability prediction per entry in QUOPS units is served by compute_expectation (hardwareContext.currentQuantumComputers[].modelCapability); measured scores are in list_quops_scores.	Return the representative-entry table of current state-of-the-art 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. The model's capability prediction per entry in QUOPS units is served by compute_expectation (hardwareContext.currentQuantumComputers[].modelCapability); measured scores are in list_quops_scores.	No	Yes	Yes	No
`list_example_algorithms`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 rests on the authors' attestation, with a `provenanceNote` giving the specifics, so an attested figure is not sourced as firmly as a published circuit.	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 rests on the authors' attestation, with a `provenanceNote` giving the specifics, so an attested figure is not sourced as firmly as a published circuit.	No	Yes	Yes	No
`list_hardware_timings`Return per-platform gate-cycle timings (two-qubit (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 orders of magnitude slower. As runtime inputs, including to compute_quantum_volume_rate, they give optimistic lower bounds.	Return per-platform gate-cycle timings (two-qubit (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 orders of magnitude slower. As runtime inputs, including to compute_quantum_volume_rate, they give optimistic lower bounds.	No	Yes	Yes	No
`list_qldpc_codes`Return the catalog of supported qLDPC (quantum low-density parity-check) error-correction 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, and `architecture`: the instruction-level data of a published architecture that makes the code computable, or null). The per-block, per-syndrome-cycle logical error rate is p^alpha * exp(c0 + c1p + c2p^2) for p <= threshold (the source paper's own fitting form; c1 = c2 = 0 means a plain power law). `provenance` names the table or section each constant was read from. `caveats` is an array of source-level qualifications on the entry's constants (loose distance bounds, values a source marks as assumed, numbers that differ between sources); empty when the sources carry none. A code's `id` is the value `compute_expectation` accepts as `errorCorrectionCode`.	Return the catalog of supported qLDPC (quantum low-density parity-check) error-correction 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, and `architecture`: the instruction-level data of a published architecture that makes the code computable, or null). The per-block, per-syndrome-cycle logical error rate is p^alpha * exp(c0 + c1p + c2p^2) for p <= threshold (the source paper's own fitting form; c1 = c2 = 0 means a plain power law). `provenance` names the table or section each constant was read from. `caveats` is an array of source-level qualifications on the entry's constants (loose distance bounds, values a source marks as assumed, numbers that differ between sources); empty when the sources carry none. A code's `id` is the value `compute_expectation` accepts as `errorCorrectionCode`.	No	Yes	Yes	No
`list_quops_scores`Return the measured QUOPS (quantum universal operation performance system, a cross-platform capability benchmark) 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 site's own model is checked against (modelCapability.quopsEquivalent in the compute_expectation hardware context). Vendor and device names appear here because this table is agent-facing only.	Return the measured QUOPS (quantum universal operation performance system, a cross-platform capability benchmark) 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 site's own model is checked against (modelCapability.quopsEquivalent in the compute_expectation hardware context). Vendor and device names appear here because this table is agent-facing only.	No	Yes	Yes	No

Details

Registry status: Active
Published: Nov 10, 2026
Updated: Nov 10, 2026
Website: https://www.quantum-expectations.com/⁠ (opens in a new tab)
Repository: Not given
Categories (suggested): Data and analyticsSuggested categories are assigned automatically from the registry text and may be wrong. Verified operators can correct them.
GDPR: Not declared

Are you the operator? Claim this listing