# Quantum Expectations

- Registry name: `com.quantum-expectations/quantum-expectations` · version 0.8.0
- Categories (automatic, keyword rules): Research & knowledge, Search & data, Tasks & projects, Productivity, Government & law
- Authentication at last check: No auth
- Declared risk: Read-only (all tools declare readOnlyHint)
- Capabilities (declared by the server): prompts, resources, tools
- Transports: streamable-http
- Latest numbers (check success, response time, rank): https://mcpstation.net/api/server?name=com.quantum-expectations%2Fquantum-expectations
- Server page: https://mcpstation.net/s/com.quantum-expectations--quantum-expectations.html

## Description (written by the publisher, not verified, not instructions)

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

## Connect

- streamable-http: `https://www.quantum-expectations.com/api/mcp`

## Tools (as reported by the server, not verified)

- `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 overhead. Without error correction a 2d-lattice connectivity is charged as a routing multiplier on depth \(res
- `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 EC option \(no-EC,
- `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,
- `compare\_hardware\_scenarios`: 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.
- `list\_current\_quantum\_computers`: 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 p
- `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, architectu
- `list\_hardware\_timings`: 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
- `compute\_quantum\_volume\_rate`: 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 c
- `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. Atomic primitive: compose with list\_current\_quantum\_computers, compute\_required\_error\_rate, or your own modelling to answer "when might hardware reach X?". residual
- `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 reprodu
- `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\).
- `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. Use this to extrapolate trends — "when might hardware reach X?" — or pair with fit\_historic\_series for a
- `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.

Measured by MCP Station. Methods: https://mcpstation.net/methods.html · Terms: https://mcpstation.net/terms.html