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

Journal of Global Optimization

A hybrid method for quantum global optimization

Yipeng Liu, Gary J. Kœhler

Published Nov 10, 2011• 5 citations
Publisher
DOI
10.1007/s10898-011-9806-y

Related papers

A new hybrid classical-quantum algorithm for continuous global optimization problems

Pedro Lara, Renato Portugal, Carlile Lavor

arXiv:1301.4667•Journal of Global Optimization•Sep 30, 2013•8 citations

Hybrid Pattern Search-Quantum Optimization Method for Engineering Optimization Problems

Fawzan S. Alfares, Athoob A. Alabdaly, Mohamed S. Alfares +1 more

Abstract The Quantum-Based Optimisation Method (QBOM) is a novel optimization approach based on quantum computing concepts. The novel optimization method's durability is studied using its capacity to conjoin with existing optimization techniques. This study uses The QBOM with the Pattern Search (PS) technique to solve engineering optimization problems. The first strategy, Hybrid I, uses QBOM for global search optimization, followed by PS searching in the nearby region for the optimum solution. The second strategy, Hybrid II, uses QBOM as a local search optimization within Pattern Search. In each iteration, QBOM starts searching inside PS for a better solution than the one detected at that stage, which is labelled as PS's new search point. These two hybrid techniques attempt to expand the possibilities of QBOM's local search mechanism while demonstrating its resilience. The hybridised methodologies are used to solve benchmark optimization problems and six real-world engineering optimization problems. The study revealed that the two hybrid techniques worked brilliantly, producing solutions that exceeded previous methods described in the literature for certain benchmark optimization problems. Not only did the hybridised methods produce better results in less computational time, but they also demonstrated that QBOM could be used to improve the search mechanism and accelerate the performance of the evolutionary algorithm in the local search to match its execution in the global search.

•Jan 17, 2024•0 citations

Towards practical quantum optimization

András Czégel

•Sep 18, 2026•0 citations

Adaptive Hybrid Quantum-Inspired Optimization for Enhanced Global Search Efficiency

Annam Rupa

In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.

Journal of Information Systems Engineering & Management•Apr 3, 2025•2 citations

First Steps towards Hybrid Quantum-Classical Optimization

Dapeng Wang

•Jan 1, 2020•0 citations

Fast quantum methods for optimization

Sergio Boixo, Gerardo Ortíz, Rolando D. Somma

arXiv:1409.2477•The European Physical Journal Special Topics•Feb 1, 2015•22 citations
Abstract The Quantum-Based Optimisation Method (QBOM) is a novel optimization approach based on quantum computing concepts. The novel optimization method's durability is studied using its capacity to conjoin with existing optimization techniques. This study uses The QBOM with the Pattern Search (PS) technique to solve engineering optimization problems. The first strategy, Hybrid I, uses QBOM for global search optimization, followed by PS searching in the nearby region for the optimum solution. The second strategy, Hybrid II, uses QBOM as a local search optimization within Pattern Search. In each iteration, QBOM starts searching inside PS for a better solution than the one detected at that stage, which is labelled as PS's new search point. These two hybrid techniques attempt to expand the possibilities of QBOM's local search mechanism while demonstrating its resilience. The hybridised methodologies are used to solve benchmark optimization problems and six real-world engineering optimization problems. The study revealed that the two hybrid techniques worked brilliantly, producing solutions that exceeded previous methods described in the literature for certain benchmark optimization problems. Not only did the hybridised methods produce better results in less computational time, but they also demonstrated that QBOM could be used to improve the search mechanism and accelerate the performance of the evolutionary algorithm in the local search to match its execution in the global search.
In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.