Pseudo-dimension of quantum circuits

02/04/2020
by   Matthias C. Caro, et al.
0

We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of quantum circuits; the upper bounds are polynomial in circuit depth and number of gates. Using these bounds, we exhibit a class of circuit output states out of which at least one has exponential state complexity, and moreover demonstrate that quantum circuits of known polynomial size and depth are PAC-learnable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2022

A learning theory for quantum photonic processors and beyond

We consider the tasks of learning quantum states, measurements and chann...
research
06/23/2021

Learning quantum circuits of some T gates

In this paper, we study the problem of learning quantum circuits of a ce...
research
07/19/2021

Sample Complexity of Learning Quantum Circuits

Quantum computers hold unprecedented potentials for machine learning app...
research
01/01/2021

Simulating Quantum Computations with Tutte Polynomials

We establish a classical heuristic algorithm for exactly computing quant...
research
05/09/2020

Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions

Effective quantum computation relies upon making good use of the exponen...
research
04/26/2022

Complexity of quantum circuits via sensitivity, magic, and coherence

Quantum circuit complexity-a measure of the minimum number of gates need...
research
09/11/2023

Circuit complexity and functionality: a thermodynamic perspective

We explore a link between complexity and physics for circuits of given f...

Please sign up or login with your details

Forgot password? Click here to reset