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

IEEE Congress on Evolutionary Computation (CEC)

QiSA: A Parameter-free Quantum-inspired Search Algorithm – A Preliminary Study on Combinatorial Optimization

Kuo-Chun Tseng, Wei-Chieh Lai, Chen-Hsin Lu, Wei-Chun Huang, Jen-Shin Hong, Hsin‐Hung Cho

Published Jun 1, 2026• 0 citations
Publisher

Abstract

This study is inspired by quantum algorithms and proposes the Quantum-inspired Search Algorithm (QiSA), an entropy-driven quantum-inspired metaheuristic for parameter-free combinatorial optimization. Guided by Occam’s razor, QiSA simplifies the search process and reduces parameter dependence as much as possible in this preliminary study. It uses entropy as the core signal to unify parameter control, overcoming the traditional dilemma of balancing exploration and exploitation, and maps it to a confidence-like level to define an interpretable closed-loop termination criterion. QiSA also exhibits several observable quantum-like behaviors during the search, reflecting characteristic phenomena associated with quantum algorithms. Experiments on classic combinatorial optimization benchmarks show that QiSA delivers robust, consistent, and competitive performance, with the potential to stand alongside Differential Evolution in combinatorial optimization.

DOI
10.1109/cec69861.2026.11727248

Related papers

Quantum-Inspired Stochastic Search for Combinatorial Optimization

Jincheng Zhang

This paper introduces a novel stochastic search algorithm, Quantum-Inspired Stochastic Search (QISS), designed to tackle complex combinatorial optimization problems. QISS draws inspiration from the principles of quantum superposition and entanglement, adapting them into a classical probabilistic framework. Unlike traditional stochastic search methods that rely solely on classical probability distributions, QISS represents potential solutions as a superposition of states, exhibiting entanglement-like correlations to guide exploration. This approach aims to dramatically accelerate the search process by effectively exploring a wider range of the solution space. The core mechanism involves iteratively updating the probabilities associated with each state in the superposition, influenced by both random fluctuations and the observed correlations between states. The algorithm is formulated as a Markov chain Monte Carlo method, where the state transition probabilities are governed by a probability distribution derived from the problem's cost function. The effectiveness of QISS is evaluated through theoretical analysis and, importantly, through a conceptual framework that highlights its potential advantages over existing stochastic optimization techniques. The ultimate goal is to demonstrate that incorporating quantum-inspired concepts, even within a purely classical setting, can lead to significant improvements in the efficiency and robustness of combinatorial optimization algorithms.

•Sep 6, 2026•0 citations

QISA: Incorporating quantum computation into Simulated Annealing for optimization problems

Zhanghui Chen, Ping Luo

This paper proposes a novel model of QISA (Quantum-Inspired Simulated Annealing) which embeds quantum computation into the Simulated Annealing (SA) process for optimization problems. Compared with previous SA studies, QISA adopts Quantum Bits (Qubits) rather than the conventional binary bits as the coding scheme, and update the entries in the Qubits sequence with different probabilities by the proposed methods of heat observation and quantum rotation gate. By flexibly controlling the heating function and rotation angle, QISA does not have to either accept or reject, but can partially accept a new solution. The careful experiments on a number of numerical optimization and combinatorial optimization problems validate its better convergent performance and lower sensitivity to parameters.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2011•7 citations

Quantum-Inspired Search Algorithms for Combinatorial Optimization

Jincheng Zhang

This paper explores the application of quantum-inspired concepts to the field of combinatorial optimization. Traditional search algorithms often struggle with the complexity of problems involving numerous possible solutions. We propose a novel approach that leverages the principles of quantum superposition and interference, albeit within a classical computing framework, to enhance the efficiency of search processes. The core of our method involves a hybrid algorithm that combines established classical search techniques with probabilistic sampling strategies informed by quantum mechanics. We aim to demonstrate that by mimicking these quantum phenomena, we can significantly improve the speed and effectiveness of solving complex combinatorial optimization problems. The algorithm's performance is evaluated through theoretical analysis and conceptual design, focusing on the potential for achieving performance gains without requiring actual quantum hardware. The key contribution lies in the strategic application of probabilistic sampling to explore solution spaces in a manner analogous to quantum superposition, followed by interference-like mechanisms to guide the search towards promising regions. This approach represents a new direction in optimization, bridging the gap between classical and quantum computing paradigms.

