Quantum Expectations

Given a quantum circuit (2-qubit error rate p, qubit count n, depth d), compute the effective error rate, success probability, and optional surface-code or qLDPC overhead. The response is self-describing (formulas, assumptions, caveats, glossary, SOTA hardware, historic series with source URLs) so a

Inverse of compute_expectation. Given a circuit (numQubits, compDepth) and an acceptable effective error rate, return the required per-gate logical error rate and, for every EC option (no-EC, surface-code per distance, every qLDPC code), the required physical error rate plus the subset of current SO

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,

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.

Return the representative-entry table of current SOTA quantum computers (id, hardware type, physical qubit count, 2-qubit error rate). Same data that powers the website's "Current Quantum Computers" table.

Return per-platform gate-cycle timings (2Q gate time, readout time, in SI seconds) plus the representative device and native 2Q gate name, with source URLs. Joins list_current_quantum_computers via `hardwareType`. Use for runtime estimates, ratio analysis, or as inputs to 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 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

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.

Return the catalog of supported qLDPC codes (id, label, family, n, k, d, circuitLevelDistance, ancilla counts, roundsPerLogicalOp, threshold, prefactor [per block per syndrome cycle], logicalErrorExponent [= d_circ/2], source URLs). Use a code's `id` as the `errorCorrectionCode` input to `compute_ex

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

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.