Anyon compiler resource ledger

For a finite anyon solver instance and one run, record separately the tuple $(L_{\mathrm{i}\mathrm{n}},N_{\mathrm{a}\mathrm{n}\mathrm{y}},\mathrm{\mid }b\mathrm{\mid },N_{\mathrm{p}\mathrm{r}\mathrm{e}\mathrm{p}},N_{\mathrm{a}\mathrm{n}\mathrm{c}},N_{\mathrm{m}\mathrm{e}\mathrm{a}\mathrm{s}},B_{\mathrm{o}\mathrm{u}\mathrm{t}},b_{\max },t_{\mathrm{c}\mathrm{l}},T_H,{ϵ}_{\mathrm{o}\mathrm{p}},{ϵ}_{\mathrm{t}\mathrm{r}},{ϵ}_{\mathrm{m}\mathrm{e}\mathrm{a}\mathrm{s}},{\mathrm{\ell }}_{\mathrm{l}\mathrm{e}\mathrm{a}\mathrm{k}},p_{\mathrm{l}\mathrm{e}\mathrm{a}\mathrm{k}},N_{\mathrm{p}\mathrm{h}\mathrm{a}\mathrm{s}\mathrm{e}},t_{\mathrm{p}\mathrm{h}\mathrm{a}\mathrm{s}\mathrm{e}},{\mathsf{C}}_{\mathrm{c}\mathrm{i}\mathrm{r}\mathrm{c}},N_{\mathrm{n}\mathrm{o}\mathrm{n}\mathrm{o}\mathrm{r}\mathrm{a}\mathrm{c}\mathrm{l}\mathrm{e}})\mathrm{.}$ Here $L_{\mathrm{i}\mathrm{n}}$ is the complete finite classical input-description bit length, including the declared task, state/preparation descriptions when classically encoded, and tolerance descriptions; a directly supplied quantum input is not assumed to have a finite classical coordinate description; $N_{\mathrm{a}\mathrm{n}\mathrm{y}}$ is the number of ordered simple-charge strand labels in the fusion-space instance; and $\mathrm{\mid }b\mathrm{\mid }$ is the number of braid-generator occurrences (inverse generators count as one). $N_{\mathrm{p}\mathrm{r}\mathrm{e}\mathrm{p}}$ counts elementary operations in the declared preparation procedure, while $N_{\mathrm{a}\mathrm{n}\mathrm{c}}$ counts the ancillary anyons or other physical ancilla systems used by preparation or computation. If the initial state is supplied directly as an abstract quantum input with no preparation interface, $N_{\mathrm{p}\mathrm{r}\mathrm{e}\mathrm{p}}$ is “not applicable”, not silently set to zero; $N_{\mathrm{a}\mathrm{n}\mathrm{c}}$ still records any declared solver ancillas (zero if none, or “not applicable” if no physical ancilla model is supplied). $N_{\mathrm{m}\mathrm{e}\mathrm{a}\mathrm{s}}$ is the number of fusion measurements, and $B_{\mathrm{o}\mathrm{u}\mathrm{t}}$ is the total bit length of their classical outcome record under its declared finite encoding (zero when no measurement occurs). The largest unary precision query to a certified matrix name is $b_{\max }$; $t_{\mathrm{c}\mathrm{l}}$ is the classical bit time used by search and postprocessing. $T_H$ is the total Hamiltonian evolution time over the run in the declared physical time unit; it is “not applicable” for an abstract braid-only model without Hamiltonian evolution. The error coordinates ${ϵ}_{\mathrm{o}\mathrm{p}},{ϵ}_{\mathrm{t}\mathrm{r}},{ϵ}_{\mathrm{m}\mathrm{e}\mathrm{a}\mathrm{s}},{\mathrm{\ell }}_{\mathrm{l}\mathrm{e}\mathrm{a}\mathrm{k}},p_{\mathrm{l}\mathrm{e}\mathrm{a}\mathrm{k}}$ are respectively a stated operator-norm approximation bound, an independent in-band transport bound, an implementation-to-ideal-measurement total-variation bound, and leakage amplitude and probability bounds. $N_{\mathrm{p}\mathrm{h}\mathrm{a}\mathrm{s}\mathrm{e}},t_{\mathrm{p}\mathrm{h}\mathrm{a}\mathrm{s}\mathrm{e}}$ count phase corrections and their classical control cost. ${\mathsf{C}}_{\mathrm{c}\mathrm{i}\mathrm{r}\mathrm{c}}$ is the complete applicable circuit cost record of Circuit-family and computation cost model, including description length $L(C)$, gate count $g(C)$, minimum-layer depth $d(C)$, wire count $w(C)$, declared clean/dirty ancilla counts, generator and acceptance costs, each named oracle's query count, and tolerance encoding. $N_{\mathrm{n}\mathrm{o}\mathrm{n}\mathrm{o}\mathrm{r}\mathrm{a}\mathrm{c}\mathrm{l}\mathrm{e}}$ counts all declared elementary nonoracle gates, including preparation and computation, as in Nonoracle quantum gate cost. For an adaptive solver, declare the branch convention and report worst-case branch costs; for a single circuit use that circuit's record. These coordinates may overlap $N_{\mathrm{p}\mathrm{r}\mathrm{e}\mathrm{p}}$ and $N_{\mathrm{a}\mathrm{n}\mathrm{c}}$; they are separate reported resources, not disjoint summands to be added. Without a circuit implementation interface, ${\mathsf{C}}_{\mathrm{c}\mathrm{i}\mathrm{r}\mathrm{c}}$ and $N_{\mathrm{n}\mathrm{o}\mathrm{n}\mathrm{o}\mathrm{r}\mathrm{a}\mathrm{c}\mathrm{l}\mathrm{e}}$ are “not applicable”. Classical input bit cost follows Classical bit-operation cost and finite nonoracle gates follow Nonoracle quantum gate cost. An inapplicable coordinate is marked “not applicable”; it is not assigned value zero. Unless an interface explicitly states a bound, no braid length, preparation operation, ancilla, matrix precision, measurement, Hamiltonian time, search step, or phase correction is free. The tuple is a bookkeeping convention; it does not assert any of its error or runtime bounds.