•Aug 28, 2026•0 citations

Quantum-inspired search algorithms for optimizing complex systems

Saxena Smailov Egon, Angara Han Mizuta, Hamoud Osaba

This research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.

Journal of Computer Science and Research (JoCoSiR)•Nov 30, 2023•0 citations

Quantum-Inspired Randomized Search for Algorithm Design

Jincheng Zhang

This paper explores a novel approach to randomized search algorithms, termed Quantum-Inspired Randomized Search (QIRS). The core premise is that the principles of quantum superposition and interference, traditionally associated with quantum computing, can be effectively translated into classical algorithms to enhance their efficiency. The proposed methodology involves representing candidate solutions as quantum states and utilizing interference patterns to strategically guide the search process. This departs from traditional randomized search which relies solely on random sampling, introducing a layer of probabilistic control mimicking quantum behavior. The effectiveness of QIRS is evaluated through theoretical analysis and conceptual demonstrations, highlighting the potential for significant improvements in algorithm design, particularly in complex, high-dimensional search spaces. We demonstrate a shift in the search strategy from purely stochastic exploration to a more informed, interference-driven process. The key contribution lies in adapting quantum concepts to optimize the exploration process within randomized search, offering a new direction for algorithm design and optimization.

•Sep 3, 2026•0 citations

Solving Combinatorial Optimization problems with Quantum inspired Evolutionary Algorithm Tuned using a Novel Heuristic Method

Nija Mani, Gursaran, Ashish Mani

Quantum inspired Evolutionary Algorithms were proposed more than a decade ago and have been employed for solving a wide range of difficult search and optimization problems. A number of changes have been proposed to improve performance of canonical QEA. However, canonical QEA is one of the few evolutionary algorithms, which uses a search operator with relatively large number of parameters. It is well known that performance of evolutionary algorithms is dependent on specific value of parameters for a given problem. The advantage of having large number of parameters in an operator is that the search process can be made more powerful even with a single operator without requiring a combination of other operators for exploration and exploitation. However, the tuning of operators with large number of parameters is complex and computationally expensive. This paper proposes a novel heuristic method for tuning parameters of canonical QEA. The tuned QEA outperforms canonical QEA on a class of discrete combinatorial optimization problems which, validates the design of the proposed parameter tuning framework. The proposed framework can be used for tuning other algorithms with both large and small number of tunable parameters.

