Quantum error-correction feasibility: success probability, qubit overhead, records, trends.
Déduit des transports déclarés par cette annonce (streamable-http). Un client absent de cette liste n’est pas écarté pour autant — c’est simplement quelque chose que Forge ne peut pas confirmer.
La vérification confirme l’identité de l’éditeur (la propriété du dépôt), pas la sûreté du code. L’analyse de sécurité couvre les CVE connues et les scripts d’installation suspects.
Lu depuis un véritable échange MCP initialize → tools/list contre l’endpoint déclaré. Aucun outil n’a été invoqué — tools/list est l’appel d’introspection en lecture seule que le protocole prévoit pour cela. Cela reflète ce que le serveur annonçait à cet instant ; un endpoint hébergé n’est figé sur aucune version et peut changer sans préavis.
https://www.quantum-expectations.com/api/mcp12 outils · 487 mscompute_expectationGiven 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…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…
| Paramètre | Type | Description |
|---|---|---|
| qubitErrorRate | number | Per-gate 2-qubit error rate p, in (0, 0.1]. Supply exactly one of qubitErrorRate or hardwareId. |
| hardwareId | string | Alias for qubitErrorRate: resolves to the 2-qubit error rate of the given SOTA hardware entry from list_current_quantum_computers. Supply exactly one of qubitE… |
| numQubits* | integer | — |
| compDepth* | integer | — |
| useErrorCorrection | boolean | — |
| errorCorrectionCode | string | Either "surface" (default when useErrorCorrection=true) or a qLDPC code id from list_qldpc_codes. "surface-code" is accepted as an alias for "surface". |
| distanceSurfaceCode | number | Surface code distance: odd integer in [3, 31]. Required when useErrorCorrection=true and the surface code is selected; ignored when a qLDPC code is selected. |
| verbose | boolean | When false, omits hardwareContext, formulas, assumptions, caveats, glossary, examples, and exampleProblems from the response — leaving only modelVersion, scena… |
compute_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,…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,…
| Paramètre | Type | Description |
|---|---|---|
| numQubits* | integer | Number of logical qubits n in the circuit. |
| compDepth* | integer | Circuit depth d (sequential 2-qubit gate layers). Accepts values up to 1e13. |
| acceptableErrorRatePercent* | number | Upper bound on the effective error rate, as a percent. Default website convention is 33 (i.e. ≤33% effective error is "acceptable"). |
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…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…
| Paramètre | Type | Description |
|---|---|---|
| numLogicalQubits* | integer | Number of logical data qubits the algorithm needs. |
| tCount* | integer | Total number of T gates (magic states consumed). Convention: state Toffoli-counted algorithms in T gates before calling (1 Toffoli ≈ 4–7 T depending on decompo… |
| qubitErrorRate | number | Physical 2-qubit error rate p in (0, 0.1]. Supply exactly one of qubitErrorRate or hardwareId. |
| hardwareId | string | Alias for qubitErrorRate: resolves to the error rate of a SOTA hardware entry. |
| targetSuccessProbability | number | Target end-to-end success probability. The failure budget (1 − target) is split evenly between T-state error and logical (memory/surgery) error, matching Litin… |
| dataBlock | string | Data-block layout (Litinski §2): compact = fewest qubits, fast = shortest time per T gate. |
| cycleTimeSeconds | number | Surface-code cycle time in seconds. Default 1 µs (Litinski convention; Google 2024 measured 1.1 µs on superconducting hardware). Trapped-ion/neutral-atom cycle… |
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.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.
| Paramètre | Type | Description |
|---|---|---|
| numQubits* | integer | — |
| compDepth* | integer | — |
| useErrorCorrection | boolean | — |
| errorCorrectionCode | string | Either "surface" (default when useErrorCorrection=true) or a qLDPC code id. "surface-code" is accepted as an alias for "surface". |
| distanceSurfaceCode | number | Surface code distance: odd integer in [3, 31]. Required when useErrorCorrection=true and the surface code is selected; ignored when a qLDPC code is selected. |
| hardwareIds | array | Subset of QUANTUM_COMPUTERS ids to compare. Omit to compare every entry. |
list_current_quantum_computersReturn 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 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.
Aucun schéma d’entrée n’a été publié pour cet outil.
list_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 fro…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 fro…
Aucun schéma d’entrée n’a été publié pour cet outil.
compute_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…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…
| Paramètre | Type | Description |
|---|---|---|
| quantumVolume* | integer | Quantum volume V_Q (integer ≥ 2, e.g. 64 for a depth-log2=6 square circuit). |
| t2QSeconds* | number | Native 2-qubit gate time in seconds (e.g. 60e-9 for a 60 ns CZ). |
| tMeasurementSeconds* | number | End-of-circuit measurement/readout time in seconds (e.g. 5e-3 for 5 ms). |
fit_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?". residua…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?". residua…
| Paramètre | Type | Description |
|---|---|---|
| seriesType* | string | Which historic series to fit: "fidelity" (2-qubit gate error rate) or "qubit-count" (physical qubits). |
| hardwareType* | string | Hardware platform as used by get_historic_series. |
| targetValue | number | Optional. When supplied, the response includes yearAtTargetValue — the extrapolated year the fit crosses this value (error rate for fidelity series, qubit coun… |
list_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 reprod…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 reprod…
Aucun schéma d’entrée n’a été publié pour cet outil.
list_qldpc_codesReturn the catalog of supported qLDPC 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). The per-block, per-syndrome-cycle logical error rat…Return the catalog of supported qLDPC 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). The per-block, per-syndrome-cycle logical error rat…
Aucun schéma d’entrée n’a été publié pour cet outil.
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…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…
| Paramètre | Type | Description |
|---|---|---|
| seriesType* | string | "fidelity" → 2-qubit gate error rates; "qubit-count" → physical qubit counts. |
get_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.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.
Aucun schéma d’entrée n’a été publié pour cet outil.
12 outils sur 12 ont publié une description.
Les noms et descriptions d’outils sont écrits par l’éditeur et affichés tels quels, comme du texte inerte. Ce sont les chaînes qu’un client MCP transmet à un modèle, alors Forge y recherche des motifs d’injection de prompt — tout constat apparaît avec l’analyse de sécurité ci-dessus. « Privilégié » est une correspondance de mot-clé sur le nom de l’outil, pas un audit de ce qu’il fait : un nom anodin peut tout de même tout faire.
Quantum error-correction feasibility: success probability, qubit overhead, records, trends.
Les noms cliquables ouvrent l’index Forge de toutes les entrées observées exposant cet outil. Parcourir tous les outils indexés.
Cette entrée ne publie aucun paquet npm : Forge n'a donc pas d'arbre de dépendances pour elle. C'est une lacune de couverture — pas une affirmation qu'elle n'a aucune dépendance.