Manuscript IX-A-ST@1 · IX-A-ST.tex · section · 6e99d1b2

Resource and error ledger

Scheduled locality and regular causal transport › Resource and error ledger · lines 1997–2032

IX-A-ST@1#eq:peak

With $w$ clean lookup-work bits, sufficient reserves are

\toprule resource \midrule single destructive clock catalogue input diagnostic probe payload registers lookup work and report reserve complete record copies record-copy operations payload exchanges record transmissions destructive readouts resets during the run \bottomrule reserve m qubits g classical bits 1 qubit (n + 1) p qubits w + s bits (n + 1) k bits nk CNOTs n block SWAPs n m + 1 0

If every classical storage bit is conservatively represented by a basis-state qubit carrier, a sufficient peak bound is

Q_{peak} \leq m + g + 1 + (n + 1) p + w + s + (n + 1) k .

Classical table storage, installed matrix descriptions, and finite local programme counters are additional declared resources. A truth table for an $s$ -bit report needs at most $s 2^{m + g}$ output bits before instruction overhead. No bound on description complexity of arbitrary exact real probe amplitudes is asserted.

Displayed formulas in this passage

IX-A-ST@1#eq:peak · line 2021
$Q_{peak} \leq m + g + 1 + (n + 1) p + w + s + (n + 1) k .$
unlabeled · line 2000
$\toprule resource \midrule single destructive clock catalogue input diagnostic probe payload registers lookup work and report reserve complete record copies record-copy operations payload exchanges record transmissions destructive readouts resets during the run \bottomrule reserve m qubits g classical bits 1 qubit (n + 1) p qubits w + s bits (n + 1) k bits nk CNOTs n block SWAPs n m + 1 0$

Resource and error ledger

Displayed formulas in this passage

Nearby in this section