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)

An Innovative Knowledge Learning Adaptive Quantum-inspired Algorithm for Trend Ratio-Based Portfolio Construction Model

Shu–Yu Kuo, Yu-Chi Jiang, Ching-Hsuan Wu, Cheng-Yen Hua, Yun-Ting Lai, Yao–Hsin Chou

Published Jun 30, 2024• 0 citations
Publisher

Abstract

Quantum-inspired optimization is an emerging computational intelligence technique that achieves quantum advan-tages through inspiration from the mechanisms of quantum properties. Parameter control is vital for optimization methods to address complex problems with extensive solution spaces. However, static parameters lack adaptability, leading to issues like premature convergence, becoming trapped in local optima, and failing to uncover the global optimum. Therefore, we develop a novel adaptive mechanism to dynamically adjust parameters during algorithm execution to strike a remarkable balance between exploration and exploitation. This study first proposes the knowledge-navigated quantum-inspired tabu search (KNQTS) algorithm, which acquires insights from the ongoing process to adjust the environment-sensitive parameters adaptively and non-linearly. Differences between inter-iteration solutions can signal the extent of convergence and guide bidirectional adjustments of a parameter, facilitating the handling of com-plex optimization problems. KNQTS is applied to tackle real-world application portfolio construction problems in the financial technology field. Comprehensive experiments are conducted to demonstrate the substantial potential and robustness of KNQTS in rapidly identifying better solutions with higher probabilities in shorter durations compared to the other state-of-the-art methods. Statistical tests substantiate the significant superiority of KNQTS over these comparative algorithms.

DOI
10.1109/cec60901.2024.10611873

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-inspired Jaguar Algorithm for Real-World Financial Problems

Yao–Hsin Chou, Jyun–Yi Shen, Shu–Yu Kuo +1 more

Quantum-inspired algorithms simulate quantum characteristics on classical computers to accelerate the solution of complex real-world optimization problems. In the era before general-purpose quantum computers become practical, they offer a promising and accessible alternative for tackling such challenges. Among optimization problems, combinatorial types are particularly challenging due to discrete spaces, large scales, and strong variable dependencies. This study proposes a novel quantum-inspired algorithm named the quantum-inspired jaguar algorithm (QJA), specifically designed to address highly discrete and structurally complex combinatorial optimization problems. QJA integrates the adaptive hunting mechanism of the jaguar algorithm with the core concept of quantum-inspired tabu search algorithm, which guides the search by moving toward the best solution while avoiding the worst one. QJA dynamically adjusts its parameters based on historical information to accelerate convergence and efficiently explore the solution neighborhood. In addition, the algorithm incorporates an entangled local search mechanism to further enhance solution quality. QJA is evaluated on real-world portfolio optimization using data from the Toronto Stock Exchange. Results show that it outperforms other quantum-inspired algorithms in both stability and solution quality, demonstrating superior convergence and practical applicability.

IEEE Nanotechnology Magazine•Sep 29, 2025•0 citations

Quantum-Inspired Optimization with Adaptive Kernel Functions

Jincheng Zhang

This paper introduces a novel optimization algorithm, Quantum-Inspired Optimization with Adaptive Kernel Functions, designed to enhance the efficiency of complex optimization problems. We leverage quantum-inspired kernel functions to guide the evolution of the optimization process, fostering faster convergence and improving solution quality. The algorithm's core mechanism centers around dynamically adapting kernel parameters to navigate the problem space, mimicking the principles of quantum mechanics. This adaptation is achieved through a self-tuning process that continuously evaluates the impact of each kernel parameter on the optimization landscape. The paper explores the potential benefits of this approach, particularly in scenarios involving high dimensionality and complex non-convex functions, and presents preliminary results demonstrating improved performance compared to traditional optimization methods.

•Sep 3, 2026•0 citations

Title: Quantum-Inspired Constraint Optimization with Adaptive Sampling

Jincheng Zhang

Quantum-inspired constraint optimization is a promising approach to accelerate the discovery of optimal solutions in complex problems. This paper explores the application of adaptive sampling techniques to enhance the effectiveness of this method. We introduce a novel 'quantum-perturbed sampling' algorithm that leverages controlled randomness to guide the search process. The core mechanism centers around dynamically adjusting the sampling frequency based on the algorithm's performance, thereby improving the exploration of the solution space. The research demonstrates the potential of this approach to achieve faster convergence and better solution quality compared to traditional optimization methods. We evaluate the algorithm on a range of benchmark problems, showcasing its efficacy in tackling challenging optimization tasks.