arXiv:1612.08109•Dec 23, 2016•3 citations
This study is inspired by quantum algorithms and proposes the Quantum-inspired Search Algorithm (QiSA), an entropy-driven quantum-inspired metaheuristic for parameter-free combinatorial optimization. Guided by Occam’s razor, QiSA simplifies the search process and reduces parameter dependence as much as possible in this preliminary study. It uses entropy as the core signal to unify parameter control, overcoming the traditional dilemma of balancing exploration and exploitation, and maps it to a confidence-like level to define an interpretable closed-loop termination criterion. QiSA also exhibits several observable quantum-like behaviors during the search, reflecting characteristic phenomena associated with quantum algorithms. Experiments on classic combinatorial optimization benchmarks show that QiSA delivers robust, consistent, and competitive performance, with the potential to stand alongside Differential Evolution in combinatorial optimization.
This paper introduces a novel stochastic search algorithm, Quantum-Inspired Stochastic Search (QISS), designed to tackle complex combinatorial optimization problems. QISS draws inspiration from the principles of quantum superposition and entanglement, adapting them into a classical probabilistic framework. Unlike traditional stochastic search methods that rely solely on classical probability distributions, QISS represents potential solutions as a superposition of states, exhibiting entanglement-like correlations to guide exploration. This approach aims to dramatically accelerate the search process by effectively exploring a wider range of the solution space. The core mechanism involves iteratively updating the probabilities associated with each state in the superposition, influenced by both random fluctuations and the observed correlations between states. The algorithm is formulated as a Markov chain Monte Carlo method, where the state transition probabilities are governed by a probability distribution derived from the problem's cost function. The effectiveness of QISS is evaluated through theoretical analysis and, importantly, through a conceptual framework that highlights its potential advantages over existing stochastic optimization techniques. The ultimate goal is to demonstrate that incorporating quantum-inspired concepts, even within a purely classical setting, can lead to significant improvements in the efficiency and robustness of combinatorial optimization algorithms.
This paper proposes a novel model of QISA (Quantum-Inspired Simulated Annealing) which embeds quantum computation into the Simulated Annealing (SA) process for optimization problems. Compared with previous SA studies, QISA adopts Quantum Bits (Qubits) rather than the conventional binary bits as the coding scheme, and update the entries in the Qubits sequence with different probabilities by the proposed methods of heat observation and quantum rotation gate. By flexibly controlling the heating function and rotation angle, QISA does not have to either accept or reject, but can partially accept a new solution. The careful experiments on a number of numerical optimization and combinatorial optimization problems validate its better convergent performance and lower sensitivity to parameters.
This paper explores the application of quantum-inspired concepts to the field of combinatorial optimization. Traditional search algorithms often struggle with the complexity of problems involving numerous possible solutions. We propose a novel approach that leverages the principles of quantum superposition and interference, albeit within a classical computing framework, to enhance the efficiency of search processes. The core of our method involves a hybrid algorithm that combines established classical search techniques with probabilistic sampling strategies informed by quantum mechanics. We aim to demonstrate that by mimicking these quantum phenomena, we can significantly improve the speed and effectiveness of solving complex combinatorial optimization problems. The algorithm's performance is evaluated through theoretical analysis and conceptual design, focusing on the potential for achieving performance gains without requiring actual quantum hardware. The key contribution lies in the strategic application of probabilistic sampling to explore solution spaces in a manner analogous to quantum superposition, followed by interference-like mechanisms to guide the search towards promising regions. This approach represents a new direction in optimization, bridging the gap between classical and quantum computing paradigms.
This research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.
This paper explores a novel approach to randomized search algorithms, termed Quantum-Inspired Randomized Search (QIRS). The core premise is that the principles of quantum superposition and interference, traditionally associated with quantum computing, can be effectively translated into classical algorithms to enhance their efficiency. The proposed methodology involves representing candidate solutions as quantum states and utilizing interference patterns to strategically guide the search process. This departs from traditional randomized search which relies solely on random sampling, introducing a layer of probabilistic control mimicking quantum behavior. The effectiveness of QIRS is evaluated through theoretical analysis and conceptual demonstrations, highlighting the potential for significant improvements in algorithm design, particularly in complex, high-dimensional search spaces. We demonstrate a shift in the search strategy from purely stochastic exploration to a more informed, interference-driven process. The key contribution lies in adapting quantum concepts to optimize the exploration process within randomized search, offering a new direction for algorithm design and optimization.
Quantum inspired Evolutionary Algorithms were proposed more than a decade ago and have been employed for solving a wide range of difficult search and optimization problems. A number of changes have been proposed to improve performance of canonical QEA. However, canonical QEA is one of the few evolutionary algorithms, which uses a search operator with relatively large number of parameters. It is well known that performance of evolutionary algorithms is dependent on specific value of parameters for a given problem. The advantage of having large number of parameters in an operator is that the search process can be made more powerful even with a single operator without requiring a combination of other operators for exploration and exploitation. However, the tuning of operators with large number of parameters is complex and computationally expensive. This paper proposes a novel heuristic method for tuning parameters of canonical QEA. The tuned QEA outperforms canonical QEA on a class of discrete combinatorial optimization problems which, validates the design of the proposed parameter tuning framework. The proposed framework can be used for tuning other algorithms with both large and small number of tunable parameters.