Fetching the paper…
Reading the bibliography…
We generalize the PAC (probably approximately correct) learning model to the quantum world by generalizing the concepts from classical functions to quantum processes, defining the problem of \emph{PAC learning quantum process}, and study its sample complexity.
A theory of the learnable
Leslie G. Valiant · 1984
Earlier work this paper cites.
Occam’s razor
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1987
Earlier work this paper cites.
Learnability and the vapnik-chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1989
Earlier work this paper cites.
On learning sets and functions
Balas K Natarajan · 1989
Earlier work this paper cites.
Decision theoretic generalizations of the PAC model for neural net and other learning applications
David Haussler · 1992
Earlier work this paper cites.
Efficient distribution-free learning of probabilistic concepts
Michael J Kearns and Robert E Schapire · 1994
Earlier work this paper cites.
Toward efficient agnostic learning
Michael J. Kearns, Robert E. Schapire, and Linda Sellie · 1994
Earlier work this paper cites.
An Introduction to Computational Learning Theory
Michael J. Kearns and Umesh V. Vazirani · 1994
Earlier work this paper cites.
Characterizations of learnability for classes of { 0 , … , n } \{0,...,n\} -valued functions
Shai Bendavid, Nicolo Cesabianchi, David Haussler, and Philip M Long · 1995
Earlier work this paper cites.
Fat-shattering and the learnability of real-valued functions
Peter L Bartlett, Philip M Long, and Robert C Williamson · 1996
Earlier work this paper cites.
Scale-sensitive dimensions, uniform convergence, and learnability
Noga Alon, Shai Ben-David, Nicolo Cesa-Bianchi, and David Haussler · 1997
Earlier work this paper cites.
Quantum state discrimination
Anthony Chefles · 2000
Earlier work this paper cites.
Reversing quantum dynamics with near-optimal quantum and classical fidelity
Howard Barnum and Emanuel Knill · 2002
Earlier work this paper cites.
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Pranab Sen · 2005
Cited alongside, same era.
On the distinguishability of random quantum states
Ashley Montanaro · 2006
Cited alongside, same era.
The learnability of quantum states
Scott Aaronson · 2007
Cited alongside, same era.
A lower bound on the probability of error in quantum state discrimination
Ashley Montanaro · 2008
Cited alongside, same era.
Quantum-process tomography: Resource analysis of different strategies
Masoud Mohseni, AT Rezakhani, and DA Lidar · 2008
Cited alongside, same era.
Quantum state discrimination
Stephen M Barnett and Sarah Croke · 2009
Cited alongside, same era.
Efficient quantum tomography
Ryan O’Donnell and John Wright · 2016
Later among the works it cites.
Guest column: A survey of quantum learning theory
Srinivasan Arunachalam and Ronald de Wolf · 2017
Later among the works it cites.
Optimal quantum sample complexity of learning algorithms
Srinivasan Arunachalam and Ronald de Wolf · 2017
Later among the works it cites.
Quantum state discrimination and its applications
Joonwoo Bae and Leong-Chuan Kwek · 2017
Later among the works it cites.
Costin Bădescu, Ryan O’Donnell, and John Wright · 2017
Later among the works it cites.
Sequential measurements, disturbance and property testing
Aram W Harrow, Cedric Yen-Yu Lin, and Ashley Montanaro · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
How many copies are needed for state discrimination?
Aram W Harrow and Andreas Winter · 2012
Cited alongside, same era.
Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
Koenraad MR Audenaert and Milán Mosonyi · 2014
Cited alongside, same era.
The learnability of unknown quantum measurements
Hao-Chung Cheng, Min-Hsiu Hsieh, and Ping-Cheng Yeh · 2015
Cited alongside, same era.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 2015
Cited alongside, same era.
The optimal sample complexity of pac learning
Steve Hanneke · 2016
Cited alongside, same era.
Sample-optimal tomography of quantum states
Jeongwan Haah, Aram W. Harrow, Zhengfeng Ji, Xiaodi Wu, and Nengkun Yu · 2016
Cited alongside, same era.
Shadow tomography of quantum states
Scott Aaronson · 2018
Closest in time.
Quantum hypothesis testing and state discrimination
J. Prabhu Tej, Syed Raunaq Ahmed, A. R. Usha Devi, and A. K. Rajagopal · 2018
Closest in time.
Quantum hardness of learning shallow classical circuits
Srinivasan Arunachalam, Alex B Grilo, and Aarthi Sundaram · 2019
Closest in time.
Improved quantum data analysis
Costin Bădescu and Ryan O’Donnell · 2020
Closest in time.
Quantum algorithmic measurement
Dorit Aharonov, Jordan Cotler, and Xiao-Liang Qi · 2021
Closest in time.
Information-theoretic bounds on quantum advantage in machine learning
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2021
Closest in time.