Quantum machine learning is emerging as a new approach in the machine learning field that uses quantum properties, including superposition and entanglement. While the superposition offers low complexity when dealing with high-dimensional data, the entanglement has the potential to help us extract features better. Many classical and quantum optimizers have been proposed to train quantum machine learning models in the simulation environment. However, to the best of our knowledge, there is still no research investigating the best optimizer, which has the lowest resources and the minimal number of optimization steps, to achieve ideal performance. In this paper, we survey the most popular optimizers, such as Gradient Descent (GD), Adaptive Moment Estimation (Adam), and Quantum Natural Gradient Descent (QNG), through quantum compilation problems. We measure metrics that include the lowest cost value bound and wall time. We come to the conclusion that Adam is the most effective optimizer when achieving 1.94 times better in cost value and 1.10 times better in wall time at 9 qubits.
Quantum machine learning is emerging as a new approach in the machine learning field that uses quantum properties, including superposition and entanglement. While the superposition offers low complexity when dealing with high-dimensional data, the entanglement has the potential to help us extract features better. Many classical and quantum optimizers have been proposed to train quantum machine learning models in the simulation environment. However, to the best of our knowledge, there is still no research investigating the best optimizer, which has the lowest resources and the minimal number of optimization steps, to achieve ideal performance. In this paper, we survey the most popular optimizers, such as Gradient Descent (GD), Adaptive Moment Estimation (Adam), and Quantum Natural Gradient Descent (QNG), through quantum compilation problems. We measure metrics that include the lowest cost value bound and wall time. We come to the conclusion that Adam is the most effective optimizer when achieving 1.94 times better in cost value and 1.10 times better in wall time at 9 qubits.
Quantum Machine Learning is gaining traction by leveraging quantum advantage to outperform classical Machine Learning. Many classical and quantum optimizers have been proposed to train Parameterized Quantum Circuits in the simulation environment, achieving high accuracy and fast convergence speed. However, to the best of our knowledge, currently there is no related work investigating these optimizers on multiple algorithms, which may lead to the selection of suboptimal optimizers. In this paper, we first benchmark the most popular classical and quantum optimizers, such as Gradient Descent (GD), Adaptive Moment Estimation (Adam), and Quantum Natural Gradient Descent (QNG), through the Quantum Compilation algorithm. Evaluated metrics include the lowest cost value and the wall time. The results indicate that Adam outperforms other optimizers in terms of convergence speed, cost value, and stability. Furthermore, we conduct additional experiments on multiple algorithms with Adam variants, demonstrating that the choice of hyperparameters significantly impacts the optimizer's performance.
This study explores various architectures of Quantum Neural Networks (QNN) that utilize quantum computing to enhance machine learning model performance. The architectures examined include Hybrid Quantum Neural Network (H-QNN), Deep Quantum Neural Network (DQNN), Quantum Convolutional Neural Network (QCNN), and Coherent Feed Forward Quantum Neural Network. Additionally, the EfficientSU2 architecture demonstrated superior performance in accuracy and cost reduction. Optimization techniques such as Adaptive Moment Estimation (ADAM), Analytic Quantum Gradient Descent (AQGD), and Nakanishi-Fujii-Todo (NFT) were integrated to improve training efficiency. The study results show that EfficientSU2 with 10,000 iterations yielded the best results in terms of cost and accuracy across all tested datasets, with accuracy improvements reaching up to 97%. In conclusion, the EfficientSU2 architecture and the applied optimization techniques significantly enhanced the processing of complex data, paving the way for substantial advancements in quantum-based artificial intelligence applications.
Recent advances in Quantum Machine Learning (QML) bring together Quantum Computing and Machine Learning with the aim of enhancing the advantages of Machine Learning to solve problems efficiently. The properties of quantum systems (superposition, entanglement, etc.) to represent multiple states of information at once, QML can potentially offer significant advantages when solving complex high-dimensional (multidimensional) computational problems. This paper reviews the current state-of-art regarding QML in general through an organized compilation and assessment of selected studies recently published in scientific literature that were found via large electronic library catalogs based on peer-reviewed sources according to algorithms used, optimization approaches employed, and areas of applied study. This review provides comparative analyses of each selected studies for purposes of identifying major trends in QML research/practice as well as opportunities for methodological improvements and challenges still existing within QML. Finally, this review presents an overview of Quantum Computing and Quantum Data Encoding Principles utilized to translate Classical Data into Quantum States as a high-level evaluation of several popular Quantum Learning Algorithms (e.g., Quantum Neural Networks, Quantum Support Machines, and Variational Quantum Circuit). The survey describes the optimization strategies such as gradient based techniques, Bayesian Optimization and evolutionary techniques being used to improve the stability of the quantum machine learning (QML) training process. Then, it provides examples of application areas for such QML, where healthcare analytics, environmental modelling, manufacturing optimization and analysis of biologic data are included. The comparative review of the recent academic research has identified several limitations and challenges regarding the use of QML that researchers. Although QML is believed to be capable of solving complex computational problems, issues such as noise in hardware, limited numbers of qubits and scalability present significant challenges for researchers working with this type of machine learning application. Overall, it appears that this survey provides a broad overview of contemporary developments and future trends for developing high-performance quantum learning systems.
Quantum Machine Learning (QML) represents a paradigm shift in machine learning, leveraging quantum mechanics to address computational challenges and unlock new capabilities. This paper explores the application of adaptive gradient descent, a core technique in classical machine learning, to quantum machine learning algorithms. We propose a novel quantum gradient descent framework that dynamically adjusts the learning rate and optimization direction based on the input data's inherent features. This adaptive approach aims to significantly enhance training efficiency and model generalization performance. The core mechanism involves the introduction of a 'quantum gradient descent' process, utilizing quantum entanglement and superposition to accelerate gradient computation compared to classical methods. We analyze the potential benefits and challenges of this new algorithm, demonstrating its effectiveness through a simplified conceptual model.
Quantum Machine Learning (QML) has emerged as a transformative paradigm that integrates the computational advantages of quantum computing with the adaptive intelligence of machine learning to solve complex optimization problems in smart computing systems. Traditional optimization techniques often struggle with high-dimensional search spaces, combinatorial complexity, computational overhead, and scalability limitations in applications such as intelligent transportation, healthcare analytics, smart manufacturing, cybersecurity, cloud computing, and Internet of Things (IoT) infrastructures. QML approaches exploit quantum superposition, entanglement, and quantum parallelism to accelerate optimization tasks and enhance predictive performance beyond classical machine learning capabilities. This research proposes a hybrid Quantum Machine Learning optimization framework that combines Variational Quantum Circuits (VQCs), Quantum Neural Networks (QNNs), and classical deep learning models to address resource allocation, task scheduling, energy optimization, and intelligent decision-making in smart computing environments. The proposed framework integrates quantum-enhanced feature extraction, adaptive optimization layers, and reinforcement-based learning mechanisms to improve convergence speed and computational efficiency. Experimental analysis is performed using benchmark optimization datasets and simulated quantum environments to evaluate accuracy, execution time, energy efficiency, and scalability. Comparative results demonstrate that the proposed QML-based framework achieves superior optimization accuracy, reduced computational latency, and improved resource utilization when compared with traditional machine learning and classical metaheuristic optimization methods. Furthermore, the study highlights the practical significance of hybrid quantum-classical architectures in next-generation intelligent systems where large-scale optimization and real-time decision support are critical. The findings suggest that QML can significantly contribute to the advancement of sustainable, adaptive, and high-performance smart computing ecosystems while opening new directions for future quantum-aware intelligent infrastructures.
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.