Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2408.08836 · The Journal of Chemical Physics

Bee-yond the plateau: Training QNNs with swarm algorithms

Rubén Darío Guerrero

Published Jan 2, 2025• 4 citations
arXivHTMLPDF

Abstract

In the quest to harness the power of quantum computing, training quantum neural networks (QNNs) presents a formidable challenge. This study introduces an innovative approach, integrating the Bees Optimization Algorithm (BOA) to overcome one of the most significant hurdles-barren plateaus. Our experiments across varying qubit counts and circuit depths demonstrate the BOA's superior performance compared to the Adam algorithm. Notably, BOA achieves faster convergence, higher accuracy, and greater computational efficiency. This study confirms BOA's potential to enhance the applicability of QNNs in complex quantum computations.

DOI
10.1063/5.0240466

Related papers

Bio-Inspired Algorithms for Adaptive Quantum Machine Learning

Er. Raghav Agarwal

Adaptive quantum machine learning (QML) represents an exciting frontier at the intersection of quantum computing and classical bio-inspired optimization. The constraints of noisy intermediate-scale quantum (NISQ) devices—limited qubit counts, significant decoherence, and measurement uncertainties—pose formidable challenges to training parameterized quantum circuits (PQCs) using traditional gradient-based methods. To overcome these hurdles, we propose a novel Adaptive PSO–QML framework that integrates a particle swarm optimization (PSO)–inspired algorithm with dynamic hyperparameter adjustment, enabling real-time tuning of PQC parameters based on performance feedback. Unlike static optimizers, our approach continuously adapts its inertia weight and cognitive/social coefficients to balance exploration and exploitation, responding to stagnation or rapid improvement in measured fitness. We evaluate this hybrid algorithm on two benchmark classification tasks: the classical Iris dataset encoded into a 2-qubit circuit and a quantum-encoded subset of the MNIST dataset on 4 qubits. Our experiments, conducted on the Qiskit Aer simulator under realistic noise models (depolarizing, amplitude damping, and mixed), demonstrate that Adaptive PSO–QML achieves an average accuracy improvement of 12% over fixed-parameter PSO and 15% over Adam-based gradient descent, with p-values below 0.01 across paired t-tests. Statistical analysis summarized in Table 1 confirms the significance of these gains. Detailed simulation research further reveals that the adaptive mechanism not only accelerates convergence by approximately 30%—reducing total circuit evaluations—but also exhibits robust performance across varying circuit depths (1–3 entangling layers) and noise intensities. Our findings suggest that bio-inspired adaptation is a powerful tool for mitigating barren plateaus and noise effects in NISQ-era QML, paving the way for scalable quantum advantage in near-term hardware.

World Journal of Future Technologies in Computer Science and Engineering•Jun 12, 2026•0 citations

Optimizing Quantum Neural Networks: A Comparative Study of QNN Architectures and Training Techniques

Lipantri Mashur Gultom, Desi Amirullah

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.

International Conference on Industrial Technology and Business Proceeding (INTECHBIZ)•Dec 24, 2024•0 citations

Enhancing variational quantum circuit training: an improved neural network approach for barren plateau mitigation

Yi Zhu, Yanying Liang, Haozhen Situ

Abstract Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various approaches have been proposed to mitigate this issue, such as using neural networks to generate VQC parameters. In this paper, we improve the NN-based BP mitigation approach by refining the neural network architecture and extend its applicability to a more generalized scenario that includes random quantum inputs and VQC structures. We evaluate the effectiveness of the approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of the NN-based BP mitigation approach by utilizing a loss landscape visualization technique and the expressibility metric of VQC. The smoothness of the loss landscape offers an intuitive insight into the approach’s utility, while the reduction in expressibility accounts for the enhanced trainability. Our research highlights the universal applicability of the NN-based BP mitigation approach, underscoring its potential to drive progress in the development of VQAs across diverse domains.

arXiv:2411.09226•Physica Scripta•Jul 16, 2025•8 citations

ResQNets: a residual approach for mitigating barren plateaus in quantum neural networks

Muhammad Kashif, Saif M. Al-Kuwari