•Sep 2, 2026•0 citations

Knowledge Navigated Quantum-inspired Tabu Search Algorithm for Reversible Circuit Synthesis

Hsing-Yu Hsu, Shan-Jung Hou, Yu-Yuan Chen +4 more

Reversible circuits are the essential building blocks of quantum computers and have zero energy dissipation. However, there is no general rule on how to synthesize an effective circuit with minimal cost. Many researchers have placed a high value on the design of algorithms for reversible circuit synthesis as it is the fundamental component to implement in many paradigms, such as Shor’s algorithm. In this paper, the knowledge navigated quantum-inspired tabu search algorithm (KNQTS) is proposed to synthesize several benchmark functions. KNQTS is a quantum-inspired algorithm with the concept of getting closer to the best solution and keeping away from the worst solution, and it has a great search ability. Furthermore, the proposed algorithm uses self-adaptive, global-best guided and Quantum-Not gate mechanisms to make all procedures more efficient and avoid sticking to the local optimum. This paper also compares the KNQTS approach’s experimental results with those obtained via other metaheuristics and previous algorithms. Finally, the result shows that the proposed KNQTS method outperforms other state-of-the-art methods and achieves the same functionality at a lower cost. The solutions are optimal or near-optimal.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 9, 2022•9 citations

Entanglement Local Search-Assisted Quantum-Inspired Optimization for Portfolio Optimization in G20 Markets

Shu–Yu Kuo, Yun-Ting Lai, Yu-Chi Jiang +6 more

