Six calculations, with completion criteria

1. Analytic baseline before simulation. Implement the $n=8$–$12$ SWAP schedule only after specifying whether the target is the whole $n$-qubit input or a smaller diary. Compare against Theorem thm:swap. Independently implement the occupied-vacuum pulse model and compare against $q_j{a}_d$. These are different channels and must not share an unqualified formula.

2. A finite-band microscopic proxy. Archive $H_S,A_a,g_a,f_a$, cutoffs, code preparation, packets, $T,m,\Delta$, and the exact finite active space. Choose regulators before evaluating the recovery certificate. Report the proved $b_{\mathrm{reg}}$, not merely a matrix size.

3. A separate field bridge. If studying a collapsing shell, archive the geometry, canonical transformation, representation, partner modes, and complete fixed-code comparison theorem. Do not substitute (eq:breg) from a different Hamiltonian. Thermal-pair preparation may first be checked using Proposition prop:thermal-cutoff; it is not the collapse calculation.

4. Mass matching and stability. Declare whether the mass path is imposed or derived. Supply the outgoing energy observable and emission clock. Validate the power law on a positive-mass domain, report the cutoff lifetime bracket, and retain all forcing, discretization, switching, and interaction-energy terms.

5. Information and negative controls. Compute every logical matrix unit of both proxy channels or exploit a proved symmetry reduction. Validate a residual state or CPTP decoder. Include the commuting control of Proposition prop:negative, the spectral separation, and a record-only test. A designed $q_j$ drop is labelled designed, not discovered.

6. Release the full certificate package. Archive channel data, feasible Choi matrices, validated positivity, trace-preservation and trace-norm bounds, arithmetic allowances, quantum-return programs, separate terminal-readout programs, complete apparatus outputs, and all physical matching assumptions. For endpoint claims, include access-preserving identifications and the order of limits.

No numerical run is reported in this manuscript. For a whole $n$-qubit input, there are $d^2=4^n$ logical matrix units. Generic complete-channel certification is therefore not automatically tractable at $n=12$. Analytic symmetries, smaller fixed diaries, or validated structured representations must be justified rather than assumed.

For a finite residual Choi state $J$, a feasible trace-norm upper certificate can be produced by

A feasible tuple certifies an upper bound on $e$, not the exact diamond norm. A finite decoder's unnormalized Choi operator must satisfy

Floating-point objective values alone certify neither condition.