Abstract The barren plateau problem in quantum neural networks (QNNs) is a significant challenge that hinders the practical success of QNNs. In this paper, we introduce residual quantum neural networks (ResQNets) as a solution to address this problem. ResQNets are inspired by classical residual neural networks and involve splitting the conventional QNN architecture into multiple quantum nodes, each containing its own parameterized quantum circuit, and introducing residual connections between these nodes. Our study demonstrates the efficacy of ResQNets by comparing their performance with that of conventional QNNs and plain quantum neural networks through multiple training experiments and analyzing the cost function landscapes. Our results show that the incorporation of residual connections results in improved training performance. Therefore, we conclude that ResQNets offer a promising solution to overcome the barren plateau problem in QNNs and provide a potential direction for future research in the field of quantum machine learning.

arXiv:2305.03527•EPJ Quantum Technology•Jan 10, 2024•53 citations

Quantum optimization for training quantum neural networks

Yidong Liao, Min-Hsiu Hsieh, Christopher Ferrie

Abstract Training quantum neural networks (QNNs) using gradient-based or gradient-free classical optimization approaches is severely impacted by the presence of barren plateaus in the cost landscapes. In this paper, we devise a framework for leveraging quantum optimization algorithms to find optimal parameters of QNNs for certain tasks. To cast the optimization problem of training QNN into the context of quantum optimization, the parameters in QNN are quantized—moved from being classical to being stored in quantum registers which are in addition to those upon which the QNN is performing its computation. We then coherently encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the QNN parameters. The parameters are tuned with an iterative quantum optimization structure using adaptively selected Hamiltonians. The quantum mechanism of this framework exploits hidden structure in the QNN optimization problem and hence is expected to provide beyond-Grover speed up, mitigating the barren plateau issue.

arXiv:2103.17047•Quantum Machine Intelligence•Jun 1, 2024•38 citations

Quantum Generative Training Using Rényi Divergences

Mária Kieferová, Ortiz Marrero Carlos, Nathan Wiebe

Quantum neural networks (QNNs) are a framework for creating quantum algorithms that promises to combine the speedups of quantum computation with the widespread successes of machine learning. A major challenge in QNN development is a concentration of measure phenomenon known as a barren plateau that leads to exponentially small gradients for a range of QNNs models. In this work, we examine the assumptions that give rise to barren plateaus and show that an unbounded loss function can circumvent the existing no-go results. We propose a training algorithm that minimizes the maximal Rényi divergence of order two and present techniques for gradient computation. We compute the closed form of the gradients for Unitary QNNs and Quantum Boltzmann Machines and provide sufficient conditions for the absence of barren plateaus in these models. We demonstrate our approach in two use cases: thermal state learning and Hamiltonian learning. In our numerical experiments, we observed rapid convergence of our training loss function and frequently archived a $99\%$ average fidelity in fewer than $100$ epochs.