Quantum computing is a next-generation computing paradigm that offers potential advantages for addressing complex real-world applications, such as portfolio optimization (PO). Quantum-inspired optimization (QIO) algorithms simulate quantum mechanisms to achieve quantum advantages using classical computers. QIO algorithms can serve as a bridge to realizing preliminary quantum advantages by exploiting classical computation abilities. In a detailed analysis of PO, a domain-dependent optimization technique is proposed combined with an effective QIO, called the entanglement local search-assisted (ELSA) technique. ELSA introduces the novel concept of the entangled neighborhood for PO and assists QIO in accurately searching a potential area, thus significantly promoting the quality of the solution. The entanglement relationship can decrease the degree of freedom searched. The proposed ELSA-QIO technique is employed in a trend ratio-based intelligent system to search for a steady uptrend portfolio in the global G20 markets. This study discusses the expanded markets to demonstrate the superior ability of the proposed QIO method in a vast solution space. Experiments demonstrate that the proposed system outperforms state-of-the-art methods. This study investigates the world's largest markets in-depth and proposes a strategy for global financial management that expands the use of quantum computing.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 15, 2023•14 citations
Quantum-inspired optimization is an emerging computational intelligence technique that achieves quantum advan-tages through inspiration from the mechanisms of quantum properties. Parameter control is vital for optimization methods to address complex problems with extensive solution spaces. However, static parameters lack adaptability, leading to issues like premature convergence, becoming trapped in local optima, and failing to uncover the global optimum. Therefore, we develop a novel adaptive mechanism to dynamically adjust parameters during algorithm execution to strike a remarkable balance between exploration and exploitation. This study first proposes the knowledge-navigated quantum-inspired tabu search (KNQTS) algorithm, which acquires insights from the ongoing process to adjust the environment-sensitive parameters adaptively and non-linearly. Differences between inter-iteration solutions can signal the extent of convergence and guide bidirectional adjustments of a parameter, facilitating the handling of com-plex optimization problems. KNQTS is applied to tackle real-world application portfolio construction problems in the financial technology field. Comprehensive experiments are conducted to demonstrate the substantial potential and robustness of KNQTS in rapidly identifying better solutions with higher probabilities in shorter durations compared to the other state-of-the-art methods. Statistical tests substantiate the significant superiority of KNQTS over these comparative algorithms.
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.
Quantum-inspired algorithms simulate quantum characteristics on classical computers to accelerate the solution of complex real-world optimization problems. In the era before general-purpose quantum computers become practical, they offer a promising and accessible alternative for tackling such challenges. Among optimization problems, combinatorial types are particularly challenging due to discrete spaces, large scales, and strong variable dependencies. This study proposes a novel quantum-inspired algorithm named the quantum-inspired jaguar algorithm (QJA), specifically designed to address highly discrete and structurally complex combinatorial optimization problems. QJA integrates the adaptive hunting mechanism of the jaguar algorithm with the core concept of quantum-inspired tabu search algorithm, which guides the search by moving toward the best solution while avoiding the worst one. QJA dynamically adjusts its parameters based on historical information to accelerate convergence and efficiently explore the solution neighborhood. In addition, the algorithm incorporates an entangled local search mechanism to further enhance solution quality. QJA is evaluated on real-world portfolio optimization using data from the Toronto Stock Exchange. Results show that it outperforms other quantum-inspired algorithms in both stability and solution quality, demonstrating superior convergence and practical applicability.
This paper introduces a novel optimization algorithm, Quantum-Inspired Optimization with Adaptive Kernel Functions, designed to enhance the efficiency of complex optimization problems. We leverage quantum-inspired kernel functions to guide the evolution of the optimization process, fostering faster convergence and improving solution quality. The algorithm's core mechanism centers around dynamically adapting kernel parameters to navigate the problem space, mimicking the principles of quantum mechanics. This adaptation is achieved through a self-tuning process that continuously evaluates the impact of each kernel parameter on the optimization landscape. The paper explores the potential benefits of this approach, particularly in scenarios involving high dimensionality and complex non-convex functions, and presents preliminary results demonstrating improved performance compared to traditional optimization methods.
Quantum-inspired constraint optimization is a promising approach to accelerate the discovery of optimal solutions in complex problems. This paper explores the application of adaptive sampling techniques to enhance the effectiveness of this method. We introduce a novel 'quantum-perturbed sampling' algorithm that leverages controlled randomness to guide the search process. The core mechanism centers around dynamically adjusting the sampling frequency based on the algorithm's performance, thereby improving the exploration of the solution space. The research demonstrates the potential of this approach to achieve faster convergence and better solution quality compared to traditional optimization methods. We evaluate the algorithm on a range of benchmark problems, showcasing its efficacy in tackling challenging optimization tasks.
Reversible circuits are the essential building blocks of quantum computers and have zero energy dissipation. However, there is no general rule on how to synthesize an effective circuit with minimal cost. Many researchers have placed a high value on the design of algorithms for reversible circuit synthesis as it is the fundamental component to implement in many paradigms, such as Shor’s algorithm. In this paper, the knowledge navigated quantum-inspired tabu search algorithm (KNQTS) is proposed to synthesize several benchmark functions. KNQTS is a quantum-inspired algorithm with the concept of getting closer to the best solution and keeping away from the worst solution, and it has a great search ability. Furthermore, the proposed algorithm uses self-adaptive, global-best guided and Quantum-Not gate mechanisms to make all procedures more efficient and avoid sticking to the local optimum. This paper also compares the KNQTS approach’s experimental results with those obtained via other metaheuristics and previous algorithms. Finally, the result shows that the proposed KNQTS method outperforms other state-of-the-art methods and achieves the same functionality at a lower cost. The solutions are optimal or near-optimal.
Quantum computing is a next-generation computing paradigm that offers potential advantages for addressing complex real-world applications, such as portfolio optimization (PO). Quantum-inspired optimization (QIO) algorithms simulate quantum mechanisms to achieve quantum advantages using classical computers. QIO algorithms can serve as a bridge to realizing preliminary quantum advantages by exploiting classical computation abilities. In a detailed analysis of PO, a domain-dependent optimization technique is proposed combined with an effective QIO, called the entanglement local search-assisted (ELSA) technique. ELSA introduces the novel concept of the entangled neighborhood for PO and assists QIO in accurately searching a potential area, thus significantly promoting the quality of the solution. The entanglement relationship can decrease the degree of freedom searched. The proposed ELSA-QIO technique is employed in a trend ratio-based intelligent system to search for a steady uptrend portfolio in the global G20 markets. This study discusses the expanded markets to demonstrate the superior ability of the proposed QIO method in a vast solution space. Experiments demonstrate that the proposed system outperforms state-of-the-art methods. This study investigates the world's largest markets in-depth and proposes a strategy for global financial management that expands the use of quantum computing.