Debugging and non-entailment checklist

Query placement. The query is excluded from the encoding past and included in the decoder's admitted inputs.

Freshness versus ancestry. A later query can be correlated with an earlier resource. The graph and independence hypotheses are distinct.

Capacity on the joint cut. A marginal-independent ancillary system can carry useful joint correlations. Neither a carrier label nor a marginal dimension is a complete resource certificate.

Scheduled versus actual influence. The backwards-support envelope is conservative. A scheduled path can be erased by a constant output, reset, symmetry, or channel property.

Complete versus selected maps. Unitality applies to the adjoint of the complete trace-preserving operation, not to a normalized branch.

Enter destroys names. The RAC decoder consumes the carrier. The carrier-preserving variant explicitly allocates and reads a pointer.

No silent quantum deletion. The storage representation reads its two ancillary names and consumes or exports the resulting classical labels.

Peak versus retained memory. A one-qubit retained cut can have three-qubit peak storage implementation cost. No equal-cost hardware comparison is inferred.

Storage formula scope. The exact threshold is for the specified unlabelled depolarizing channel. Syndrome access or extra recovery operations change it.

Complete scoring. The denominator is attempted runs. An input-aware external veto is not a neutral failure inside the classical cut factorization.

Error allowances. The classical allowance bounds an actual complete-law discrepancy. The quantum design allowance is not charged again to the measured score.

Statistical conditioning. Across-run memory requires a fresh current-run cut conditional on every pre-run history.

Optional stopping. Use an anytime-valid rule or a predeclared sample size. Repeatedly inspecting a fixed-sample confidence radius does not supply a sequential guarantee.

Environmental resource claims. A Markovian qubit wins the RAC, and a classical register can produce causal-break history dependence. Neither observation alone certifies quantum environmental memory.

Optimization status. A feasible strategy is a lower bound on the optimum. Exclusion requires an analytic, exhaustive, or otherwise rigorously certified upper bound.

Source and verification status. The source records identify interfaces. A restatement is not an audit of another manuscript, a physical implementation, or a machine verification.