Calculable lower bounds on the efficiency of universal sets of quantum gates

Currently available quantum computers, so called Noisy Intermediate-Scale Quantum devices, are characterized by relatively low number of qubits and moderate gate fidelities. In such scenario, the implementation of quantum error correction is impossible and the performance of those devices is quite modest. In particular, the depth of circuits implementable with reasonably high fidelity is limited, and the minimization of circuit depth is required. Such depths depend on the efficiency of the universal set of gates S used in computation, and can be bounded using the Solovay-Kitaev theorem. However, it is known that much better, asymptotically tight bounds of the form O (log(?(-1))), can be obtained for specific S. Those bounds are controlled by so called spectral gap, denoted gap(S). Yet, the computation of gap(S) is not possible for general S and in practice one considers spectral gap at a certain scale r(?), denoted gap(r)(S). This turns out to be sufficient to bound the efficiency of S provided that one is interested in a physically feasible case, in which an error epsilon is bounded from below. In this paper we derive lower bounds on gap(r)(S) and, as a consequence, on the efficiency of universal sets of d-dimensional quantum gates S satisfying an additional condition. The condition is naturally met for generic quantum gates, such as e.g. Haar random gates. Our bounds are explicit in the sense that all parameters can be determined by numerical calculations on existing computers, at least for small d. This is in contrast with known lower bounds on gap(r)(S) which involve parameters with ambiguous values.