FR-QE-0006

Fault-Tolerant Quantum Utility — Practically Useful Algorithms Beyond Classical Simulation

A fault-tolerant quantum computer can execute a practically useful quantum algorithm beyond classical simulation.

EscalatingVS-02·since 2026-08-17

Assessment trajectory

Escalatingstate held · last assessed 2026-08-17

Verification Matrix

Verification position derived from the record’s assessments; dates show when Faultline first recorded each stage.

VS-01

Assertion

—

VS-02

Published evidence

Current from 2024-01-15 — present

VS-03

Audit

—

VS-04

Replication

—

VS-05

Operation

—

Stage first recorded Current verification position Not yet recorded

State Warrant

Current stateEscalatingVS-02

Why this state?Issued during OHR-2026-09 catch-up review to close the unassessed-evidence gap created by IN-006. This assessment updates the evidential correspondence without modifying AS-001 or treating substrate progress as claim satisfaction.

Assessment summaryThe claim remains unsatisfied and ESCALATING. IN-006 advances the fault-tolerant substrate beyond protected logical memory by demonstrating composed logical Clifford operations through lattice surgery on a superconducting surface-code processor. That is a real engineering advance, but it does not cross this record's load-bearing boundary: the demonstration is Clifford-only, uses distance-three codes, supplies no practically useful target problem, and does not establish execution beyond the best classical simulation. The resource-scale gap and the moving classical comparison identified in AS-001 therefore remain decisive. IN-006 strengthens the credibility of the path toward useful fault-tolerant computation without constituting evidence that useful quantum advantage has occurred. Pressure State remains ESCALATING and Verification Stage remains VS-02; BN-001 and the open questions remain live.

State entered2024-01-15

Last reaffirmed2026-08-17

Mechanisms

Causal mechanisms recorded for this claim. The State Warrant above remains the authoritative current assessment.

Resistance MechanismRM-001

Classical algorithm improvement rate. The claim requires execution beyond classical simulation. Classical quantum chemistry and simulation methods continue to improve. For each proposed quantum advantage problem, the relevant comparison is against the best current classical method — which is itself a moving target. Tensor network methods, DMRG, and ML-augmented classical simulation have already classically solved some problems previously proposed as quantum advantage targets. The resistance mechanism is the same race dynamic as FR-QE-0005 RM-002, but operating on a nearer timescale and on problem classes where the race is currently active. The quantum side must advance faster than the classical side on the specific problem instances where advantage is claimed.

BottleneckBN-001

No agreed quantum advantage target problem. The claim requires a practically useful algorithm beyond classical simulation, but no consensus exists on which specific problem instance will first satisfy both criteria simultaneously. The quantum chemistry community has proposed FeMoco (nitrogen fixation catalyst), ruthenium-based catalysts, and vibrational spectra of small molecules as candidate first-advantage problems — but as classical methods improve, each candidate may become classically tractable before quantum hardware reaches the required scale. The bottleneck is that the first claim satisfaction event requires landing on a specific problem instance where quantum hardware reaches the required scale before classical methods solve it. The problem instance cannot be identified in advance with certainty.

AttractorAT-001

First 1000-logical-qubit fault-tolerant chemistry demonstration. Resource estimation identifies approximately 1000–4000 logical qubits as sufficient for the first practically useful fault-tolerant quantum chemistry calculations. If a system of this scale is demonstrated with below-threshold error rates and executes a quantum chemistry calculation on a problem instance not tractable classically, the claim would be satisfied. The attractor is more tightly defined and closer in engineering terms than FR-QE-0005's attractor, making this record the most near-term application claim in PROG-QE. Several hardware roadmaps (IBM, Google, Microsoft) project this scale within five to ten years under optimistic assumptions.

Assessment History

2024-01-15

Initial assessment — Escalating

The claim has not been satisfied. No fault-tolerant quantum computer has executed a practically useful quantum algorithm beyond classical simulation at the scale required for genuine practical advantage. The substrate progress (INST-003) establishes that fault-tolerant logical qubits capable of executing simple circuits now exist; the resource estimation (INST-004) establishes that practically useful chemistry simulation requires approximately two orders of magnitude more logical qubits than are currently available. The gap is smaller and more tractable than the equivalent gap for RSA factorisation (FR-QE-0005), but still represents years of further engineering. Classical simulation methods are simultaneously improving (INST-005), narrowing the space of problems that would unambiguously qualify as beyond classical reach by the time fault-tolerant hardware reaches the required scale. The pressure state is ESCALATING: the substrate is advancing on a credible path, but no agreed target problem yet exists (BN-001) on which the claim could be tested.

Verification Stage: VS-02 preserved — historically unverified.^*

2026-08-17

Reassessed, no change — Escalating

