Effects of quantum resources on the statistical complexity of quantum circuits

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: (1) stabilizer circuits that are supplemented with a limited number of T gates and (2) 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. Finally, we derive bounds for the generalization error associated with learning from training data arising from quantum circuits.

6+6 pages

References in corpus (12)

• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Exploring Generalization in Deep Learning
• Matchgates and classical simulation of quantum circuits
• Quantifying Superposition
• Norm-Based Capacity Control in Neural Networks
• On the statistical complexity of quantum circuits
• Computational power of matchgates with supplementary resources
• Depth-Width Trade-offs for Neural Networks via Topological Entropy

Cited by in corpus (8)

• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Understanding quantum machine learning also requires rethinking generalization
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Magic Resource Can Enhance the Quantum Capacity of Channels
• Statistical Complexity of Quantum Learning
• Magic of Random Matrix Product States
• Coherence and Imaginarity as Resources in Quantum Circuit Complexity