MCP App Store
by KeenEthics
Quantum Expectations icon

Quantum Expectations MCP Server for Claude and ChatGPT

By Matthias Wulff

Overview

See for yourself what today's quantum computers can actually do, and how far they are from the applications in the headlines. You do not need to be a physicist: ask in plain language, and Claude runs the numbers on real hardware records, each one taken from a published source. Is it realistic yet? Paste a paper, a press release, a roadmap or a headline and compare its claims with today's hardware, or describe a computation or pick one of the example algorithms and see how likely today's best hardware is to get it right, with and without error correction. What would it take? See how much better the hardware would have to get, and how many physical qubits and how much run time a well-known goal such as breaking RSA-2048 needs once error correction is included. How fast is progress? Compare trapped-ion, superconducting and neutral-atom hardware side by side, follow the record error rates and qubit counts over the years, and see when the trend would reach a target if it held (an extrapolation, not a forecast). The answers to the first two questions show their assumptions and caveats, and every hardware record links to the paper or vendor publication it comes from. The tools give numbers, not verdicts: what they mean for quantum computing stays your judgement. For experts, the same tools take exact inputs: qubit count, circuit depth, per-gate error rate, surface-code distance, qLDPC codes, and logical qubits with T count for full fault-tolerant footprints (surface code on the Litinski cost model, qLDPC on the published bicycle architecture). Limitations: this is a deliberately simplified model. It treats noise with the standard surface-code approximation and a routing allowance for hardware with fixed connections, and leaves out effects such as leakage, crosstalk, measurement errors, single-qubit gate errors and idling. Where a measured benchmark score and the model disagree, the measurement wins. All tools are read-only and take no personal data.

How to connect

  1. Claude: Open the Quantum Expectations listing in the Claude connectors directory and choose Connect. Claude listing Quantum Expectations exposes 13 tools here.
  2. ChatGPT: Open the Quantum Expectations listing in the ChatGPT app directory and choose Connect. ChatGPT listing Quantum Expectations exposes 13 tools here.

Tools

compare_hardware_scenarios

ChatGPT
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.

compute_expectation

ChatGPT
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 self-describing (formulas, assumptions, caveats, glossary, SOTA hardware, historic series with source URLs) so an agent can reason from one call. For the inverse ("what hardware do I need?") use compute_required_error_rate; to rank multiple platforms in one call use compare_hardware_scenarios.

compute_fault_tolerant_resources

ChatGPT
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 published logical-error fits (conservative + optimistic) because they disagree by 13-268x (d=7 to d=25) - always state both. Returns an explicit infeasible block when no cataloged factory or code distance can satisfy the error budget. Computes numbers only: comparing against classical alternatives and concluding "should this run on a quantum computer" stays with you, the calling agent (state the caveats when you do).

compute_quantum_volume_rate

ChatGPT
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 production throughput metric, see IBM's CLOPS (arXiv:2110.14108).

compute_required_error_rate

ChatGPT
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 current SOTA hardware that already qualifies. An option whose inverse lands above the code threshold is capped at min(MAX_P, 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?".

fit_historic_series

ChatGPT
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) inflate by √(n / (n - 2)) before building confidence intervals.

get_agent_brief

ChatGPT
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.

get_historic_series

ChatGPT
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.

list_current_quantum_computers

ChatGPT
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 from compute_expectation; for measured scores, list_quops_scores.

list_example_algorithms

ChatGPT
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. Carry that caveat whenever you quote an attested figure; do not present it as equivalently sourced.

list_hardware_timings

ChatGPT
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 orders of magnitude slower. Use for ratio analysis or as optimistic lower-bound inputs to runtime estimates and compute_quantum_volume_rate, and say so when you quote a runtime.

list_qldpc_codes

ChatGPT
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). The per-block, per-syndrome-cycle logical error rate is p^alpha exp(c0 + c1p + c2*p^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. Read it before quoting a code's logical error rate as firm. Use a code's id as the errorCorrectionCode input to compute_expectation.

list_quops_scores

ChatGPT
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: compare them with modelCapability.quopsEquivalent on the compute_expectation hardware context. Vendor and device names appear here because this table is agent-facing only.

compare_hardware_scenarios

Claude
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?".

compute_expectation

Claude
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?".

compute_fault_tolerant_resources

Claude
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 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.

compute_quantum_volume_rate

Claude
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_required_error_rate

Claude
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?".

fit_historic_series

Claude
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)).

get_agent_brief

Claude
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.

get_historic_series

Claude
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.

list_current_quantum_computers

Claude
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.

list_example_algorithms

Claude
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.

list_hardware_timings

Claude
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.

list_qldpc_codes

Claude
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). The per-block, per-syndrome-cycle logical error rate is p^alpha exp(c0 + c1p + c2*p^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.

list_quops_scores

Claude
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.

Similar Apps

Listed on MCP App Store

Listed on MCP App Store

Add this badge to your site or README. It links to this page.

HTML

<a href="https://mcp-app-store.keenethics-labs.com/app/quantum-expectations"><img src="https://mcp-app-store.keenethics-labs.com/badges/listed-on-mcp-app-store.svg" alt="Listed on MCP App Store" width="220" height="44"></a>

Markdown

[![Listed on MCP App Store](https://mcp-app-store.keenethics-labs.com/badges/listed-on-mcp-app-store.svg)](https://mcp-app-store.keenethics-labs.com/app/quantum-expectations)