Nonoracle quantum gate cost

Given the circuit-family model and cost record in Circuit-family and computation cost model and elementary gate alphabet in Finite circuit resource accounting, a query circuit Quantum query algorithm has nonoracle gate cost equal to the maximum number of elementary gates outside designated black-box query calls on any branch. It counts preparation gates, ancilla operations, inverse gates, and every other stated nonoracle gate, including identity operations if the declared syntax counts them. It does not count a black-box query as an elementary gate; if the oracle is implemented from a supplied circuit, that implementation's gates are charged under the declared resource model.

Non-input registers start in $\mathrm{\mid }0⟩$. Any nonzero initial state or data-access resource must name its preparation/access model and charge that cost. Measurements, classical feed-forward, circuit-description length, and classical bit operations are reported in the selected QC resource convention rather than silently assigned zero cost. Query count and gate count are separate coordinates.