Resource and error ledger

For an $n_C$-qubit clock, $p$-qubit station payloads, $b$-bit report reserves, and lookup workspace $w_{\mathrm{lookup}}$, a conservative preallocated reserve is

Additional description registers, external references, classical tables, and any supplier storage are separately declared. The optional last qubit is a binary report probe.

The route uses $n$ register SWAPs and $n$ classical report transmissions. Readout, basis change, lookup, buffers, and their durations are charged. Consumed clock names do not reappear as returned quantum factors.

For compatible complete implemented channels,

The proof is telescoping replacement of one channel factor at a time, together with diamond-norm contraction under channels and the triangle inequality Watrous. An arrival or failure probability is controlled only if its record belongs to the compared complete output.

No uniform table-generation algorithm, hardware synthesis rate, or detector implementation is hidden in (eq:channel-ledger). A channel-error bound also does not by itself prove exact causal containment of a faulty implementation.