Manuscript IX-B-ST@1 · IX-B-ST.tex · section · f6af1523

Resources and complete error accounting

Scheduled locality and buffered reference-preserving transport › Resources and complete error accounting · lines 2153–2202

Back to manuscript

Let $s$ be the report length and $w$ a reserved lookup-work size. One may take $b = m + g + 1 + s$ . A conservative finite ledger is

\toprule resource \midrule destructive clock catalogue score probe payload registers lookup work/report reserve retained history buffers history-copy operations payload exchanges history transmissions clock/probe readouts resets during the run \bottomrule reserve or count m qubits, one clock factor g classical bits 1 qubit (n + 1) p qubits w + s bits (n + 1) b bits nb n n m + 1 0

The canonical full-matrix implementation can additionally destructively read the $g$ catalogue names; those readouts are charged if that extension is used. A truth table requires finite storage proportional to the number of entries and their chosen finite report precision. Exact arbitrary real amplitudes are ideal matrix inputs, not claimed to have finite hardware descriptions.

Counting each classical storage bit conservatively as a basis-state qubit carrier gives

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

External reference storage is declared separately and is not silently omitted from the complete correctness statement. If local preprocessing takes $τ_{pre}$ , buffering takes $τ_{buf}$ , and one history-copy stage takes $τ_{copy} > 0$ , the route duration is

τ_{pre} + τ_{buf} + n τ_{copy} + 2 L .

The supported time window is chosen to contain this finite duration.

Displayed formulas in this passage

unlabeled · line 2158
$\toprule resource \midrule destructive clock catalogue score probe payload registers lookup work/report reserve retained history buffers history-copy operations payload exchanges history transmissions clock/probe readouts resets during the run \bottomrule reserve or count m qubits, one clock factor g classical bits 1 qubit (n + 1) p qubits w + s bits (n + 1) b bits nb n n m + 1 0$
unlabeled · line 2187
$Q_{peak} \leq m + g + 1 + (n + 1) p + w + s + (n + 1) b .$
unlabeled · line 2196
$τ_{pre} + τ_{buf} + n τ_{copy} + 2 L .$

Resources and complete error accounting

Displayed formulas in this passage

Nearby in this section