Quantum Learning with Tunable Loss Functions

Abstract

Learning from quantum data presents new challenges to the paradigm of learning from data. This typically entails the use of quantum learning models to learn quantum processes that come with enough subtleties to modify the theoretical learning frameworks. This new intersection warrants new frameworks for complexity measures, including those on quantum sample complexity and generalization bounds. Empirical risk minimization (ERM) serves as the foundational framework for evaluating learning models in general. The diversity of learning problems leads to the development of advanced learning strategies such as tilted empirical risk minimization (TERM). Theoretical aspects of quantum learning under a quantum ERM framework are presented in [PRX Quantum 5, 020367 (2024)]. In this work, we propose a definition for TERM suitable to be employed when learning quantum processes, which gives rise to quantum TERM (QTERM). We show that QTERM can be viewed as a competitive alternative to implicit and explicit regularization strategies for quantum process learning. This work contributes to the existing literature on quantum and classical learning theory threefold. First, we prove QTERM learnability by deriving upper bounds on QTERM's sample complexity. Second, we establish new PAC generalization bounds on classical TERM. Third, we present QTERM agnostic learning guarantees for quantum hypothesis selection. These results contribute to the broader literature of complexity bounds on the feasibility of learning quantum processes, as well as methods for improving generalization in quantum learning.