Quantum Expectations
com.quantum-expectations/quantum-expectationsQuantum error-correction feasibility: success probability, qubit overhead, records, trends.
Watch this dependency
Get before/after evidence when observed tools, schemas, authentication access, availability or the endpoint changes.
Inspect evidence and set up a watch Share public evidence report
Score: 100/100
Handshake verified by our own probe.
why this score
Tools · 13
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.…
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 numbe…
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 Litins…
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_q…
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).…
Return the measured QUOPS capability 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,…
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 …
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 + …
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, c…
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 c…
Return the catalog of supported qLDPC codes (id, label, family, n, k, d, circuitLevelDistance, ancilla counts, roundsPerLogicalOp, threshold, fitCoefficients {c0, c1, c2}, logicalErrorExponent [alpha …
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 …
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.
Resources · 9
Historic 2-qubit gate error rates by hardware type (with source URLs).
resource://quantum-expectations/historic-fidelity
Historic physical qubit counts by hardware type (with source URLs).
resource://quantum-expectations/historic-qubit-count
Representative-entry table of current SOTA quantum computers.
resource://quantum-expectations/current-quantum-computers
Per-platform best-case demonstrated 2-qubit gate time and readout time (SI seconds) with source URLs. Joins with current-quantum-computers via hardwareType, but the numbers come from small testbeds, n…
resource://quantum-expectations/hardware-timings
Curated list of quantum algorithms with published resource estimates, each tagged with a `provenance` value (published-circuit vs attested-estimate) and, where applicable, a note on what is and is not…
resource://quantum-expectations/example-algorithms
Gloss for the `provenance` values carried by every entry in example-algorithms, so the verifiability caveat travels with the data instead of living only in prose.
resource://quantum-expectations/example-algorithm-provenance
Supported qLDPC codes: threshold, fitCoefficients {c0, c1, c2} and logicalErrorExponent (alpha) for P_L = p^alpha * exp(c0 + c1*p + c2*p^2) per block per syndrome cycle for p <= threshold (above it th…
resource://quantum-expectations/qldpc-codes
Measured QUOPS capability scores per device (arXiv:2609.12146) with width, rate, architecture and source URL, plus utility-scale targets in the same unit. The measured yardstick for the model's modelC…
resource://quantum-expectations/quops-scores
Plain-text site brief with scope, assumptions, honesty clause, and API contract.
resource://quantum-expectations/agent-brief
Prompts · 3
Guided analysis: when could a circuit (logical qubits × depth, target error budget) become feasible on real hardware? Composes compute_required_error_rate and fit_historic_series; the agent draws the …
Guided analysis: what would it take to run an algorithm (logical qubits × T count) fault-tolerantly, and is that worth it vs classical compute? Composes compute_fault_tolerant_resources and list_curre…
Guided analysis: rank current hardware platforms for a given circuit and explain which constraint binds on each. Composes compare_hardware_scenarios and list_hardware_timings; the agent draws the conc…
How to use
Add to your Claude Desktop / Cursor / Cline MCP config:
{
"mcpServers": {
"quantum_expectations": {
"url": "https://www.quantum-expectations.com/api/mcp",
"transport": "streamable-http"
}
}
}