Manuscript VIII-ST@1 · VIII-ST.tex · section · fe979f3b

Resource ledger

A regular buffered clock–certificate transport realization › Resource ledger · lines 2377–2437

VIII-ST@1#eq:peak

For $q_{M}$ source qubits and a $p$ -qubit payload, sufficient reserves are:

\toprule resource \midrule source register payload registers single destructive clock description snapshots clean command work sender clock record receiver-side history buffers command gates classical copying gates payload exchanges classical packet transmissions clock destructive readouts resets during the run retained complete classical histories \bottomrule reserve or count q_{M} qubits (n + 1) p qubits 3 qubits 6 B bits B bits 3 bits n K bits \leq 5 G_{B} n K CNOTs n block SWAPs n 30 n + 1

If all classical storage is represented by basis-state qubit carriers, a conservative peak is

Q_{peak} \leq q_{M} + (n + 1) p + 7 B + 6 + n K .

The extra six reserves both clock inputs and its record at the peak without optimizing their overlap. A block SWAP consists of $p$ qubit exchanges if that is the primitive interface.

For completeness, set

b_{ctl} = ⌈ lo g_{2} (5 G_{B} + K + n + 16) ⌉ .

One $b_{ctl}$ -bit local counter per station suffices to index its finite gate/copy/communication programme. A finite explicit ROM reserve can be chosen as

5 B 2^{B} + (n + 1) (5 G_{B} + K + n + 16) (4 + 3 b_{ctl})

bits. These instructions and counters are classical inputs and must be present before use. No remote instantaneous global counter is required.

All blanks, copied records, histories, and work are charged. Reference storage is external and is not charged as laboratory storage. No thermal reset cost, energy budget, or Landauer cost is deduced from this channel ledger.

Displayed formulas in this passage

VIII-ST@1#eq:peak · line 2405
$Q_{peak} \leq q_{M} + (n + 1) p + 7 B + 6 + n K .$
unlabeled · line 2381
$\toprule resource \midrule source register payload registers single destructive clock description snapshots clean command work sender clock record receiver-side history buffers command gates classical copying gates payload exchanges classical packet transmissions clock destructive readouts resets during the run retained complete classical histories \bottomrule reserve or count q_{M} qubits (n + 1) p qubits 3 qubits 6 B bits B bits 3 bits n K bits \leq 5 G_{B} n K CNOTs n block SWAPs n 30 n + 1$
unlabeled · line 2416
$b_{ctl} = ⌈ lo g_{2} (5 G_{B} + K + n + 16) ⌉ .$
unlabeled · line 2423
$5 B 2^{B} + (n + 1) (5 G_{B} + K + n + 16) (4 + 3 b_{ctl})$