On the statistical complexity of quantum circuits

by   Kaifeng Bu, et al.

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.


page 3

page 4


Effects of quantum resources on the statistical complexity of quantum circuits

We investigate how the addition of quantum resources changes the statist...

Circuit Complexity From Supersymmetric Quantum Field Theory With Morse Function

Computation of circuit complexity has gained much attention in the Theor...

Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs

The classical (parallel) black pebbling game is a useful abstraction whi...

ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach

In this research we present a quantum circuit for estimating algorithmic...

Complexity for deep neural networks and other characteristics of deep feature representations

We define a notion of complexity, motivated by considerations of circuit...

Visualizing Quantum Circuit Probability – estimating computational action for quantum program synthesis

This research applies concepts from algorithmic probability to Boolean a...

Computing the gradients with respect to all parameters of a quantum neural network using a single circuit

When computing the gradients of a quantum neural network using the param...

Please sign up or login with your details

Forgot password? Click here to reset