A workload KetQat refuses to assess

Reference case

Gate counts that cannot be costed fault-tolerantly, with no classical baseline and no cost model. KetQat reports what is missing instead of producing a number.

What kind of evidence this is

This assessment produces no resource figure, on purpose. It is here to show what KetQat does when the evidence does not support an answer.

This is a reference case published by KetQat. It is not a customer's production evidence and it supports no claim about quantum advantage.

Insufficient evidence

under the Conservative assumptions

The computation cannot be assessed under this model because a required component could not be computed. The magic-state factory could not be sized, so no total machine size exists. The algorithm footprint is reported as a component of the requirement, never as the requirement.

What is actually stopping this

Logical qubit capacity

The binding constraint is logical-qubit capacity: the algorithm register and its routing space occupy 187 logical patches, which dominate the footprint.

Threshold to cross: below 0.0087Physical error rate that must not be exceeded
Economic conclusion: Not justifiedInsufficient evidence. The missing input is named below.
Evidence confidence: LOW
Kinds of claim, not an average of them.
Largest sensitivity: Not characterized

What to measure next

Synthesize the unsupported gates into Clifford+T and re-run the estimate.
Lower the raw magic-state error, loosen the target state error, or select a distillation protocol that reaches the target.
State the physical qubit capacity of the target device, with a source and a date.

What is missing

A Clifford+T synthesis of the non-Clifford, non-T gates in this circuit. Without it the T count, and therefore every magic-state and factory figure, is not merely approximate but absent.
A distillation configuration that reaches the target magic-state error. Until one exists the factory footprint, and therefore the machine size, is not computed.
The physical qubit capacity of the device under consideration. Without it, 'does it fit' has no answer.

What it would take

Total machine: Unknown
Runtime: Unknown
Code distance: 23
Factory share: Unknown

Every figure, with its evidence class, assumptions and sensitivity, is under scenarios and evidence.

Can anyone else reproduce this?

Yes. The bundle carries the inputs, the assumptions and the conclusions under one hash, and ketqat-engine intelligence verify recomputes the decisions from those inputs rather than trusting them.

da41ba983fc0398f1c305c4630f3c712286e61ec10c267d6b1b7e1c26d543aa5

Download the bundle

Under different assumptions

Resource requirements and threshold conditions for each set of assumptions. No aggregate row is produced: No aggregate row is produced. Scenarios differ in their assumptions, and a mean of results computed under different assumptions is a number none of the models predicts, carrying the apparent authority of all of them. Each row is read on its own terms.
Scenario	Logical qubitsPatches occupied, including routing space.	Total physical qubitsAlgorithm, routing and factory together.	Runtime (s)Under whichever limiter binds.	Code distanceSmallest odd distance meeting the budget.	Factory shareFraction of the machine that is the magic-state factory.	Logical errorAchieved probability of any logical error.	Required cycle (ns)Slowest cycle meeting the target or beating classical.	Required throughputMagic states per second for the runtime target.	EconomicRefused unless a baseline and a cost model both exist.	EvidenceStrength of the inputs behind the row.
ConservativeCONSERVATIVE · revision 1 Insufficient evidence	187	Unknown	Unknown	23	Unknown	0.0051	Unknown	Unknown	Insufficient evidence	LOW
BaseBASE · revision 1 Insufficient evidence	187	Unknown	Unknown	11	Unknown	0.0096	Unknown	Unknown	Insufficient evidence	LOW
OptimisticOPTIMISTIC · revision 1 Insufficient evidence	187	Unknown	Unknown	5	Unknown	0.0096	Unknown	Unknown	Insufficient evidence	LOW

How the inputs were obtained

No arithmetic is performed. 120,000 gates are neither Clifford nor T, so the T count is not merely approximate, it is absent.
With no T count there is no magic-state demand, no factory footprint, and no total machine size.
With no classical baseline and no cost model, every economic threshold is refused by name.

Limitations

This case is constructed to be unassessable. It is a demonstration of the refusal, not a claim that variational circuits are generally uncostable — synthesize the rotations and it becomes assessable.
Resource estimates are modelled, not measured. No device was run.
The logical-error prefactor is fitted and its provenance is weak; the alternative published value is reported as model sensitivity on every estimate.
The magic-state factory footprint and throughput are models of the standard construction, not published or measured figures.
The error budget is allocated across the algorithm's own logical qubits; routing patches are charged for space but not against the budget.
One QEC scheme is modelled. Other codes, other layouts, and other hardware modalities are out of scope here.
Nothing in this bundle predicts when any device will meet any condition it states.
No classical baseline was supplied, so no economic or speedup conclusion is drawn anywhere in this bundle.

The decision

Decision overview