On the statistical complexity of quantum circuits

Abstract

In theoretical machine learning, the statistical complexity is a notion that measures the richness of a hypothesis space. In this work, we apply a particular measure of statistical complexity, namely the Rademacher complexity, to the quantum circuit model in quantum computation and study how the statistical complexity depends on various quantum circuit parameters. In particular, we investigate the dependence of the statistical complexity on the resources, depth, width, and the number of input and output registers of a quantum circuit. To study how the statistical complexity scales with resources in the circuit, we introduce a resource measure of magic based on the $(p,q)$ group norm, which quantifies the amount of magic in the quantum channels associated with the circuit. These dependencies are investigated in the following two settings: (i) where the entire quantum circuit is treated as a single quantum channel, and (ii) where each layer of the quantum circuit is treated as a separate quantum channel. The bounds we obtain can be used to constrain the capacity of quantum neural networks in terms of their depths and widths as well as the resources in the network.

6+19 pages

References in corpus (6)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Variational Quantum Algorithms
• Quantum computational advantage using photons
• The quest for a Quantum Neural Network
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Framed Hilbert space: hanging the quasi-probability pictures of quantum theory

Cited by in corpus (27)

• Generalization in quantum machine learning from few training data
• Efficient measure for the expressivity of variational quantum algorithms
• Recent advances for quantum classifiers
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Understanding quantum machine learning also requires rethinking generalization
• Out-of-distribution generalization for learning quantum dynamics
• Quantum Entropy and Central Limit Theorem
• Dynamical simulation via quantum machine learning with provable generalization
• Structural risk minimization for quantum linear classifiers
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Circuit complexity of quantum access models for encoding classical data
• Magic Resource Can Enhance the Quantum Capacity of Channels
• Effects of quantum resources on the statistical complexity of quantum circuits
• Statistical Complexity of Quantum Learning
• Magic of Random Matrix Product States
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• Expressivity of Variational Quantum Machine Learning on the Boolean Cube
• The dilemma of quantum neural networks
• Rademacher complexity of noisy quantum circuits
• Quantum Ruzsa Divergence to Quantify Magic
• Encoding-dependent generalization bounds for parametrized quantum circuits
• Coherence and Imaginarity as Resources in Quantum Circuit Complexity
• Learning Fourier series with parametrized quantum circuits
• On the Hardness of Measuring Magic
• Predictive complexity of quantum subsystems