Rademacher complexity of noisy quantum circuits
arXiv:2103.03139
Abstract
Noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits. In this work, we study the effects of noise on the Rademacher complexity of quantum circuits, which is a measure of statistical complexity that quantifies the richness of classes of functions generated by these circuits. We consider noise models that are represented by convex combinations of unitary channels and provide both upper and lower bounds for the Rademacher complexities of quantum circuits characterized by these noise models. In particular, we find a lower bound for the Rademacher complexity of noisy quantum circuits that depends on the Rademacher complexity of the corresponding noiseless quantum circuit as well as the free robustness of the circuit. Our results show that the Rademacher complexity of quantum circuits decreases with the increase in noise.
arXiv comment7 pages
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Error mitigation for short-depth quantum circuits
- Quantum Resource Theories
- Quantum-enhanced machine learning
- Application of a resource theory for magic states to fault-tolerant quantum computing
- 2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization
- A mathematical theory of resources
- Information-theoretic bounds on quantum advantage in machine learning
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- On the statistical complexity of quantum circuits
- Efficient classical simulation of Clifford circuits with nonstabilizer input states
- Efficient classical simulation of noisy quantum computation