Quantum Expectations
Server Details
Quantum error-correction feasibility: success probability, qubit overhead, records, trends.
- Status
- Healthy
- Uptime
- 100.0% over the last 24 hours
- Last Tested
- Transport
- Streamable HTTP · MCP 2025-11-25
- URL
- ChatGPT
- –
- Claude
- Quantum Expectations
TDQS
Scored across 13 tools
Most tools are cleanly separated by resource and operation (list_* for catalogs, compute_* for calculations, get_* for raw documents). There is some real overlap: compute_expectation can already return surface-code/qLDPC overhead that compute_fault_tolerant_resources derives in full, and compare_hardware_scenarios is essentially a batched compute_expectation across hardwareIds. The descriptions explicitly flag these relationships ('inverse of compute_expectation', 'defaults to every entry'), which keeps misselection unlikely but not impossible.
All names are snake_case verb_noun with a small, predictable verb set (compute_, list_, get_, fit_, compare_). The verb choice maps sensibly to the operation type: list_ for catalogs, get_ for retrieval of a fixed document/series, compute_ for derived numbers.
13 tools sits in the well-scoped range, and each one covers a distinct slice of the domain (hardware catalog, timings, codes, series, fits, four calculation entry points, algorithms, QUOPS scores, brief). No tool looks redundant enough to drop, and none of the obvious facets are split into duplicate endpoints.
The surface covers the full reasoning chain: raw data (historic series, hardware table, timings, qLDPC catalog, algorithms), analysis (fit, expectation, inverse, FT resources, QV rate, cross-hardware comparison), and interpretation aids (agent brief, provenance/caveats embedded in results). Minor gaps remain: there is no standalone surface-code lattice catalog analogous to list_qldpc_codes, and connectivity/coupling-graph detail is only available via notes rather than a queryable resource, but agents can work around both.
Available Tools
13 toolscompare_hardware_scenariosCompare Hardware ScenariosARead-onlyIdempotentInspect
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?".
Inputs: compDepth (required), numQubits (required), hardwareIds, useErrorCorrection, +2 more. Returns: results, scenario, unresolvedHardwareIds
compute_expectationCompute Quantum ExpectationARead-onlyIdempotentInspect
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?".
Inputs: compDepth (required), numQubits (required), verbose, hardwareId, +5 more. Returns: result, caveats, examples, formulas, +8 more
compute_fault_tolerant_resourcesCompute Fault-Tolerant ResourcesARead-onlyIdempotentInspect
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.
Inputs: tCount (required), numLogicalQubits (required), dataBlock, hardwareId, +4 more. Returns: qldpc, layout, caveats, factory, +8 more
compute_quantum_volume_rateCompute Quantum Volume RateARead-onlyIdempotentInspect
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).
Inputs: t2QSeconds (required), quantumVolume (required), tMeasurementSeconds (required). Returns: unit, inputs, caveats, formula, +2 more
compute_required_error_rateCompute Required Error Rate (Inverse)ARead-onlyIdempotentInspect
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?".
Inputs: compDepth (required), numQubits (required), acceptableErrorRatePercent (required). Returns: noEC, caveats, formulas, scenario, +4 more
fit_historic_seriesFit Historic Series (log-linear)ARead-onlyIdempotentInspect
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)).
Inputs: seriesType (required), hardwareType (required), targetValue. Returns: model, slope, formula, nPoints, +8 more
get_agent_briefAgent BriefARead-onlyIdempotentInspect
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.
Inputs: no named parameters.
get_historic_seriesHistoric Hardware Series (Fidelity or Qubit Count)ARead-onlyIdempotentInspect
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.
Inputs: seriesType (required). Returns: items
list_current_quantum_computersCurrent Quantum ComputersARead-onlyIdempotentInspect
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.
Inputs: no named parameters. Returns: items
list_example_algorithmsExample Quantum AlgorithmsARead-onlyIdempotentInspect
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.
Inputs: no named parameters. Returns: items
list_hardware_timingsHardware Gate-Cycle TimingsARead-onlyIdempotentInspect
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.
Inputs: no named parameters. Returns: items
list_qldpc_codesqLDPC Code Catalog (Quantum Low-Density Parity-Check)ARead-onlyIdempotentInspect
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.
Inputs: no named parameters. Returns: items
list_quops_scoresMeasured QUOPS Capability ScoresARead-onlyIdempotentInspect
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.
Inputs: no named parameters. Returns: scores, targets, definition, admissibleCone, +1 more
Tool Schema Changelog
Recent tool additions, removals, and schema changes observed during successful MCP inspections.
Loading tool schema changelog…
Related MCP Connectors
Quantum computing jobs, arXiv papers & researcher profiles from qubitsok.com
Sub-ms analog silicon solver for 7-domain physical equilibrium and 64-spin Ising with PUF.
Quantum on IonQ/IBM/Braket: spending mandates, signed benchmarks, paid PQC CBOM, advantage receipts.
QuantumOracle — 18 post-quantum crypto tools: Kyber, Dilithium, hybrid schemes, migration.
Related MCP Servers
- AlicenseNot gradedqualityNot gradedmaintenanceEnables zero-dependency quantum circuit simulation, qubit state evolution, Born-rule measurement, and Grover amplitude amplification through MCP for unstructured search benchmarking.MIT
- AlicenseAqualityDmaintenanceEstimates physical quantum resources (qubit count, runtime) for quantum algorithms on fault-tolerant hardware through natural language queries.8MIT
- FlicenseNot gradedqualityDmaintenanceMCP server wrapping Google's Stim stabilizer circuit simulator. Wire it up to an LLM and you can build and sample circuits through conversation.-
- AlicenseNot gradedqualityDmaintenanceSearch 500+ quantum computing jobs, daily arXiv papers, and 1000+ researcher profiles. 7 read-only MCP tools with AI-powered natural language search from qubitsok.com.MIT
Glama MCP Gateway
Add one secure layer between your agents and this server.