Quantum hardness of learning shallow classical circuits

v1v2 (latest)

Quantum hardness of learning shallow classical circuits

7 March 2019

Srinivasan Arunachalam

Aarthi Sundaram

ArXiv (abs)PDF HTML

Papers citing "Quantum hardness of learning shallow classical circuits"

11 / 11 papers shown

Title
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Bill Fefferman Soumik Ghosh Makrand Sinha Henry Yuen 66 0 0 21 Apr 2025
An unconditional distribution learning advantage with shallow quantum circuits N. Pirnay S. Jerbi J. -P. Seifert J. Eisert 139 1 0 23 Nov 2024
Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness Chirag Wadhwa Mina Doosti 128 1 0 20 May 2024
On the average-case complexity of learning output distributions of quantum circuits A. Nietner M. Ioannou R. Sweke R. Kueng Jens Eisert M. Hinsche J. Haferkamp 69 12 0 09 May 2023
On establishing learning separations between classical and quantum machine learning with classical data Casper Gyurik Vedran Dunjko 64 15 0 12 Aug 2022
$Clifford Circuits can be Properly PAC Learned if and only if $\textsf{RP}=\textsf{NP}$$ Clifford Circuits can be Properly PAC Learned if and only if $\textsf{RP}=\textsf{NP}$ Daniel Liang 51 4 0 13 Apr 2022
Quantum learning algorithms imply circuit lower bounds Srinivasan Arunachalam A. Grilo Tom Gur I. Oliveira Aarthi Sundaram 48 8 0 03 Dec 2020
Binary Classification with Classical Instances and Quantum Labels Matthias C. Caro 33 4 0 10 Jun 2020
The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine Brian Coyle Daniel Mills V. Danos E. Kashefi 106 158 0 03 Apr 2019
Quantum Learning Boolean Linear Functions w.r.t. Product Distributions Matthias C. Caro 77 7 0 23 Feb 2019
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem Kai-Min Chung Han-Hsuan Lin 86 32 0 25 Oct 2018