Fetching the paper…
Reading the bibliography…
In this work we make progress in understanding the relationship between learning models with access to entangled, separable and statistical measurements in the quantum statistical query (QSQ) model.
A theory of the learnable
Leslie G. Valiant · 1984
Earlier work this paper cites.
On the degree of boolean functions as real polynomials
Noam Nisan and Mario Szegedy · 1994
Earlier work this paper cites.
Learning DNF over the uniform distribution using a quantum example oracle
Nader H. Bshouty and Jeffrey C. Jackson · 1995
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
A Yu Kitaev · 1995
Earlier work this paper cites.
On the power of quantum computation
Daniel R Simon · 1997
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Michael Kearns · 1998
Earlier work this paper cites.
Normal subgroup reconstruction and quantum computation using group representations
Sean Hallgren, Alexander Russell, and Amnon Ta-Shma · 2000
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum, Adam Kalai, and Hal Wasserman · 2003
Earlier work this paper cites.
Generic quantum fourier transforms, 2003
Cristopher Moore, Daniel Rockmore, and Alexander Russell · 2003
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
C. A. Fuchs and J. van de Graaf · 2006
Earlier work this paper cites.
Entanglement and the foundations of statistical mechanics
Sandu Popescu, Anthony J. Short, and Andreas Winter · 2006
Earlier work this paper cites.
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
Pranab Sen · 2006
Earlier work this paper cites.
The symmetric group defies strong fourier sampling
Cristopher Moore, Alexander Russell, and Leonard J Schulman · 2008
Earlier work this paper cites.
Random quantum circuits are approximate 2-designs
Aram W. Harrow and Richard A. Low · 2009
Earlier work this paper cites.
The hidden subgroup problem, 2010
Frédéric Wang · 2010
Earlier work this paper cites.
Testing Fourier dimensionality and sparsity
P. Gopalan, R. O’Donnell, R. A. Servedio, A. Shpilka, and K. Wimmer · 2011
Earlier work this paper cites.
Learning DNF expressions from Fourier spectrum
V. Feldman · 2012
Earlier work this paper cites.
On the Complexity of Random Satisfiability Problems with Planted Solutions
Vitaly Feldman, Will Perkins, and Santosh Vempala · 2013
Earlier work this paper cites.
Quantum algorithms for supervised and unsupervised machine learning, 2013
S. Lloyd, M. Mohseni, and P. Rebentrost · 2013
Earlier work this paper cites.
Quantum support vector machine for big data classification
Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd · 2014
Earlier work this paper cites.
An introduction to quantum machine learning
Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione · 2015
Earlier work this paper cites.
A General Characterization of the Statistical Query Complexity
Vitaly Feldman · 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.
Efficient quantum tomography
Ryan O’Donnell and John Wright · 2016
Cited alongside, same era.
Guest column: A survey of quantum learning theory
Srinivasan Arunachalam and Ronald de Wolf · 2017
Cited alongside, same era.
Quantum machine learning
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd · 2017
Cited alongside, same era.
Statistical algorithms and a lower bound for detecting planted cliques
Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S Vempala, and Ying Xiao · 2017
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskil · 2020
Later among the works it cites.
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Later among the works it cites.
Two new results about quantum exact learning
Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald De Wolf · 2021
Later among the works it cites.
Exponential separations between learning with and without quantum memory
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li · 2021
Later among the works it cites.
Sample efficient algorithms for learning quantum channels in PAC model and the approximate state discrimination problem
Kai-Min Chung and Han-Hsuan Lin · 2021
Later among the works it cites.
Learnability of quantum neural networks
Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, Shan You, and Dacheng Tao · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Quantum recommendation systems
I. Kerenidis and A. Prakash · 2017
Cited alongside, same era.
Learning stabilizer states by bell sampling
Ashley Montanaro · 2017
Cited alongside, same era.
Error mitigation for short-depth quantum circuits
Kristan Temme, Sergey Bravyi, and Jay M Gambetta · 2017
Cited alongside, same era.
Shadow tomography of quantum states
Scott Aaronson · 2018
Cited alongside, same era.
Online learning of quantum states
Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, and Ashwin Nayak · 2018
Cited alongside, same era.
Optimal quantum sample complexity of learning algorithms
Srinivasan Arunachalam and Ronald de Wolf · 2018
Cited alongside, same era.
Later among the works it cites.
Optimal algorithms for learning quantum phase states
Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, and Theodore J Yoder · 2022
Later among the works it cites.
Quantum local differential privacy and quantum statistical query model
Armando Angrisani and Elham Kashefi · 2022
Later among the works it cites.
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
Nai-Hui Chia, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang · 2022
Later among the works it cites.
Challenges and opportunities in quantum machine learning
M Cerezo, Guillaume Verdon, Hsin-Yuan Huang, Lukasz Cincio, and Patrick J Coles · 2022
Later among the works it cites.
Towards quantum advantage via topological data analysis
Casper Gyurik, Chris Cade, and Vedran Dunjko · 2022
Later among the works it cites.
On the hardness of pac-learning stabilizer states with noise
Aravind Gollakota and Daniel Liang · 2022
Later among the works it cites.
Quantum advantage in learning from experiments
Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, et al · 2022
Later among the works it cites.
A single T T -gate makes distribution learning hard
Marcel Hinsche, Marios Ioannou, Alexander Nietner, Jonas Haferkamp, Yihui Quek, Dominik Hangleiter, Jean-Pierre Seifert, Jens Eisert, and Ryan Sweke · 2022
Later among the works it cites.
A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
Sam McArdle, András Gilyén, and Mario Berta · 2022
Later among the works it cites.
Exponentially tighter bounds on limitations of quantum error mitigation
Yihui Quek, Daniel Stilck França, Sumeet Khatri, Johannes Jakob Meyer, and Jens Eisert · 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.
Learning many-body hamiltonians with heisenberg-limited scaling
Hsin-Yuan Huang, Yu Tong, Di Fang, and Yuan Su · 2023
Closest in time.
On the average-case complexity of learning output distributions of quantum circuits, 2023
Alexander Nietner, Marios Ioannou, Ryan Sweke, Richard Keung, Jens Eisert, Marcel Hinsche, and Jonas Haferkamp · 2023
Closest in time.
Nengkun Yu and Tzu-Chieh Wei · 2023
Closest in time.