This chapter develops a learning-theoretical foundation for quantum machine learning (QML) by treating quantum models as statistical learning systems rather than merely as computational circuits or algorithms. The discussion begins by motivating the need for learning theory in QML, emphasizing that nominal expressivity in exponentially large Hilbert spaces does not automatically imply learnability or generalization. Classical concepts such as VC dimension and Rademacher complexity are then adapted to quantum settings to analyze the effective capacity of parameterized quantum circuits and quantum kernels. These tools show that accessible quantum hypothesis classes are far more constrained than naive Hilbert-space arguments suggest and that increased expressivity can easily lead to overfitting when not balanced by appropriate inductive bias and regularization. This chapter further examines generalization bounds for variational quantum circuits, highlighting the additional roles of measurement-induced stochasticity, finite-shot variance, and hardware noise. Overfitting, implicit and explicit regularization, and the possibility of double-descent-like behavior in quantum models are analyzed from a unified statistical perspective. A final synthesis shows that expressivity, trainability, and robustness are fundamentally coupled in QML. Hands-on examples in Qiskit and PennyLane illustrate kernel complexity, generalization gaps, and depth-dependent trainability. Overall, this chapter provides a principled framework for evaluating when quantum models can learn reliably from finite, noisy data.
This chapter develops a learning-theoretical foundation for quantum machine learning (QML) by treating quantum models as statistical learning systems rather than merely as computational circuits or algorithms. The discussion begins by motivating the need for learning theory in QML, emphasizing that nominal expressivity in exponentially large Hilbert spaces does not automatically imply learnability or generalization. Classical concepts such as VC dimension and Rademacher complexity are then adapted to quantum settings to analyze the effective capacity of parameterized quantum circuits and quantum kernels. These tools show that accessible quantum hypothesis classes are far more constrained than naive Hilbert-space arguments suggest and that increased expressivity can easily lead to overfitting when not balanced by appropriate inductive bias and regularization. This chapter further examines generalization bounds for variational quantum circuits, highlighting the additional roles of measurement-induced stochasticity, finite-shot variance, and hardware noise. Overfitting, implicit and explicit regularization, and the possibility of double-descent-like behavior in quantum models are analyzed from a unified statistical perspective. A final synthesis shows that expressivity, trainability, and robustness are fundamentally coupled in QML. Hands-on examples in Qiskit and PennyLane illustrate kernel complexity, generalization gaps, and depth-dependent trainability. Overall, this chapter provides a principled framework for evaluating when quantum models can learn reliably from finite, noisy data.
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 outline the central learning-theoretic objects in the quantum setting, including quantum hypotheses, measurement-based predictions, population and empirical risk, shot complexity, and information-extraction limitations. A simple illustrative example is used to highlight how finite measurements and quantum uncertainty affect learning performance. We conclude with a discussion of open problems and directions toward a more unified theory of generalization and learnability in quantum learning.
This chapter develops variational quantum models as the dominant framework for near-term quantum machine learning (QML), emphasizing their role as trainable quantum circuits embedded within hybrid quantum-classical optimization loops. Building on earlier chapters on encoding and quantum feature geometry, it formulates parameterized quantum circuits (PQCs) as families of unitary transformations acting on reference states, with model outputs obtained through expectation values of observables. This measurement-based structure makes variational learning inherently stochastic and closely ties model behavior to circuit architecture, observable choice, and optimization strategy. This chapter examines variational quantum circuits (VQCs) as learning models, introduces quantum neural networks (QNNs) as structured variational architectures, and analyzes layered, data-reuploading, recurrent, and hybrid classical-quantum designs. It highlights the central tension between expressivity and trainability, showing how universality and approximation power are counterbalanced by optimization barriers such as barren plateaus. The discussion further develops ansatz design strategies, supervised, fidelity-based, and energy-based losses, regularization under noise, and practical methods for gradient estimation and optimization, including the parameter-shift rule, Simultaneous Perturbation Stochastic Approximation (SPSA), and layer-wise training. Together, these ideas establish variational quantum models as a flexible yet hardware-constrained paradigm whose practical success depends on careful coordination among architecture, measurement, and optimization.
This chapter examines optimization as the central practical bottleneck in quantum machine learning (QML), emphasizing that the usefulness of parameterized quantum models depends not only on expressivity but also on whether they can be trained reliably under realistic conditions. It formulates QML training as a constrained, stochastic optimization problem on curved state manifolds, where parameters define unitary evolutions rather than unconstrained Euclidean weights. This geometric perspective is used to analyze the roles of parameterized quantum circuits, generator structure, circuit depth, and quantum Fisher information in shaping trainability and convergence behavior. This chapter develops the main classes of quantum loss functions and gradient-evaluation methods, including the parameter-shift rule, Hadamard-test-based approaches, and finite-shot estimation, and then surveys both gradient-based and gradient-free optimization methods relevant to hybrid quantum-classical training. Particular attention is given to major optimization pathologies, including barren plateaus, noise-induced flat landscapes, hyperparameter sensitivity, and parameter redundancy. The discussion also emphasizes hardware-aware optimization, accounting for finite shot budgets, noise, measurement overhead, and simulation strategies. Taken together, this chapter provides a systematic framework for understanding how geometry, stochastic measurement, ansatz design, optimizer choice, and hardware constraints jointly determine the practical limits of trainability in QML.
This chapter develops quantum kernel-based machine learning as one of the most mature and practically viable paradigms in quantum machine learning (QML). It explains how kernel methods separate quantum representation from classical learning, allowing quantum devices to define feature spaces through state preparation and kernel estimation while leaving optimization and inference to established classical algorithms. This hybrid structure makes quantum kernel methods especially well suited to near-term quantum hardware and provides a conceptually clean framework for studying the role of quantum-induced geometry in learning. This chapter examines the historical emergence of kernel methods in QML, their positioning relative to variational models, and the practical workflow of learning from precomputed quantum kernels. It then analyzes the issues of generalization, regularization, and kernel noise, showing how finite-shot estimation and hardware imperfections affect the learned geometry of the feature space. Two major models are developed in detail: quantum support vector machines (QSVMs), which perform margin maximization in quantum-induced Hilbert spaces, and quantum kernel ridge regression (QKRR), which provides a closed-form framework for studying stability and conditioning. Together, these models illustrate how quantum kernels can be integrated into standard classical learning pipelines while preserving both mathematical rigor and experimental feasibility.
Quantum machine learning (QML) has emerged as a rapidly developing field at the intersection of quantum computing, artificial intelligence, and data science. As quantum hardware and algorithms continue to advance, there is a growing need for a rigorous and accessible text that explains how quantum principles can be used to design, analyze, and implement machine learning models. This book is intended for graduate students, researchers, and practitioners in computer science, physics, engineering, mathematics, and related disciplines. This book provides a comprehensive introduction to the foundations and modern methods of QML. It begins with the principles of quantum information, Hilbert spaces, quantum circuits, and quantum algorithms relevant to learning tasks. Then, it develops the major paradigms of the field, including quantum data encoding, quantum feature maps and kernels, variational quantum circuits, quantum neural networks, quantum generative models, quantum reinforcement learning, quantum transfer learning, and quantum linear algebra techniques. The text emphasizes both theory and implementation, with programming examples and computational workflows using Qiskit, PennyLane, TensorFlow Quantum, and PyTorch. Additional chapters address tensor network-inspired learning, error mitigation, graphics processing unit (GPU)-accelerated simulation, benchmarking, hybrid quantum-classical architectures, and applications in chemistry, genomics, finance, optimization, and natural language processing. Distinctive in both scope and organization, the book integrates mathematical foundations, algorithmic development, software implementation, and emerging research directions within a single coherent framework, making it suitable both as a graduate-level textbook and as a practical reference for researchers working in QML.
Quantum machine learning (QML) is rapidly transitioning from theoretical promise to practical relevance across data-intensive scientific domains. In this Review, we provide a structured overview of recent advances that bridge foundational quantum learning principles with real-world applications. We survey foundational QML paradigms, including variational quantum algorithms, quantum kernel methods, and neural-network quantum states, with emphasis on their applicability to complex quantum systems. We examine neural-network quantum states as expressive variational models for correlated matter, non-equilibrium dynamics, and open quantum systems, and discuss fundamental challenges associated with training and sampling. Recent advances in quantum-enhanced sampling and diagnostics of learning dynamics, including information-theoretic tools, are reviewed as mechanisms for improving scalability and trainability. The Review further highlights application-driven QML frameworks in drug discovery, cancer biology, and agro-climate modeling, where data complexity and constraints motivate hybrid quantum-classical approaches. We conclude with a discussion of federated quantum machine learning as a route to distributed, privacy-preserving quantum intelligence. Overall, this Review presents a unified perspective on the opportunities and limitations of QML for complex systems.