Fetching the paper…
Reading the bibliography…
Kearns' statistical query (SQ) oracle (STOC'93) lends a unifying perspective for most classical machine learning algorithms.
“A theory of the learnable”
Leslie. Valiant · 1984
Earlier work this paper cites.
“Efficient Noise-Tolerant Learning from Statistical Queries”
Michael Kearns · 1993
Earlier work this paper cites.
“Weakly learning DNF and characterizing statistical query learning using Fourier analysis”
Avrim Blum et al · 1994
Earlier work this paper cites.
“Poly-time universality and limitations of deep learning” arXiv:2001.02992
Emmanuel Abbe and Colin Sandon · 2001
Earlier work this paper cites.
“On Using Extended Statistical Queries to Avoid Membership Queries”
G. Goos, J. Hartmanis and J. van Leeuwen · 2001
Earlier work this paper cites.
“Quantum Statistical Query Learning”, 2020
Srinivasan Arunachalam, Alex. Grilo and Henry Yuen · 2002
Earlier work this paper cites.
“Improved simulation of stabilizer circuits”
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
“Lagrangian Representation for Fermionic Linear Optics”, 2004
Sergey Bravyi · 2004
Earlier work this paper cites.
“Statistical Queries and Statistical Algorithms: Foundations and Applications”, 2020
Lev Reyzin · 2004
Earlier work this paper cites.
“Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution”
Luca Trevisan, Madhur Tulsiani and Salil Vadhan · 2009
Earlier work this paper cites.
“Efficient Quantum State Tomography”, 2011
Marcus Cramer et al · 2011
Earlier work this paper cites.
“Gromov–Wasserstein Distances and the Metric Approach to Object Matching”
Facundo Mémoli · 2011
Earlier work this paper cites.
“Complex Spherical Designs and Codes”, 2011
Aidan Roy and Sho Suda · 2011
Earlier work this paper cites.
“Quantum Information-Geometry of Dissipative Quantum Phase Transitions”
Leonardo Banchi, Paolo Giorda and Paolo Zanardi · 2014
Earlier work this paper cites.
“A Quantum Approximate Optimization Algorithm”, 2014
Edward Farhi, Jeffrey Goldstone and Sam Gutmann · 2014
Earlier work this paper cites.
“Evolvability of Real Functions”
Paul Valiant · 2014
Earlier work this paper cites.
“Local random quantum circuits are approximate polynomial-designs”
Fernando… Brandao, Aram. Harrow and Michał Horodecki · 2016
Earlier work this paper cites.
“Distinguishing Quantum States Using Clifford Orbits”, 2016
Richard Kueng, Huangjun Zhu and David Gross · 2016
Earlier work this paper cites.
“The Clifford Group Fails Gracefully to Be a Unitary 4-Design”, 2016
Huangjun Zhu, Richard Kueng, Markus Grassl and David Gross · 2016
Earlier work this paper cites.
“The Shattered Gradients Problem: If resnets are the answer, then what is the question?”
David Balduzzi et al · 2017
Earlier work this paper cites.
“A general characterization of the statistical query complexity”
Vitaly Feldman · 2017
Earlier work this paper cites.
“Statistical algorithms and a lower bound for detecting planted cliques”
Vitaly Feldman et al · 2017
Cited alongside, same era.
“Variance in a Metric Space” Accessed July 21, 2023. https://golem.ph.utexas.edu/category/2017/02/variance_in_a_metric_space.html , 2017
Tom Leinster · 2017
Cited alongside, same era.
“Learning stabilizer states by Bell sampling”
Ashley Montanaro · 2017
Cited alongside, same era.
“Multiqubit Clifford Groups Are Unitary 3-Designs”
Huangjun Zhu · 2017
Cited alongside, same era.
“Shadow Tomography of Quantum States”, 2018
Scott Aaronson · 2018
Cited alongside, same era.
“Interactive Proofs for Verifying Machine Learning”, 2021, pp. 19
Shafi Goldwasser, Guy Rothblum, Jonathan Shafer and Amir Yehudayoff · 2021
Later among the works it cites.
“Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions”
Jonas Haferkamp and Nicholas Hunter-Jones · 2021
Later among the works it cites.
“Theory of Quantum System Certification: A Tutorial”
Martin Kliesch and Ingo Roth · 2021
Later among the works it cites.
“Quantum Local Differential Privacy and Quantum Statistical Query Model”, 2022
Armando Angrisani and Elham Kashefi · 2022
Later among the works it cites.
“Quantum Variational Algorithms Are Swamped with Traps”
Eric. Anschuetz and Bobak. Kiani · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vitaly Feldman, Will Perkins and Santosh Vempala · 2018
Cited alongside, same era.
“Fidelity Witnesses for Fermionic Quantum Simulations”
M. Gluza, M. Kliesch, J. Eisert and L. Aolita · 2018
Cited alongside, same era.
“Machine Learning Theory Lecture 20: Mirror Descent”, 2018, pp. 14
Nicholas Harvey · 2018
Cited alongside, same era.
“Barren Plateaus in Quantum Neural Network Training Landscapes”
Jarrod. McClean et al · 2018
Cited alongside, same era.
“Ergodic Theory”, 2018
Charles Walkden · 2018
Cited alongside, same era.
“Online Learning of Quantum States”
Scott Aaronson et al · 2019
Cited alongside, same era.
“Online convex optimization: algorithms, learning, and duality”, 2019
Victor Portella and Marcel de Carli · 2019
Cited alongside, same era.
Joao Basso, David Gamarnik, Song Mei and Leo Zhou · 2022
Later among the works it cites.
“Random quantum circuits are approximate unitary t t -designs in depth O ( n t 5 + o ( 1 ) ) O\left(nt^{5+o(1)}\right) ”
Jonas Haferkamp · 2022
Later among the works it cites.
“A single T T -gate makes distribution learning hard”
Marcel Hinsche et al · 2022
Later among the works it cites.
“Quantum Machine Learning beyond Kernel Methods”, 2022
Sofiene Jerbi et al · 2022
Later among the works it cites.
John Napp · 2022
Later among the works it cites.
“General Parameter-Shift Rules for Quantum Gradients”
David Wierichs, Josh Izaac, Cody Wang and Cedric-Yu Lin · 2022
Later among the works it cites.
“A Survey on the Complexity of Learning Quantum States”, 2023
Anurag Anshu and Srinivasan Arunachalam · 2023
Closest in time.
“Efficient Tomography of Non-Interacting Fermion States”, 2023
Scott Aaronson and Sabee Grewal · 2023
Closest in time.
“On the Role of Entanglement and Statistics in Learning”, 2023
Srinivasan Arunachalam, Vojtech Havlicek and Louis Schatzki · 2023
Closest in time.
“Learning Unitaries with Quantum Statistical Queries”, 2023
Armando Angrisani · 2023
Closest in time.
“Classical Verification of Quantum Learning”, 2023
Matthias. Caro et al · 2023
Closest in time.
“Shadows of Quantum Machine Learning”, 2023
Sofiene Jerbi et al · 2023
Closest in time.
“Free Fermion Distributions Are Hard to Learn”, 2023
Alexander Nietner · 2023
Closest in time.
“On the Average-Case Complexity of Learning Output Distributions of Quantum Circuits”, 2023
Alexander Nietner et al · 2023
Closest in time.
“Learning Quantum Processes with Quantum Statistical Queries”, 2023
Chirag Wadhwa and Mina Doosti · 2023
Closest in time.
“Equivalence of quantum barren plateaus to cost concentration and narrow gorges”
Andrew Arrasmith, Zoë Holmes, M Cerezo and Patrick Coles · 2058
Closest in time.