arXiv:2411.11954 · Physical Review Research

Learning complexity gradually in quantum machine learning models

Erik Recio-Armengol, Franz J. Schreiber, Jens Eisert, Carlos Bravo-Prieto

Published May 19, 2026• 0 citations

Abstract

Quantum machine learning is an emergent field that continues to draw significant interest for its potential to offer improvements over classical algorithms in certain areas. However, training quantum models remains a challenging task, largely because of the difficulty in establishing an effective inductive bias when solving high-dimensional problems. In this work, we propose a training framework that prioritizes informative data points over the entire training set. This approach draws inspiration from classical techniques such as and to introduce an additional inductive bias through the training data itself. By selectively focusing on informative samples, we aim to steer the optimization process toward more favorable regions of the parameter space. This data-centric approach complements existing strategies such as warm-start initialization methods, providing an additional pathway to address performance challenges in quantum machine learning. We provide theoretical insights into the benefits of prioritizing informative data for quantum models, and we validate our methodology with numerical experiments on selected recognition tasks of quantum phases of matter. Our findings indicate that this strategy could be a valuable approach for improving the performance of quantum machine learning models.

DOI: 10.1103/wnlr-q9xd

Related papers

Learning complexity gradually in quantum machine learning models

Erik Recio-Armengol, Franz J. Schreiber, Jens Eisert +1 more

Quantum machine learning is an emergent field that continues to draw significant interest for its potential to offer improvements over classical algorithms in certain areas. However, training quantum models remains a challenging task, largely because of the difficulty in establishing an effective inductive bias when solving high-dimensional problems. In this work, we propose a training framework that prioritizes informative data points over the entire training set. This approach draws inspiration from classical techniques such as curriculum learning and hard example mining to introduce an additional inductive bias through the training data itself. By selectively focusing on informative samples, we aim to steer the optimization process toward more favorable regions of the parameter space. This data-centric approach complements existing strategies such as warm-start initialization methods, providing an additional pathway to address performance challenges in quantum machine learning. We provide theoretical insights into the benefits of prioritizing informative data for quantum models, and we validate our methodology with numerical experiments on selected recognition tasks of quantum phases of matter. Our findings indicate that this strategy could be a valuable approach for improving the performance of quantum machine learning models.

Jan 1, 20260 citations

Quantum Machine Learning: Feature Selection and Dimensionality Reduction

Jincheng Zhang

This paper explores the application of quantum algorithms for feature selection and dimensionality reduction within the field of quantum machine learning. Traditional methods for these tasks often suffer from computational bottlenecks, particularly when dealing with high-dimensional datasets. We propose a framework that leverages the principles of quantum computing to accelerate these processes. Specifically, we investigate the transformation of feature selection and dimensionality reduction problems into quantum optimization problems. We then examine the utilization of quantum annealing and variational quantum sampling algorithms for solving these problems. The core claim is that by employing quantum algorithms, we can significantly improve the efficiency and accuracy of machine learning models. The theoretical framework presented outlines a novel approach to tackling these challenges, offering a potential pathway towards more powerful and scalable quantum machine learning systems. This work provides a foundational exploration into this emerging area, focusing on the algorithmic strategies and potential benefits. ---

Aug 31, 20260 citations

Quantum curriculum learning

Quoc Hoan Tran, Yasuhiro Endo, Hirotaka Oshima

Quantum machine learning (QML) requires significant quantum resources to address practical real-world problems. When the underlying quantum information exhibits hierarchical structures in the data, limitations persist in training complexity and generalization. Research should prioritize both the efficient design of quantum architectures and the development of learning strategies to optimize resource usage. We propose a framework called quantum curriculum learning (Q-CurL) for quantum data, where the curriculum introduces simpler tasks or data to the learning model before progressing to more challenging ones. Q-CurL exhibits robustness to noise and data limitations, which is particularly relevant for current and near-term noisy intermediate-scale quantum devices. We achieve this through a curriculum design based on quantum data density ratios and a dynamic learning schedule that prioritizes the most informative quantum data. Empirical evidence shows that Q-CurL significantly enhances training convergence and generalization for unitary learning and improves the robustness of quantum phase recognition tasks. Q-CurL is effective with physical learning applications in physics and quantum chemistry.

arXiv:2407.02419Physical Review ASep 22, 20253 citations

Quantum-Inspired Optimization for Large-Scale Machine Learning

Jincheng Zhang

The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.

Sep 6, 20260 citations

Complexity Theory Quantum Machine Learning Algorithm Design

Jincheng Zhang

This paper explores the application of complexity theory to the design of quantum machine learning algorithms. The core claim is to develop a quantum machine learning algorithm that leverages the principles of complexity theory to optimize model parameters and training processes, ultimately enhancing model generalization capabilities. Traditional machine learning often focuses on data features, but this research proposes a novel approach that utilizes complexity theory to dynamically restructure model parameters and training pathways. The paper details the theoretical underpinnings of complexity theory, its application to algorithm design, and the potential benefits of this methodology. We present a preliminary implementation demonstrating a potential improvement in performance compared to existing quantum machine learning approaches.

Sep 3, 20260 citations

Quantum-Inspired Optimization of Large-Scale Machine Learning Algorithms

Jincheng Zhang

Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.

Sep 7, 20260 citations