On the average-case complexity of learning output distributions of quantum circuits
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908587836571648 |
|---|---|
| author | Nietner, Alexander Ioannou, Marios Sweke, Ryan Kueng, Richard Eisert, Jens Hinsche, Marcel Haferkamp, Jonas |
| author_facet | Nietner, Alexander Ioannou, Marios Sweke, Ryan Kueng, Richard Eisert, Jens Hinsche, Marcel Haferkamp, Jonas |
| contents | In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely used as an abstract computational model for most generic learning algorithms. In particular, for brickwork random quantum circuits on $n$ qubits of depth $d$, we show three main results:
- At super logarithmic circuit depth $d=ω(\log(n))$, any learning algorithm requires super polynomially many queries to achieve a constant probability of success over the randomly drawn instance.
- There exists a $d=O(n)$, such that any learning algorithm requires $Ω(2^n)$ queries to achieve a $O(2^{-n})$ probability of success over the randomly drawn instance.
- At infinite circuit depth $d\to\infty$, any learning algorithm requires $2^{2^{Ω(n)}}$ many queries to achieve a $2^{-2^{Ω(n)}}$ probability of success over the randomly drawn instance.
As an auxiliary result of independent interest, we show that the output distribution of a brickwork random quantum circuit is constantly far from any fixed distribution in total variation distance with probability $1-O(2^{-n})$, which confirms a variant of a conjecture by Aaronson and Chen. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_05765 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the average-case complexity of learning output distributions of quantum circuits Nietner, Alexander Ioannou, Marios Sweke, Ryan Kueng, Richard Eisert, Jens Hinsche, Marcel Haferkamp, Jonas Quantum Physics Computational Complexity Machine Learning In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely used as an abstract computational model for most generic learning algorithms. In particular, for brickwork random quantum circuits on $n$ qubits of depth $d$, we show three main results: - At super logarithmic circuit depth $d=ω(\log(n))$, any learning algorithm requires super polynomially many queries to achieve a constant probability of success over the randomly drawn instance. - There exists a $d=O(n)$, such that any learning algorithm requires $Ω(2^n)$ queries to achieve a $O(2^{-n})$ probability of success over the randomly drawn instance. - At infinite circuit depth $d\to\infty$, any learning algorithm requires $2^{2^{Ω(n)}}$ many queries to achieve a $2^{-2^{Ω(n)}}$ probability of success over the randomly drawn instance. As an auxiliary result of independent interest, we show that the output distribution of a brickwork random quantum circuit is constantly far from any fixed distribution in total variation distance with probability $1-O(2^{-n})$, which confirms a variant of a conjecture by Aaronson and Chen. |
| title | On the average-case complexity of learning output distributions of quantum circuits |
| topic | Quantum Physics Computational Complexity Machine Learning |
| url | https://arxiv.org/abs/2305.05765 |