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:2506.21124 · Frontiers in Applied Mathematics and Statistics

Quantum adaptive search: a hybrid quantum-classical algorithm for global optimization of multivariate functions

G. Intoccia, Ugo Chirico, Vincenzo Schiano Di Cola, Giovanni Piero Pepe, Salvatore Cuomo

Published Sep 3, 2025• 1 citation
arXivHTMLPDF

Abstract

Introduction We present Quantum Adaptive Search (QAGS), a hybrid quantum-classical algorithm for global optimization of multivariate functions. The method employs an adaptive mechanism that dynamically narrows the search space based on a quantum-estimated probability distribution of the objective function. Methods A quantum state encodes information about solution quality through a complex-amplitude mapping, enabling identification of promising regions and progressive tightening of the search bounds; a classical optimizer then performs local refinement. The analysis shows contraction of the search space toward global optima with controlled computational complexity. Results In simulation on standard benchmarks (Rastrigin, Styblinski-Tang, Rosenbrock), QAGS attains solutions at or near the true minima with very small absolute errors. Against an Adaptive Grid Search on the Sphere function, QAGS achieves comparable accuracy and shows increasing efficiency with dimensionality. Discussion These results indicate that amplitude-encoded region selection combined with classical refinement effectively contracts the search space and can reduce time and space requirements, especially at higher dimensions, while practical hardware implementations of amplitude encoding remain challenging.

DOI
10.3389/fams.2025.1662682

Related papers

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

Quantum Genetic Algorithm with Dynamic Encoding Scheme

Jun Suk Kim, Man-Je Kim, Chang Wook Ahn

The field of Quantum Genetic Algorithm (QGA) has seen extensive efforts to develop reasonable algorithmic designs mainly due to its potential as well as the intrinsic difficulty to reproduce the necessary processes with the limited amount of quantum resources available, although it still remains one of rather theoretical concepts of approach to achieving quantum optimization. In this paper, we propose a dynamic encoding scheme that combines quantum adaptive search with iterative approximation of the search region. The method reuses the same quantum index register while updating the classical coordinate mapping associated with its basis states, thereby increasing local coordinate resolution without globally refining the entire continuous domain. Through noiseless statevector simulations on benchmark functions, we compare the proposed method with selected QGA variants in terms of final optimization accuracy and simulated qubit usage. The results show improved optimization performance under similar maximum qubit constraints, establishing a simulation-level resource advantage.

Informatica•Jan 1, 2026•0 citations

基于量子自适应的概率图搜索

Jincheng Zhang

This paper introduces a novel probabilistic graph search algorithm, dubbed "Quantum Adaptive Probability Search" (QAPS), that leverages quantum self-adaptation to enhance exploration within complex search spaces. Traditional probabilistic graph search methods often suffer from inefficiency, particularly in problems with intricate search landscapes. QAPS employs a quantum-inspired self-adaptation mechanism to dynamically restructure the graph, facilitating more efficient exploration and ultimately, the identification of optimal solutions. We demonstrate the algorithm's efficacy through a series of benchmark problems, highlighting its superior performance compared to established methods in terms of both search time and solution quality. The core mechanism centers around the creation of a quantum-informed probability graph, allowing for adaptive node and edge weights, which significantly improves the algorithm's ability to navigate challenging search spaces.

•Sep 2, 2026•0 citations

Quantum-Inspired Optimization via Adaptive Sampling (QIAO)

Jincheng Zhang

This paper introduces Quantum-Inspired Optimization via Adaptive Sampling (QIAO), a novel technique for complex system optimization. Traditional optimization methods often struggle with the inherent complexity of real-world problems, frequently requiring exhaustive search or computationally expensive approximations. QIAO leverages quantum-inspired principles to dynamically sample regions of the solution space, focusing on areas exhibiting higher potential for improvement. This adaptive sampling strategy significantly enhances efficiency compared to traditional methods, particularly in scenarios with high dimensionality and complex interactions within the system. We present a detailed explanation of the algorithm's design, its implementation, and preliminary results demonstrating its efficacy in a simulated optimization problem. The focus is on demonstrating the practical advantages of this approach through a quantifiable improvement in performance.

