A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated quantum-algorithmically by various forms of quantum automata families (including 1qqaf's). We study an efficient way to accomplish certain machine learning tasks by training these AEQSs quantumly. When AEQSs are controlled by 1qqaf's, it suffices in essence to find an optimal 1qqaf that approximately solves a target relational problem. For this purpose, we develop a basic idea of approximately utilizing well-known quantum algorithms for quantum counting, quantum amplitude estimation, and quantum approximation. We then provide a rough estimation of the efficiency of our quantum learning algorithms for AEQSs.
Comments
(A4, 11pt, 10 pages) A preliminary report was presented at the 22nd International Conference on Unconventional Computation and Natural Computation (UCNC 2025), Nice, France, September 1--5, 2025
A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated quantum-algorithmically by various forms of quantum automata families (including 1qqaf's). We study an efficient way to accomplish certain machine learning tasks by training these AEQSs quantumly. When AEQSs are controlled by 1qqaf's, it suffices in essence to find an optimal 1qqaf that approximately solves a target relational problem. For this purpose, we develop a basic idea of approximately utilizing well-known quantum algorithms for quantum counting, quantum amplitude estimation, and quantum approximation. We then provide a rough estimation of the efficiency of our quantum learning algorithms for AEQSs.
Variational Quantum Classifiers (VQCs) stand out as one of the most popular classification approaches within the Quantum Machine Learning (QML) community. They serve as an accessible entry point for newcomers to QML world, particularly those with a background in classical machine learning, due to their workflow similarity to conventional neural networks. In essence, VQCs boast a layered structure conducive to training via a classical optimizer. Recently, Evolutionary Algorithms (EAs) have emerged as a suitable methodology for this training goal. However, current quantum tools provide implementations for various gradient-based optimizers and just one EA tailored for VQC training. Moreover, it is important to note that access to this toolset remains largely confined to expert users. This highlights the necessity for platforms that facilitate the utilization of EAs for VQC training by non-experts in quantum or evolutionary computing. This work introduces a web application designed to implement quantum classifiers to be trained on user-supplied datasets by means of a set of EAs, which can be customized by users. The capabilities of the proposed web application are shown in the experimental session, where a VQC is trained to classify a well-known dataset using a variety of EAs.
The training of large-scale machine learning models presents significant computational challenges, primarily due to the inherent complexity of optimization algorithms like stochastic gradient descent (SGD) and its variants. These algorithms often struggle with convergence speed, getting trapped in local minima, and the ability to effectively explore the vast solution space. This paper investigates the potential of quantum-inspired optimization techniques to address these limitations. Specifically, we explore the application of quantum annealing and variational quantum eigensolver (VQE) approaches to accelerate the training and optimization process of large-scale machine learning models. Our core claim is that by mapping the optimization problem to a quantum system, we can leverage quantum computation to overcome the computational bottlenecks associated with classical optimization methods. We propose a framework where the objective function of the machine learning model is translated into a Hamiltonian for a quantum annealer or the cost function for a VQE, enabling a quantum-inspired solution. The results, while theoretical in this initial exploration, demonstrate a potential pathway for significantly reducing training times and improving the overall performance of large-scale machine learning models. Further research is needed to develop efficient hybrid quantum-classical algorithms and explore the practical limitations of this approach.
Abstract This study examines the relationship between machine learning and quantum computing, emphasizing the potential benefits of quantum algorithms for classification, optimization and clustering problems. Through a comprehensive literature review of peer reviewed journal articles and preprints from 2014 to 2024, Quantum K-Means Clustering, Quantum Support Vector Machines (QSVMs), and Quantum Approximate Optimization Algorithms (QAOA) and Quantum Annealing are among the important quantum algorithms identified in the study. Although the theoretical potential of these algorithms is substantial, present hardware constraints, such as noise, de-coherence, and qubit count limitations, make practical implementation difficult. The review also highlights the ongoing challenges in quantum error correction and the nascent stage of quantum hardware development, which prevent large-scale machine learning tasks from being fully realized. Even so, hybrid quantum-classical models are a plausible route forward for near-term utility. These results suggest that to leverage quantum machine learning to its full potential, further progress in quantum hardware, error correction codes, and hybrid algorithms is required. Future studies should focus on designing more robust quantum error correction methods, further developing hybrid systems and exploring new areas of machine learning, such as reinforcement learning and generative models.
This study examines the relationship between machine learning and quantum computing, emphasizing the potential benefits of quantum algorithms for classification, optimization and clustering problems. Through a comprehensive literature review of peer-reviewed journal articles and preprints from 2014 to 2024, Quantum K-Means Clustering, Quantum Support Vector Machines (QSVMs), and Quantum Approximate Optimization Algorithms (QAOA) and Quantum Annealing are among the important quantum algorithms identified in the study. Although the theoretical potential of these algorithms is substantial, present hardware constraints, such as noise, de-coherence, and qubit count limitations, make practical implementation difficult. The review also highlights the ongoing challenges in quantum error correction and the nascent stage of quantum hardware development, which prevent large-scale machine learning tasks from being fully realized. Even so, hybrid quantum-classical models are a plausible route forward for near-term utility. These results suggest that to leverage quantum machine learning to its full potential, further progress in quantum hardware, error correction codes, and hybrid algorithms is required. Future studies should focus on designing more robust quantum error correction methods, further developing hybrid systems and exploring new areas of machine learning, such as reinforcement learning and generative models.
The artificial intelligence (AI) is about optimization, which is the essence of the model training, hyper parameter optimization and the high-dimensional space decision- making. Classical methods of optimization have made much progress using gradient descent and evolutionary algorithms but are sufficient in the face of scalabilibility issues in large and non-convex and combinatoric problem spaces. The recent advancement in quantum computing provides an alternative, which is promising, whereby quantum mechanical principles of superposition, entanglement, and interference are taken advantage of to speed up search and optimization. It is suggested that a hybrid quantum-classical optimization structure should be developed, including QAOA/VQE subroutines as a part of machine learning operations. The limited hardware implementation is supported by the results of simulations, which show that approximation ratios, rate of convergence, and robustness can be measured to improve tasks like Max-Cut, portfolio optimization, and feature selection
We develop a hybrid quantum-classical algorithm to solve an optimal population transfer problem for a molecule subject to a laser pulse. The evolution of the molecular wave function under the laser pulse is simulated on a quantum computer, while the optimal pulse is iteratively shaped via a machine learning (evolutionary) algorithm. A method to encode on the quantum computer the n-electrons wave function is discussed, the circuits accomplishing its quantum simulation are derived and the scalability in terms of number of operations is discussed. Performance on noisy intermediate-scale quantum devices (IBM Q X2) is provided to assess the current technological gap. Furthermore the hybrid algorithm is tested on a quantum emulator to compare performance of the evolutionary algorithm with standard ones. Our results show that such algorithms are able to outperform the optimization with a downhill simplex method and provide performance comparable to more advanced (but quantum-computer unfriendly) algorithms such as Rabitz's or gradient-based optimization.