Definition: Length-uniform polynomial family

A circuit family is length-uniform if one deterministic classical algorithm receives only $1^{\ell }$ and prints the circuit for all $\ell$-bit inputs in time polynomial in $\ell$. Polynomial resources mean that one fixed polynomial $P$ bounds both its gate count and its allocated qubit count for every $\ell$.