Fetching the paper…
Reading the bibliography…
In classical statistical learning theory, one of the most well studied problems is that of binary classification.
“Quantum hardness of learning shallow classical circuits”, 2019
S. Arunachalam, A.. Grilo and A. Sundaram · 1903
Earlier work this paper cites.
“A Mathematical Theory of Communication”
C.. Shannon · 1948
Earlier work this paper cites.
“On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities”
V.. Vapnik and A.. Chervonenkis · 1971
Earlier work this paper cites.
“A theory of the learnable”
L.. Valiant · 1972
Earlier work this paper cites.
“Statistical decision theory for quantum systems”
A.S Holevo · 1973
Earlier work this paper cites.
“Optimum testing of multiple hypotheses in quantum detection theory”
H. Yuen, R. Kennedy and M. Lax · 1975
Earlier work this paper cites.
“Learning From Noisy Examples”
D. Angluin and P. Laird · 1988
Earlier work this paper cites.
“Learning from Good and Bad Data” 47
P.. Laird · 1988
Earlier work this paper cites.
“Learnability and the Vapnik-Chervonenkis dimension”
A. Blumer, A. Ehrenfeucht, D. Haussler and M.. Warmuth · 1989
Earlier work this paper cites.
“Quantum complexity theory”
E. Bernstein and U. Vazirani · 1993
Earlier work this paper cites.
“On the sample complexity of noise-tolerant learning”
J.. Aslam and S.. Decatur · 1996
Earlier work this paper cites.
“Learning with Restricted Focus of Attention”
S. Ben-David and E. Dichterman · 1998
Earlier work this paper cites.
“Learning DNF over the Uniform Distribution Using a Quantum Example Oracle”
N.. Bshouty and J.. Jackson · 1998
Earlier work this paper cites.
“Sample-efficient strategies for learning in the presence of noise”
N. Cesa-Bianchi et al · 1999
Earlier work this paper cites.
“Rademacher and Gaussian Complexities: Risk Bounds and Structural Results”
P.. Bartlett and S. Mendelson · 2002
Earlier work this paper cites.
“Equivalences and Separations Between Quantum and Classical Learnability”
R.. Servedio and S.. Gortler · 2004
Cited alongside, same era.
“The learnability of quantum states”
S. Aaronson · 2007
Cited alongside, same era.
“Quantum Algorithms for Learning and Testing Juntas”
A. Atıcı and R.. Servedio · 2007
Cited alongside, same era.
“Quantum computation and quantum information”
M.. Nielsen and I.. Chuang · 2009
Cited alongside, same era.
“The mathematical language of quantum theory: From uncertainty to entanglement”
T. Heinosaari and M. Ziman · 2012
Cited alongside, same era.
“The quantum query complexity of learning multilinear polynomials”
A. Montanaro · 2012
Cited alongside, same era.
“Learning with Errors is easy with quantum samples”, 2017
A.. Grilo, I. Kerenidis and T. Zijlstra · 2017
Later among the works it cites.
“Demonstration of quantum advantage in machine learning”
D. Ristè et al · 2017
Later among the works it cites.
“Online learning of quantum states”
S. Aaronson et al · 2018
Later among the works it cites.
“Shadow Tomography of Quantum States”
S. Aaronson · 2018
Later among the works it cites.
“Optimal Quantum Sample Complexity of Learning Algorithms”
S. Arunachalam and R. de Wolf · 2018
Later among the works it cites.
“Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem”, 2018
K.-M. Chung and H.-H. Lin · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Learning with Noisy Labels”
N. Natarajan, I.. Dhillon, P. Ravikumar and A. Tewari · 2013
Cited alongside, same era.
“Quantum information theory”
M. Wilde · 2013
Cited alongside, same era.
“Understanding machine learning: From theory to algorithms”
S. Shalev-Shwartz and S. Ben-David · 2014
Cited alongside, same era.
“Quantum learning robust against noise”
A.. Cross, G. Smith and J.. Smolin · 2015
Cited alongside, same era.
“The learnability of unknown quantum measurements”
H.-C. Cheng, M.-H. Hsieh and P.-C. Yeh · 2016
Cited alongside, same era.
“The optimal sample complexity OF PAC learning”
S. Hanneke · 2016
Cited alongside, same era.
Later among the works it cites.
“High-dimensional probability: An introduction with applications in data science” 47
R. Vershynin · 2018
Later among the works it cites.
“The theory of quantum information”
J. Watrous · 2018
Later among the works it cites.
“Two New Results About Quantum Exact Learning”
S. Arunachalam et al · 2019
Later among the works it cites.
“Finite Correlation Length Implies Efficient Preparation of Quantum Thermal States”
Brandão, F. G. S. L. and M.. Kastoryano · 2019
Later among the works it cites.
“Learning DNFs under product distributions via μ \mu -biased quantum Fourier sampling”
V. Kanade, A. Rocchetto and S. Severini · 2019
Later among the works it cites.
“Quantum statistical query learning”, 2020
S. Arunachalam, A.. Grilo and H. Yuen · 2020
Closest in time.
“Quantum learning Boolean linear functions w.r.t. product distributions”
M.. Caro · 2020
Closest in time.
“A Variational Quantum Algorithm for Preparing Quantum Gibbs States”, 2020
A.. Chowdhury, G.. Low and N. Wiebe · 2020
Closest in time.