•Sep 1, 2026•0 citations

Quantum Adaptive Optimization

Jincheng Zhang

Quantum Adaptive Optimization is a novel quantum optimization algorithm designed to address the challenges posed by large-scale optimization problems. Traditional optimization algorithms often rely on classical computation, limiting their effectiveness to relatively small problem sizes. This paper introduces a quantum-enhanced optimization approach that leverages quantum properties such as superposition and entanglement to achieve significantly improved performance. The core mechanism centers around utilizing quantum phenomena to guide the search process, resulting in efficient optimization solutions. This work presents a framework for tackling complex problems with enhanced computational capabilities and offers a potential shift towards more powerful optimization techniques.

•Aug 31, 2026•0 citations

Quantum-Inspired Genetic Algorithms for Large-Scale Optimization

Andrei Popescu

Large-scale optimization (LSO) problems—those with hundreds to thousands of decision variables—are prevalent in engineering design, logistics, telecommunications, and machine learning hyperparameter search. Classical evolutionary algorithms often struggle in this regime due to premature convergence and prohibitive search costs. This manuscript presents a Quantum-Inspired Genetic Algorithm (QIGA) that transfers three ideas from quantum computation into a purely classical algorithm: (i) Q-bit angle encoding that maintains a compact, uncertainty-aware distribution over decision values, (ii) rotation-gate adaptation that updates search probabilities toward promising regions while preserving exploration, and (iii) quantum observation that draws diverse candidate solutions from the encoded amplitudes at each generation. We further couple the core QIGA with (a) an island-model decomposition for ultra-high dimensionality, (b) surrogate-assisted local refinement for exploitation at low cost, and (c) a feasibility-aware penalty for constraints. We evaluate the approach on five canonical continuous benchmarks in 1,000 dimensions (Sphere, Rosenbrock, Rastrigin, Ackley, Griewank) under a fixed computational budget. Across 30 independent runs per function, QIGA achieves lower final objective values and higher success rates than classical GA, PSO, and DE baselines. A non-parametric Wilcoxon signed-rank test indicates statistically significant improvements for QIGA (adjusted p < 0.01) on all functions. We analyze the algorithm’s scaling behavior, the role of angle-space step control, and the contribution of island-level diversity. The results suggest that quantum-inspired probability evolution provides a robust inductive bias for LSO by decoupling representation capacity from point estimates and by enabling distribution-aware search moves. We conclude with practical guidelines for tuning and discuss extensions to constrained and mixed-variable problems.

