Quantum statistical learning theory: concepts, regimes, and open problems

Statistical learning theory provides the mathematical foundations for understanding generalization from finite data. As quantum computing and quantum machine learning continue to develop, there is increasing interest in whether analogous principles can be formulated for learning settings involving quantum data, quantum models, or quantum computation. This paper offers an introductory perspective on quantum statistical learning theory. We begin by recalling the basic ideas of classical statistical learning theory, including empirical risk minimization, hypothesis classes, generalization, and sample complexity, and then discuss how these concepts must be adapted in the quantum setting. In particular, we distinguish between learning with classical data using quantum algorithms, learning with quantum models, and learning directly from quantum data. We then develop a resource-sensitive description that separates population risk, ideal empirical risk, and finite-shot empirical risk. This distinction makes explicit the different roles of training sample size and measurement budget. For a binary measurement-based classifier, we derive a finite-shot condition relating the required measurement budget to the sample size, confidence level, and classification margin. We further discuss how finite-sample generalization, finite-measurement estimation, and hardware imperfections can be represented as distinct contributions to experimentally observed learning performance. We conclude with a discussion of open problems and directions toward a more unified theory of generalization and learnability in quantum learning.