All servers · Research & knowledge · Tasks & projects · Government & law
Quantum Expectations
com.quantum-expectations/quantum-expectations · v0.8.0
New (7 days)Tools changed (7 days)
Measured by MCP Station
| Last check | Reachable |
|---|---|
| Checked at | — |
| Check success 7 / 30 days | — |
| First-try success 30 days | — |
| Median response | — |
| Lookups 30 days | — |
| Authentication | No auth |
| MCP version | 2025-06-18 |
| Rank score | — |
| Declared risk | Read-only (all tools declare readOnlyHint) |
| Capabilities declared | prompts, resources, tools |
| Tool definitions | 13 tools · with description 100% · input schema is an object 100% · read/destructive hints 100% |
Description written by the publisher, not verified
Quantum error-correction feasibility: success probability, qubit overhead, records, trends.
Connect
streamable-http · https://www.quantum-expectations.com/api/mcp
claude mcp add --transport http quantum-expectations https://www.quantum-expectations.com/api/mcp{
"mcpServers": {
"quantum-expectations": {
"url": "https://www.quantum-expectations.com/api/mcp"
}
}
}Tools as reported by the server
compute_expectationGiven 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 (rescompute_required_error_rateInverse 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,compute_fault_tolerant_resourcesGiven 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,compare_hardware_scenariosRun 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.list_current_quantum_computersReturn 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 plist_quops_scoresReturn 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, architectulist_hardware_timingsReturn 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 fromcompute_quantum_volume_rateCompute 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 cfit_historic_seriesFit 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?". residuallist_example_algorithmsReturn 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 reprodulist_qldpc_codesReturn 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).get_historic_seriesReturn 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 aget_agent_briefReturn the plain-text site brief describing scope, assumptions, the honesty clause, and the API contract. Mirrors the /agent.txt document served by the website.
Tool changes
- 2026-10-24: compute_expectation, compute_required_error_rate, compute_fault_tolerant_resources, compare_hardware_scenarios, list_current_quantum_computers, list_quops_scores, list_hardware_timings, compute_quantum_volume_rate, fit_historic_series, list_example_algorithms, list_qldpc_codes, get_historic_series
- 2026-10-16: compute_expectation, compute_required_error_rate, compute_fault_tolerant_resources, compare_hardware_scenarios, list_current_quantum_computers, list_quops_scores, list_hardware_timings, compute_quantum_volume_rate, fit_historic_series, list_example_algorithms, list_qldpc_codes, get_historic_series
Website · JSON · Text for agents · Registry updated 2026-10-23