Fetching the paper…
Reading the bibliography…
Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML).
J. A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal 7
1965
Earlier work this paper cites.
V. N. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Th. Prob. App. 16
1971
Earlier work this paper cites.
L. G. Valiant, A theory of the learnable, Communications of the ACM 27
1984
Earlier work this paper cites.
L. Y. Pratt, J. Mostow, C. A. Kamm, A. A. Kamm, et al. , Direct transfer of learned information among neural networks., in Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91) , Vol. 2 (1991) pp. 584–589
1991
Earlier work this paper cites.
E. Knill and R. Laflamme, Power of one bit of quantum information, Physical Review Letters 81
1998
Earlier work this paper cites.
H. Shimodaira, Improving predictive inference under covariate shift by weighting the log-likelihood function, Journal of statistical planning and inference 90
2000
Earlier work this paper cites.
H. Buhrman, R. Cleve, J. Watrous, and R. De Wolf, Quantum fingerprinting, Physical Review Letters 87
2001
Earlier work this paper cites.
D. Gottesman and I. Chuang, Quantum digital signatures, arXiv preprint quant-ph/0105032 (2001)
2001
Earlier work this paper cites.
M. A. Nielsen, A simple formula for the average gate fidelity of a quantum dynamical operation, Physics Letters A 303
2002
Earlier work this paper cites.
F. Vatan and C. Williams, Optimal quantum circuits for general two-qubit gates, Physical Review A 69
2004
Earlier work this paper cites.
V. V. Shende, I. L. Markov, and S. S. Bullock, Minimal universal two-qubit controlled-not-based circuits, Physical Review A 69
2004
Earlier work this paper cites.
R. R. Tucci, An Introduction to Cartan’s KAK Decomposition for QC Programmers, arXiv:quant-ph/0507171 (2005)
2005
Earlier work this paper cites.
D. Gross, K. Audenaert, and J. Eisert, Evenly distributed unitaries: On the structure of unitary designs, Journal of mathematical physics 48
2007
Earlier work this paper cites.
J. Quiñonero-Candela, M. Sugiyama, A. Schwaighofer, and N. D. Lawrence, Dataset Shift in Machine Learning (MIT Press, 2008)
2008
Earlier work this paper cites.
S. J. Pan and Q. Yang, A survey on transfer learning, IEEE Transactions on knowledge and data engineering 22
2009
Earlier work this paper cites.
C. B. Mendl and M. M. Wolf, Unital quantum channels–convex structure and revivals of Birkhoff’s theorem, Communications in Mathematical Physics 289
2009
Earlier work this paper cites.
N. Wiebe, C. Granade, C. Ferrie, and D. Cory, Quantum Hamiltonian learning using imperfect quantum resources, Physical Review A 89
2014
Earlier work this paper cites.
M. Schuld, I. Sinayskiy, and F. Petruccione, An introduction to quantum machine learning, Contemporary Physics 56
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
F. G. Brandao, A. W. Harrow, and M. Horodecki, Local random quantum circuits are approximate polynomial-designs, Communications in Mathematical Physics 346
2016
Earlier work this paper cites.
Z. Webb, The clifford group forms a unitary 3-design, Quantum Information and Computation 16
2016
Earlier work this paper cites.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549
2017
Earlier work this paper cites.
C. L. Degen, F. Reinhard, and P. Cappellaro, Quantum sensing, Rev. Mod. Phys. 89
2017
Earlier work this paper cites.
J. Wang, S. Paesani, R. Santagati, S. Knauer, A. A. Gentile, N. Wiebe, M. Petruzzella, J. L. O’Brien, J. G. Rarity, A. Laing, and M. G. Thompson, Experimental quantum Hamiltonian learning, Nature Physics 13
2017
Earlier work this paper cites.
D. A. Roberts and B. Yoshida, Chaos and complexity by design, Journal of High Energy Physics 2017
2017
Earlier work this paper cites.
H. Zhu, Multiqubit clifford groups are unitary 3-designs, Physical Review A 96
2017
Earlier work this paper cites.
J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
S. Khatri, R. LaRose, A. Poremba, L. Cincio, A. T. Sornborger, and P. J. Coles, Quantum-assisted quantum compiling, Quantum 3
2019
Cited alongside, same era.
2019
D. Stilck França and R. Garcia-Patron, Limitations of optimization algorithms on noisy quantum devices, Nature Physics 17
2021
Later among the works it cites.
M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, Cost function dependent barren plateaus in shallow parametrized quantum circuits, Nature Communications 12
2021
Later among the works it cites.
L. Cincio, K. Rudinger, M. Sarovar, and P. J. Coles, Machine learning of noise-resilient quantum circuits, PRX Quantum 2
2021
Later among the works it cites.
R. Harper, W. Yu, and S. T. Flammia, Fast estimation of sparse quantum noise, PRX Quantum 2
2021
Later among the works it cites.
S. T. Flammia and R. O’Donnell, Pauli error estimation via population recovery, Quantum 5
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. C. Caro and I. Datta, Pseudo-dimension of quantum circuits, Quantum Machine Intelligence 2
2020
Cited alongside, same era.
K. Sharma, S. Khatri, M. Cerezo, and P. J. Coles, Noise resilience of variational quantum compiling, New Journal of Physics 22
2020
Cited alongside, same era.
C. Cirstoiu, Z. Holmes, J. Iosue, L. Cincio, P. J. Coles, and A. Sornborger, Variational fast forwarding for quantum simulation beyond the coherence time, npj Quantum Information 6
2020
Cited alongside, same era.
W.-T. Kuo, A. Akhtar, D. P. Arovas, and Y.-Z. You, Markovian entanglement dynamics under locally scrambled quantum evolution, Physical Review B 101
2020
Cited alongside, same era.
R. Belyansky, P. Bienias, Y. A. Kharkov, A. V. Gorshkov, and B. Swingle, Minimal model for fast scrambling, Physical Review Letters 125
2020
Cited alongside, same era.
H.-Y. Huang, R. Kueng, and J. Preskill, Predicting many properties of a quantum system from very few measurements, Nature Physics 16
2020
Cited alongside, same era.
S. T. Flammia and J. J. Wallman, Efficient estimation of pauli channels, ACM Transactions on Quantum Computing 1
2020
Cited alongside, same era.
K.-M. Chung and H.-H. Lin, Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem, in 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 197, edited by M.-H. Hsieh (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021) pp. 3:1–3:22
2021
Later among the works it cites.
M. C. Caro, Binary classification with classical instances and quantum labels, Quantum Machine Intelligence 3
2021
Later among the works it cites.
2021
Later among the works it cites.
H. Ye, C. Xie, T. Cai, R. Li, Z. Li, and L. Wang, Towards a theoretical framework of out-of-distribution generalization, in Advances in Neural Information Processing Systems , Vol. 34, edited by M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, and J. W. Vaughan (Curran Associates, Inc., 2021) pp. 23519–23531
2021
Later among the works it cites.
H.-Y. Huang, M. Broughton, J. Cotler, S. Chen, J. Li, M. Mohseni, H. Neven, R. Babbush, R. Kueng, J. Preskill, and J. R. McClean, Quantum advantage in learning from experiments, Science 376
2022
Closest in time.
D. Aharonov, J. Cotler, and X.-L. Qi, Quantum algorithmic measurement, Nature Communications 13
2022
Closest in time.
S. Chen, J. Cotler, H.-Y. Huang, and J. Li, Exponential separations between learning with and without quantum memory, in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 574–585
2022
Closest in time.
K. Sharma, M. Cerezo, Z. Holmes, L. Cincio, A. Sornborger, and P. J. Coles, Reformulation of the no-free-lunch theorem for entangled datasets, Physical Review Letters 128
2022
Closest in time.
K. Bu, D. E. Koh, L. Li, Q. Luo, and Y. Zhang, Statistical complexity of quantum circuits, Physical Review A 105
2022
Closest in time.
Y. Du, Z. Tu, X. Yuan, and D. Tao, Efficient measure for the expressivity of variational quantum algorithms, Physical Review Letters 128
2022
Closest in time.
M. C. Caro, H.-Y. Huang, M. Cerezo, K. Sharma, A. Sornborger, L. Cincio, and P. J. Coles, Generalization in quantum machine learning from few training data, Nature Communications 13
2022
Closest in time.
H. Cai, Q. Ye, and D.-L. Deng, Sample complexity of learning parametric quantum circuits, Quantum Science and Technology 7
2022
Closest in time.
T. Jones and S. C. Benjamin, Robust quantum compilation and circuit optimisation via energy minimisation, Quantum 6
2022
Closest in time.
A. Elben, S. T. Flammia, H.-Y. Huang, R. Kueng, J. Preskill, B. Vermersch, and P. Zoller, The randomized measurement toolbox, Nature Review Physics 10.1038/s42254-022-00535-2 (2022)
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
J. Haferkamp, Random quantum circuits are approximate unitary t t -designs in depth O ( n t 5 + o ( 1 ) ) O\left(nt^{5+o(1)}\right) , Quantum 6
2022
Closest in time.
C. Gyurik, D. Vreumingen, van, and V. Dunjko, Structural risk minimization for quantum linear classifiers, Quantum 7
2023
Closest in time.
H.-Y. Hu, S. Choi, and Y.-Z. You, Classical shadow tomography with locally scrambled quantum dynamics, Physical Review Research 5
2023
Closest in time.
S. Monaco, O. Kiss, A. Mandarino, S. Vallecorsa, and M. Grossi, Quantum phase detection generalization from marginal quantum neural network models, Physical Review B 107
2023
Closest in time.