{"id":"com.quantum-expectations/quantum-expectations","slug":"com-quantum-expectations-quantum-expectations","title":"Quantum Expectations","description":"Quantum error-correction feasibility: success probability, qubit overhead, records, trends.","version":"0.10.1","publisher":{"kind":"domain","id":"quantum-expectations.com","label":"quantum-expectations.com","url":"https://quantum-expectations.com"},"website":"https://www.quantum-expectations.com","repository":"","remotes":[{"type":"streamable-http","url":"https://www.quantum-expectations.com/api/mcp"}],"packages":[],"published":"2026-11-10","updated":"2026-11-10","status":"online","auth":"","latency_ms":1045,"checked":"2026-11-19","uptime":100,"checks":3,"tools":[{"name":"compute_expectation","title":"Compute Quantum Expectation","description":"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 clas","read_only":true},{"name":"compute_required_error_rate","title":"Compute Required Error Rate (Inverse)","description":"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 pl","read_only":true},{"name":"compute_fault_tolerant_resources","title":"Compute Fault-Tolerant Resources","description":"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","read_only":true},{"name":"compare_hardware_scenarios","title":"Compare Hardware Scenarios","description":"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 be","read_only":true},{"name":"list_current_quantum_computers","title":"Current Quantum Computers","description":"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.current","read_only":true},{"name":"list_quops_scores","title":"Measured QUOPS Capability Scores","description":"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 ","read_only":true},{"name":"list_hardware_timings","title":"Hardware Gate-Cycle Timings","description":"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","read_only":true},{"name":"compute_quantum_volume_rate","title":"Compute Quantum Volume Rate","description":"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), ","read_only":true},{"name":"fit_historic_series","title":"Fit Historic Series (log-linear)","description":"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 u","read_only":true},{"name":"list_example_algorithms","title":"Example Quantum Algorithms","description":"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 res","read_only":true},{"name":"list_qldpc_codes","title":"qLDPC Code Catalog (Quantum Low-Density Parity-Check)","description":"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 comput","read_only":true},{"name":"get_historic_series","title":"Historic Hardware Series (Fidelity or Qubit Count)","description":"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.","read_only":true},{"name":"get_agent_brief","title":"Agent Brief","description":"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.","read_only":true}],"server_info":{"name":"quantum-expectations","version":"0.10.1"},"category":"developer","tags":["agents"],"kind":"remote","source":"registry","submitted":{},"first_party":true,"domain_rank":null,"score":100,"indexable":true,"first_seen":"2026-07-02","stars":0,"badges":[],"sponsor":null,"page":"https://agentsindex.org/agents/com-quantum-expectations-quantum-expectations/"}