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

Algorithms

Thermonuclear Fusion Based Quantum-Inspired Algorithm for Solving Multiobjective Optimization Problems

Liliya Anatolievna Demidova, Владимир Владимирович Масленников

Published Dec 15, 2025• 0 citations
Publisher

Abstract

This paper introduces a novel quantum-inspired algorithm for numerical multiobjective optimization, uniquely integrating the multilevel structure of qudits with principles of controlled thermonuclear fusion. Moving beyond conventional qubit-based approaches, the algorithm leverages the qudit’s higher-dimensional state space to enhance search capabilities. Fusion-inspired dynamics—modeling particle interaction, energy release, and plasma cooling—provide a powerful metaheuristic framework for navigating complex, high-dimensional Pareto fronts. A hybrid quantum-classical version of the algorithm is presented, designed to exploit the complementary strengths of both computational paradigms for improved efficiency in solving dynamic multiobjective problems. Experimental evaluation on standard dynamic multiobjective benchmarks demonstrates clear performance advantages. Both the quantum-inspired and hybrid variants consistently outperform leading classical algorithms such as NSGA-III, MOEA/D and GDE3, as well as the quantum-inspired NSGA-III, in key metrics: identifying a greater number of unique non-dominated solutions, ensuring superior uniformity along the Pareto front, maintaining stable convergence across generations, and achieving higher accuracy in approximating the ideal solution.

DOI
10.3390/a18120793

Related papers

Enhanced Multi-Objective Quantum-Inspired Computing for Practical Portfolio Optimization

Yao–Hsin Chou, Yong-Feng Tong, Shu–Yu Kuo +2 more

Quantum-inspired optimization (QIO) has gained attention for leveraging both quantum and classical advantages to enhance search efficiency in solving complex optimization problems on classical computers. While most QIO approaches have shown strong potential in addressing single-objective optimization, real-world problems often involve conflicting objectives, making them inherently multi-objective and challenging to solve. Unlike single-objective optimization, which seeks a single optimal solution, multi-objective optimization aims to obtain a set of Pareto-optimal solutions. This study extends QIO to multi-objective optimization (MoQIO) by incorporating quantum-inspired characteristics and provides an in-depth analysis of its performance. It utilizes quantum superposition and Q-gates to enhance convergence efficiency toward the Pareto front, while leveraging entanglement properties to expand solution diversity. Our results demonstrate that the proposed MoQIO effectively generates a diverse set of optimal portfolio solutions.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Jul 13, 2025•1 citation

Hybrid Quantum–Classical Supercomputing Framework for Optimization Problems

Aditi Kuhar, Megha Shinde, Arti Giram +1 more

Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.

International Journal on Advanced Computer Theory and Engineering•May 19, 2026•0 citations

Quantum-Inspired Evolutionary Algorithms for Optimization

Jincheng Zhang

This paper investigates the potential of incorporating quantum mechanical concepts into evolutionary algorithms (EAs) to improve their optimization capabilities. Traditional EAs, while effective, often struggle with complex search spaces and can get trapped in local optima. We propose a framework for developing quantum-inspired EAs that leverages principles such as superposition and entanglement to enhance exploration and exploitation strategies. The core idea is to introduce probabilistic operators and adaptive parameter control mimicking quantum behaviors. We present a detailed description of the proposed algorithm, focusing on the mathematical formulation of the key components, including the representation of solutions, the selection process, and the mutation operator. The algorithm's performance is evaluated on several benchmark optimization problems, demonstrating its potential to outperform conventional EAs in scenarios demanding high accuracy and rapid convergence. Furthermore, we analyze the theoretical implications of this approach, highlighting the advantages derived from quantum-inspired mechanisms. This work contributes to the ongoing research at the intersection of evolutionary computation and quantum information theory, offering a novel approach to tackling complex optimization challenges.

•Sep 3, 2026•0 citations

Quantum-Inspired Genetic Algorithms for Optimization

Jincheng Zhang

This paper explores the integration of quantum mechanical principles into genetic algorithms (GAs) to enhance their optimization capabilities. Traditional GAs operate based on classical probabilistic models, while this research proposes a novel approach that leverages concepts like superposition and tunneling to improve selection and crossover processes. The core idea is to mimic quantum phenomena within the GA framework, potentially leading to faster convergence and improved solutions for complex optimization problems. We detail the implementation of these quantum-inspired operators and present a theoretical framework for their application. The evaluation focuses on demonstrating the potential benefits of this hybrid approach through a series of simulated scenarios. The results suggest that incorporating quantum-inspired techniques can significantly improve the efficiency of the GA, particularly in situations with high dimensionality and intricate search spaces. This work represents a significant step toward bridging the gap between classical and quantum optimization paradigms.

•Aug 28, 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

Variational quantum multiobjective optimization

Linus Ekstrøm, Hao Wang, Sebastian Schmitt

Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attention in recent years. Currently, most studies have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multiobjective optimization problems on quantum computers. The proposed quantum multiobjective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the quantum circuit and produces a quantum state consisting of Pareto-optimal solutions in superposition. From this state, we retrieve a set of solutions and utilize the widely applied hypervolume indicator to determine its quality as an approximation to the Pareto front. The variational parameters of the QMOO circuit are tuned by maximizing the hypervolume indicator in a quantum-classical hybrid fashion. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives. We investigate the influence of the classical optimizer and the circuit depth, and compare them to results from classical optimization algorithms. We find that the algorithm is robust to shot noise and produces good results with as few as 128 measurement shots in each iteration. These promising results open the possibility to run the algorithm on near-term quantum hardware.