arXiv:2106.09567•Jun 17, 2021•51 citations
In the quest to harness the power of quantum computing, training quantum neural networks (QNNs) presents a formidable challenge. This study introduces an innovative approach, integrating the Bees Optimization Algorithm (BOA) to overcome one of the most significant hurdles-barren plateaus. Our experiments across varying qubit counts and circuit depths demonstrate the BOA's superior performance compared to the Adam algorithm. Notably, BOA achieves faster convergence, higher accuracy, and greater computational efficiency. This study confirms BOA's potential to enhance the applicability of QNNs in complex quantum computations.
Adaptive quantum machine learning (QML) represents an exciting frontier at the intersection of quantum computing and classical bio-inspired optimization. The constraints of noisy intermediate-scale quantum (NISQ) devices—limited qubit counts, significant decoherence, and measurement uncertainties—pose formidable challenges to training parameterized quantum circuits (PQCs) using traditional gradient-based methods. To overcome these hurdles, we propose a novel Adaptive PSO–QML framework that integrates a particle swarm optimization (PSO)–inspired algorithm with dynamic hyperparameter adjustment, enabling real-time tuning of PQC parameters based on performance feedback. Unlike static optimizers, our approach continuously adapts its inertia weight and cognitive/social coefficients to balance exploration and exploitation, responding to stagnation or rapid improvement in measured fitness. We evaluate this hybrid algorithm on two benchmark classification tasks: the classical Iris dataset encoded into a 2-qubit circuit and a quantum-encoded subset of the MNIST dataset on 4 qubits. Our experiments, conducted on the Qiskit Aer simulator under realistic noise models (depolarizing, amplitude damping, and mixed), demonstrate that Adaptive PSO–QML achieves an average accuracy improvement of 12% over fixed-parameter PSO and 15% over Adam-based gradient descent, with p-values below 0.01 across paired t-tests. Statistical analysis summarized in Table 1 confirms the significance of these gains. Detailed simulation research further reveals that the adaptive mechanism not only accelerates convergence by approximately 30%—reducing total circuit evaluations—but also exhibits robust performance across varying circuit depths (1–3 entangling layers) and noise intensities. Our findings suggest that bio-inspired adaptation is a powerful tool for mitigating barren plateaus and noise effects in NISQ-era QML, paving the way for scalable quantum advantage in near-term hardware.
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.
Abstract Combining classical optimization with parameterized quantum circuit evaluation, variational quantum algorithms (VQAs) are among the most promising algorithms in near-term quantum computing. However, the training of variational quantum circuits (VQCs) is susceptible to a phenomenon known as barren plateaus (BPs). Various approaches have been proposed to mitigate this issue, such as using neural networks to generate VQC parameters. In this paper, we improve the NN-based BP mitigation approach by refining the neural network architecture and extend its applicability to a more generalized scenario that includes random quantum inputs and VQC structures. We evaluate the effectiveness of the approach by comparing the convergence speed before and after it is utilized. Furthermore, we give an explanation for the effectiveness of the NN-based BP mitigation approach by utilizing a loss landscape visualization technique and the expressibility metric of VQC. The smoothness of the loss landscape offers an intuitive insight into the approach’s utility, while the reduction in expressibility accounts for the enhanced trainability. Our research highlights the universal applicability of the NN-based BP mitigation approach, underscoring its potential to drive progress in the development of VQAs across diverse domains.
Abstract The barren plateau problem in quantum neural networks (QNNs) is a significant challenge that hinders the practical success of QNNs. In this paper, we introduce residual quantum neural networks (ResQNets) as a solution to address this problem. ResQNets are inspired by classical residual neural networks and involve splitting the conventional QNN architecture into multiple quantum nodes, each containing its own parameterized quantum circuit, and introducing residual connections between these nodes. Our study demonstrates the efficacy of ResQNets by comparing their performance with that of conventional QNNs and plain quantum neural networks through multiple training experiments and analyzing the cost function landscapes. Our results show that the incorporation of residual connections results in improved training performance. Therefore, we conclude that ResQNets offer a promising solution to overcome the barren plateau problem in QNNs and provide a potential direction for future research in the field of quantum machine learning.
Abstract Training quantum neural networks (QNNs) using gradient-based or gradient-free classical optimization approaches is severely impacted by the presence of barren plateaus in the cost landscapes. In this paper, we devise a framework for leveraging quantum optimization algorithms to find optimal parameters of QNNs for certain tasks. To cast the optimization problem of training QNN into the context of quantum optimization, the parameters in QNN are quantized—moved from being classical to being stored in quantum registers which are in addition to those upon which the QNN is performing its computation. We then coherently encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the QNN parameters. The parameters are tuned with an iterative quantum optimization structure using adaptively selected Hamiltonians. The quantum mechanism of this framework exploits hidden structure in the QNN optimization problem and hence is expected to provide beyond-Grover speed up, mitigating the barren plateau issue.
Quantum neural networks (QNNs) are a framework for creating quantum algorithms that promises to combine the speedups of quantum computation with the widespread successes of machine learning. A major challenge in QNN development is a concentration of measure phenomenon known as a barren plateau that leads to exponentially small gradients for a range of QNNs models. In this work, we examine the assumptions that give rise to barren plateaus and show that an unbounded loss function can circumvent the existing no-go results. We propose a training algorithm that minimizes the maximal Rényi divergence of order two and present techniques for gradient computation. We compute the closed form of the gradients for Unitary QNNs and Quantum Boltzmann Machines and provide sufficient conditions for the absence of barren plateaus in these models. We demonstrate our approach in two use cases: thermal state learning and Hamiltonian learning. In our numerical experiments, we observed rapid convergence of our training loss function and frequently archived a 99%99\%99% average fidelity in fewer than 100100100 epochs.