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

Evolutionary Intelligence

Quantum bee-inspired algorithm using quantum circuit and gradient descent optimizer on product recommendation

Prashanthi Bhaskaran, S. Prasanna

Published Apr 1, 2025• 2 citations
Publisher
DOI
10.1007/s12065-025-01031-z

Related papers

Quantum-Inspired Algorithm with Evolution Strategy

Anna Ouskova Leonteva, Ulviya Abdulkarimova, Anne Jeannin‐Girardon +3 more

Lecture notes in computer science•Jan 1, 2020•2 citations

Optimizing the Quantum Circuit of Quantum SVM Using Hybrid Quantum Natural Gradient Descent(QNGD) and Quantum Butterfly Optimization Algorithm(QBOA)

Raakesh Premkumar, T.B Sivakumar, L. Maria Michael Visuwasam +2 more

This research endeavor is centered on the enhancement of the quantum circuit associated with the Quantum Support Vector Machine (QSVM), a fundamental algorithm within the realm of quantum machine learning, through the application of a hybrid optimization methodology that amalgamates Quantum Natural Gradient Descent (QNGD) with the Quantum Butterfly Optimization Algorithm (QBOA). The QSVM exploits quantum computational capabilities for proficient classification tasks within elevated-dimensional frameworks; however, its operational efficacy is frequently compromised by non-ideal quantum circuit parameters and the deleterious effects of noise present in near-term quantum computational devices. The suggested hybrid optimization technique augments the performance of QSVM by fusing the localized refinement capabilities of QNGD, which employs the Fisher Information Matrix for effective parameter adjustments, with the expansive exploration potential of QBOA, inspired by the foraging behaviors of butterflies. This collaborative approach yields accelerated convergence (38 iterations), enhanced classification accuracy ($\mathbf{9 6. 8 \%}$), diminished circuit complexity (44 quantum gates), and increased resilience to noise (fidelity:$\mathbf{0. 9 8 5}$). In comparison to traditional optimization techniques such as Differential Evolution (DE), Grey Wolf Optimizer (GWO), and Firefly Algorithm (FA), the proposed framework exhibits markedly superior efficacy in the refinement of quantum kernel computations, entanglement strategies, and the overall depth of the circuit while concurrently alleviating the impacts of noise.

International Conference on Information, Implementation, and Innovation in Technology (I2ITCON)•Jul 4, 2025•0 citations

Quantum-Circuit-Based Artificial Bee Colony Algorithm for Combinatorial Optimization: A Study on the Traveling Salesman Problem

Rohit Kumar Nonia, Mayukh Sarkar, Dilip Kumar Shaw

•Jan 1, 2026•0 citations

Quantum-Inspired Optimization via Gradient Descent

Jincheng Zhang

Quantum-Inspired Optimization (QIO) aims to accelerate optimization algorithms by mimicking the behavior of quantum systems. This paper explores the application of gradient descent, a fundamental optimization technique, to this framework. We propose a novel gradient update rule inspired by quantum mechanics, specifically focusing on probabilistic updates that mimic the superposition and interference effects observed in quantum systems. The core mechanism involves adapting the standard gradient descent formula to incorporate these probabilistic elements, significantly enhancing convergence speed and robustness compared to traditional gradient descent. This work introduces a new algorithm that leverages the principles of quantum mechanics to enhance optimization performance, potentially leading to faster and more reliable solutions for complex problems.

•Sep 1, 2026•0 citations

Quantum-Inspired Optimization via Non-Linear Gradient Descent

Jincheng Zhang

Quantum-inspired optimization presents a novel approach to problem-solving, leveraging the principles of quantum mechanics to guide the search process. This paper proposes a new optimization algorithm, "Non-Linear Gradient Descent with Quantum Properties," designed to overcome the limitations of classical gradient descent in complex, non-linear landscapes. We introduce a modified update rule that mimics quantum properties, specifically the superposition and entanglement of gradients, to accelerate exploration and improve convergence. The algorithm's effectiveness is demonstrated through a series of benchmark problems, showcasing enhanced performance compared to established methods. This work establishes a foundation for a more efficient and adaptable optimization technique applicable to a wide range of computational challenges.

•Aug 31, 2026•0 citations

Quantum Inspired Evolutionary Algorithms

Anthony Brabazon, Michael O’Neill, Seán McGarraghy

Natural computing series•Jan 1, 2015•0 citations
This research endeavor is centered on the enhancement of the quantum circuit associated with the Quantum Support Vector Machine (QSVM), a fundamental algorithm within the realm of quantum machine learning, through the application of a hybrid optimization methodology that amalgamates Quantum Natural Gradient Descent (QNGD) with the Quantum Butterfly Optimization Algorithm (QBOA). The QSVM exploits quantum computational capabilities for proficient classification tasks within elevated-dimensional frameworks; however, its operational efficacy is frequently compromised by non-ideal quantum circuit parameters and the deleterious effects of noise present in near-term quantum computational devices. The suggested hybrid optimization technique augments the performance of QSVM by fusing the localized refinement capabilities of QNGD, which employs the Fisher Information Matrix for effective parameter adjustments, with the expansive exploration potential of QBOA, inspired by the foraging behaviors of butterflies. This collaborative approach yields accelerated convergence (38 iterations), enhanced classification accuracy (96.8%\mathbf{9 6. 8 \%}96.8%), diminished circuit complexity (44 quantum gates), and increased resilience to noise (fidelity:0.985\mathbf{0. 9 8 5}0.985). In comparison to traditional optimization techniques such as Differential Evolution (DE), Grey Wolf Optimizer (GWO), and Firefly Algorithm (FA), the proposed framework exhibits markedly superior efficacy in the refinement of quantum kernel computations, entanglement strategies, and the overall depth of the circuit while concurrently alleviating the impacts of noise.
Quantum-Inspired Optimization (QIO) aims to accelerate optimization algorithms by mimicking the behavior of quantum systems. This paper explores the application of gradient descent, a fundamental optimization technique, to this framework. We propose a novel gradient update rule inspired by quantum mechanics, specifically focusing on probabilistic updates that mimic the superposition and interference effects observed in quantum systems. The core mechanism involves adapting the standard gradient descent formula to incorporate these probabilistic elements, significantly enhancing convergence speed and robustness compared to traditional gradient descent. This work introduces a new algorithm that leverages the principles of quantum mechanics to enhance optimization performance, potentially leading to faster and more reliable solutions for complex problems.
Quantum-inspired optimization presents a novel approach to problem-solving, leveraging the principles of quantum mechanics to guide the search process. This paper proposes a new optimization algorithm, "Non-Linear Gradient Descent with Quantum Properties," designed to overcome the limitations of classical gradient descent in complex, non-linear landscapes. We introduce a modified update rule that mimics quantum properties, specifically the superposition and entanglement of gradients, to accelerate exploration and improve convergence. The algorithm's effectiveness is demonstrated through a series of benchmark problems, showcasing enhanced performance compared to established methods. This work establishes a foundation for a more efficient and adaptable optimization technique applicable to a wide range of computational challenges.