  We discuss a classical complexity of finite-dimensional unitary
transformations, which can been seen as a computable approximation of classical
descriptional complexity of a unitary transformation acting on a set of qubits.