arXiv:2312.14151•Physical Review Research•May 12, 2025•20 citations
This paper introduces a novel quantum-inspired algorithm for numerical multiobjective optimization, uniquely integrating the multilevel structure of qudits with principles of controlled thermonuclear fusion. Moving beyond conventional qubit-based approaches, the algorithm leverages the qudit’s higher-dimensional state space to enhance search capabilities. Fusion-inspired dynamics—modeling particle interaction, energy release, and plasma cooling—provide a powerful metaheuristic framework for navigating complex, high-dimensional Pareto fronts. A hybrid quantum-classical version of the algorithm is presented, designed to exploit the complementary strengths of both computational paradigms for improved efficiency in solving dynamic multiobjective problems. Experimental evaluation on standard dynamic multiobjective benchmarks demonstrates clear performance advantages. Both the quantum-inspired and hybrid variants consistently outperform leading classical algorithms such as NSGA-III, MOEA/D and GDE3, as well as the quantum-inspired NSGA-III, in key metrics: identifying a greater number of unique non-dominated solutions, ensuring superior uniformity along the Pareto front, maintaining stable convergence across generations, and achieving higher accuracy in approximating the ideal solution.
Quantum-inspired optimization (QIO) has gained attention for leveraging both quantum and classical advantages to enhance search efficiency in solving complex optimization problems on classical computers. While most QIO approaches have shown strong potential in addressing single-objective optimization, real-world problems often involve conflicting objectives, making them inherently multi-objective and challenging to solve. Unlike single-objective optimization, which seeks a single optimal solution, multi-objective optimization aims to obtain a set of Pareto-optimal solutions. This study extends QIO to multi-objective optimization (MoQIO) by incorporating quantum-inspired characteristics and provides an in-depth analysis of its performance. It utilizes quantum superposition and Q-gates to enhance convergence efficiency toward the Pareto front, while leveraging entanglement properties to expand solution diversity. Our results demonstrate that the proposed MoQIO effectively generates a diverse set of optimal portfolio solutions.
Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.
This paper investigates the potential of incorporating quantum mechanical concepts into evolutionary algorithms (EAs) to improve their optimization capabilities. Traditional EAs, while effective, often struggle with complex search spaces and can get trapped in local optima. We propose a framework for developing quantum-inspired EAs that leverages principles such as superposition and entanglement to enhance exploration and exploitation strategies. The core idea is to introduce probabilistic operators and adaptive parameter control mimicking quantum behaviors. We present a detailed description of the proposed algorithm, focusing on the mathematical formulation of the key components, including the representation of solutions, the selection process, and the mutation operator. The algorithm's performance is evaluated on several benchmark optimization problems, demonstrating its potential to outperform conventional EAs in scenarios demanding high accuracy and rapid convergence. Furthermore, we analyze the theoretical implications of this approach, highlighting the advantages derived from quantum-inspired mechanisms. This work contributes to the ongoing research at the intersection of evolutionary computation and quantum information theory, offering a novel approach to tackling complex optimization challenges.
This paper explores the integration of quantum mechanical principles into genetic algorithms (GAs) to enhance their optimization capabilities. Traditional GAs operate based on classical probabilistic models, while this research proposes a novel approach that leverages concepts like superposition and tunneling to improve selection and crossover processes. The core idea is to mimic quantum phenomena within the GA framework, potentially leading to faster convergence and improved solutions for complex optimization problems. We detail the implementation of these quantum-inspired operators and present a theoretical framework for their application. The evaluation focuses on demonstrating the potential benefits of this hybrid approach through a series of simulated scenarios. The results suggest that incorporating quantum-inspired techniques can significantly improve the efficiency of the GA, particularly in situations with high dimensionality and intricate search spaces. This work represents a significant step toward bridging the gap between classical and quantum optimization paradigms.
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.
Solving combinatorial optimization problems on near-term quantum devices has gained a lot of attention in recent years. Currently, most studies have focused on single-objective problems, whereas many real-world applications need to consider multiple, mostly conflicting objectives, such as cost and quality. We present a variational quantum optimization algorithm to solve discrete multiobjective optimization problems on quantum computers. The proposed quantum multiobjective optimization (QMOO) algorithm incorporates all cost Hamiltonians representing the classical objective functions in the quantum circuit and produces a quantum state consisting of Pareto-optimal solutions in superposition. From this state, we retrieve a set of solutions and utilize the widely applied hypervolume indicator to determine its quality as an approximation to the Pareto front. The variational parameters of the QMOO circuit are tuned by maximizing the hypervolume indicator in a quantum-classical hybrid fashion. We show the effectiveness of the proposed algorithm on several benchmark problems with up to five objectives. We investigate the influence of the classical optimizer and the circuit depth, and compare them to results from classical optimization algorithms. We find that the algorithm is robust to shot noise and produces good results with as few as 128 measurement shots in each iteration. These promising results open the possibility to run the algorithm on near-term quantum hardware.