Effects of quantum resources and noise on the statistical complexity of quantum circuits

Abstract

Abstract We investigate how the addition of quantum resources changes the statistical complexity of quantum circuits by utilizing the framework of quantum resource theories. Measures of statistical complexity that we consider include the Rademacher complexity and the Gaussian complexity, which are well-known measures in computational learning theory that quantify the richness of classes of real-valued functions. We derive bounds for the statistical complexities of quantum circuits that have limited access to certain resources and apply our results to two special cases: (a) stabilizer circuits that are supplemented with a limited number of T gates and (b) instantaneous quantum polynomial-time Clifford circuits that are supplemented with a limited number of CCZ gates. We show that the increase in the statistical complexity of a quantum circuit when an additional quantum channel is added to it is upper bounded by the free robustness of the added channel. Moreover, as noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits, we also study the effects of noise on the Rademacher complexity of quantum circuits. Finally, we derive bounds for the generalization error associated with learning from training data arising from quantum circuits.