International Journal of Advanced Research in Computer Science and Engineering•Apr 4, 2026•0 citations
Introduction We present Quantum Adaptive Search (QAGS), a hybrid quantum-classical algorithm for global optimization of multivariate functions. The method employs an adaptive mechanism that dynamically narrows the search space based on a quantum-estimated probability distribution of the objective function. Methods A quantum state encodes information about solution quality through a complex-amplitude mapping, enabling identification of promising regions and progressive tightening of the search bounds; a classical optimizer then performs local refinement. The analysis shows contraction of the search space toward global optima with controlled computational complexity. Results In simulation on standard benchmarks (Rastrigin, Styblinski-Tang, Rosenbrock), QAGS attains solutions at or near the true minima with very small absolute errors. Against an Adaptive Grid Search on the Sphere function, QAGS achieves comparable accuracy and shows increasing efficiency with dimensionality. Discussion These results indicate that amplitude-encoded region selection combined with classical refinement effectively contracts the search space and can reduce time and space requirements, especially at higher dimensions, while practical hardware implementations of amplitude encoding remain challenging.
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.
The field of Quantum Genetic Algorithm (QGA) has seen extensive efforts to develop reasonable algorithmic designs mainly due to its potential as well as the intrinsic difficulty to reproduce the necessary processes with the limited amount of quantum resources available, although it still remains one of rather theoretical concepts of approach to achieving quantum optimization. In this paper, we propose a dynamic encoding scheme that combines quantum adaptive search with iterative approximation of the search region. The method reuses the same quantum index register while updating the classical coordinate mapping associated with its basis states, thereby increasing local coordinate resolution without globally refining the entire continuous domain. Through noiseless statevector simulations on benchmark functions, we compare the proposed method with selected QGA variants in terms of final optimization accuracy and simulated qubit usage. The results show improved optimization performance under similar maximum qubit constraints, establishing a simulation-level resource advantage.
This paper introduces a novel probabilistic graph search algorithm, dubbed "Quantum Adaptive Probability Search" (QAPS), that leverages quantum self-adaptation to enhance exploration within complex search spaces. Traditional probabilistic graph search methods often suffer from inefficiency, particularly in problems with intricate search landscapes. QAPS employs a quantum-inspired self-adaptation mechanism to dynamically restructure the graph, facilitating more efficient exploration and ultimately, the identification of optimal solutions. We demonstrate the algorithm's efficacy through a series of benchmark problems, highlighting its superior performance compared to established methods in terms of both search time and solution quality. The core mechanism centers around the creation of a quantum-informed probability graph, allowing for adaptive node and edge weights, which significantly improves the algorithm's ability to navigate challenging search spaces.
This paper introduces Quantum-Inspired Optimization via Adaptive Sampling (QIAO), a novel technique for complex system optimization. Traditional optimization methods often struggle with the inherent complexity of real-world problems, frequently requiring exhaustive search or computationally expensive approximations. QIAO leverages quantum-inspired principles to dynamically sample regions of the solution space, focusing on areas exhibiting higher potential for improvement. This adaptive sampling strategy significantly enhances efficiency compared to traditional methods, particularly in scenarios with high dimensionality and complex interactions within the system. We present a detailed explanation of the algorithm's design, its implementation, and preliminary results demonstrating its efficacy in a simulated optimization problem. The focus is on demonstrating the practical advantages of this approach through a quantifiable improvement in performance.
Quantum Adaptive Optimization is a novel quantum optimization algorithm designed to address the challenges posed by large-scale optimization problems. Traditional optimization algorithms often rely on classical computation, limiting their effectiveness to relatively small problem sizes. This paper introduces a quantum-enhanced optimization approach that leverages quantum properties such as superposition and entanglement to achieve significantly improved performance. The core mechanism centers around utilizing quantum phenomena to guide the search process, resulting in efficient optimization solutions. This work presents a framework for tackling complex problems with enhanced computational capabilities and offers a potential shift towards more powerful optimization techniques.
Large-scale optimization (LSO) problems—those with hundreds to thousands of decision variables—are prevalent in engineering design, logistics, telecommunications, and machine learning hyperparameter search. Classical evolutionary algorithms often struggle in this regime due to premature convergence and prohibitive search costs. This manuscript presents a Quantum-Inspired Genetic Algorithm (QIGA) that transfers three ideas from quantum computation into a purely classical algorithm: (i) Q-bit angle encoding that maintains a compact, uncertainty-aware distribution over decision values, (ii) rotation-gate adaptation that updates search probabilities toward promising regions while preserving exploration, and (iii) quantum observation that draws diverse candidate solutions from the encoded amplitudes at each generation. We further couple the core QIGA with (a) an island-model decomposition for ultra-high dimensionality, (b) surrogate-assisted local refinement for exploitation at low cost, and (c) a feasibility-aware penalty for constraints. We evaluate the approach on five canonical continuous benchmarks in 1,000 dimensions (Sphere, Rosenbrock, Rastrigin, Ackley, Griewank) under a fixed computational budget. Across 30 independent runs per function, QIGA achieves lower final objective values and higher success rates than classical GA, PSO, and DE baselines. A non-parametric Wilcoxon signed-rank test indicates statistically significant improvements for QIGA (adjusted p < 0.01) on all functions. We analyze the algorithm’s scaling behavior, the role of angle-space step control, and the contribution of island-level diversity. The results suggest that quantum-inspired probability evolution provides a robust inductive bias for LSO by decoupling representation capacity from point estimates and by enabling distribution-aware search moves. We conclude with practical guidelines for tuning and discuss extensions to constrained and mixed-variable problems.