The claim remains unsatisfied and ESCALATING. IN-006 advances the fault-tolerant substrate beyond protected logical memory by demonstrating composed logical Clifford operations through lattice surgery on a superconducting surface-code processor. That is a real engineering advance, but it does not cross this record's load-bearing boundary: the demonstration is Clifford-only, uses distance-three codes, supplies no practically useful target problem, and does not establish execution beyond the best classical simulation. The resource-scale gap and the moving classical comparison identified in AS-001 therefore remain decisive. IN-006 strengthens the credibility of the path toward useful fault-tolerant computation without constituting evidence that useful quantum advantage has occurred. Pressure State remains ESCALATING and Verification Stage remains VS-02; BN-001 and the open questions remain live.

Issued during OHR-2026-09 catch-up review to close the unassessed-evidence gap created by IN-006. This assessment updates the evidential correspondence without modifying AS-001 or treating substrate progress as claim satisfaction.

Claim Lineage

Historical narrative recorded for this claim. It does not override the current State Warrant.

1994–2009

Quantum algorithm portfolio established. Shor, Grover, HHL, and quantum phase estimation demonstrate that fault-tolerant quantum computers could provide speedups on relevant problems. The theoretical utility case is established; the practical case awaits hardware.

2010–20

NISQ era begins; utility claims emerge and are contested. Noisy intermediate-scale devices are proposed as platforms for near-term quantum advantage. Claims are made and contested; classical simulation methods close many proposed advantage gaps.

2022–23

Resource estimation matures; targets become quantified. Detailed studies establish that fault-tolerant quantum chemistry advantage requires approximately 1000–4000 logical qubits. The gap is quantified for the first time at useful precision.

2023–24

Fault-tolerant substrate demonstrated; claim transitions to ESCALATING. Below-threshold error correction at small scale demonstrates that the substrate for executing simple useful circuits now exists in principle. The engineering path to claim satisfaction is credible.

Open Questions

Questions retained in this record. The current State Warrant may have narrowed or reframed earlier questions.

OQ-001

Which specific molecular or physical system will provide the first unambiguous fault-tolerant quantum advantage? The absence of an agreed target problem (BN-001) means the claim may be satisfied on a problem not currently anticipated. Whether the first advantage demonstration will be accepted as "practically useful" by the broader scientific community depends on which problem it solves.

Raised 2024-01-15

OQ-002

Does the PROG-QE diagnosis — technically coherent but temporally displaced — create investment sustainability risk? The programme requires years to decades of continued investment before applications are reachable. If investment cycles shorten before the applications arrive, the substrate may stop advancing before the claim is satisfied. This is an institutional question rather than a technical one, but it is now the programme's structural tension.

Raised 2024-01-15

OQ-003

All three programme diagnoses are now established. Is there a meta-observation available about what kinds of programmes generate which kinds of diagnoses? PROG-AI: surface/depth inversion (advancing capabilities, contested foundations). PROG-AM: collapse dynamic (competitive pressure, premature announcement). PROG-QE: temporal displacement (coherent foundations, distant applications). Are these diagnosis types a property of the domains, or of the specific claim configurations the Observatory selected?

Raised 2024-01-15

Mutation Log

Mutation	Date	Field	Prior value	Current value
M-011	2026-09-06	description_restored	Legacy ingestion cutoffs: mechanisms:RM-001, mechanisms:BN-001, mechanisms:AT-001	Source-restored complete descriptions
M-010	2026-08-17	assessment_issued	AS-001	AS-002
M-009	2026-07-14	instance_appended	—	IN-006
M-008	2026-07-08	reference_corrected	—	REFERENCE-CORRECTED
M-007	2026-07-08	realization_note_added	—	REN-001
M-006	2024-01-15	programme_panel_added	—	PROGRAMME-PANEL-ADDED
M-005	2024-01-15	null_condition_failed	—	NULL-CONDITION-FAILED
M-004	2024-01-15	mechanisms_recorded	—	MECHANISMS-RECORDED
M-003	2024-01-15	assessment_issued	—	ASSESSMENT-ISSUED
M-002	2024-01-15	instances_logged	—	INSTANCES-LOGGED
M-001	2024-01-15	record_created	—	RECORD-CREATED

Evidence Sources

6 instances on recordShow sources ↓Hide ↑

IN-001Quantum algorithm portfolio — theoretical utility establishedneutral

IN-002NISQ-era quantum utility claims and classical simulation challengespartial

IN-003Logical qubit fault-tolerant operations — substrate becomes application-ready in principlesupportive

IN-004Resource estimation studies — useful fault-tolerant algorithms require 1000+ logical qubitspartial

IN-005Classical algorithm improvement — moving target on the simulation thresholdcontesting

IN-006Composed logical Clifford operations via lattice surgery on a superconducting surface-code processorNEUTRAL