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 Applied Sciences

The Quantum Approach Leading from Evolutionary to Exhaustive Optimization

Massimo Panella, Giuseppe Martinelli

Published Sep 15, 2012• 2 citations
Publisher

Abstract

What bio-inspired algorithms mimic are natural mechanisms governing the macroscopic world for optimizing actual performances that are of vital importance. Neural and neurofuzzy networks, genetic, swarm-intelligence and other evolutionary algorithms are well-known results of this imitation. A completely different situation characterizes the microscopic world governed by quantum mechanics. All the possible solutions exist simultaneously in superposition and the problem is to extract the optimal one. In this case, basic mechanisms of quantum mechanics, i.e., superposition and entanglement, are necessary to mimic nature. Following the latter approach, in this paper a quantum architecture was proposed for determining the maximum/minimum in a set of positive integers which is a basic problem related to optimization. The proposed architecture is based on a suitable nonlinear quantum operator and it solves the said problem by an exhaustive search. This was illustrated in detail in the case of a typical NP-complete problem. © 2012 Asian Network for Scientific Information.

DOI
10.3923/jas.2012.1995.2005

Related papers

Exploiting Quantum Entanglement and Quantum Superposition for Nature-Inspired Optimization

Massimo Panella

Nature-inspired optimization relies on the observation of the efficacy of natural mechanisms for achieving optimal results in the case of processes of vital importance. What is imitated in this case belong to the macroscopic world. However, nature operates with the same efficacy also at the microscopic level, where the laws governing it are those of quantum mechanics. Hence, it is quite reasonable to investigate at this level the possibility of obtaining efficacious optimization algorithms. In the present chapter, a quantum algorithm is proposed for solving a basic problem related to optimization: the determination of the maximum (minimum) in a set of positive integers. The suggested algorithm solves the said problem by an exhaustive procedure based on a suitable nonlinear quantum operator. An example illustrates the details of the algorithm. © 2011 by Nova Science Publishers, Inc. All rights reserved.

•Jan 1, 2012•0 citations

Quantum-Inspired Evolutionary Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems by integrating quantum-inspired concepts within an evolutionary algorithm framework. Traditional evolutionary algorithms, such as Genetic Algorithms and Differential Evolution, can struggle with high-dimensional and complex search spaces, often exhibiting slow convergence rates. We hypothesize that principles derived from quantum mechanics, specifically superposition and entanglement, can provide a more effective mechanism for exploring these spaces. Our proposed Quantum-Inspired Evolutionary Algorithm (QIEA) incorporates operators designed to mimic quantum interference and entanglement, allowing for a more nuanced and potentially faster exploration of the solution landscape. The core claim is that these quantum-inspired mechanisms can significantly enhance the efficiency of evolutionary optimization. The paper details the algorithm's design, including the implementation of interference and entanglement operators, and discusses its potential advantages and challenges. Experimental results (though not presented through dedicated experimental sections) demonstrate the algorithm's ability to outperform standard evolutionary algorithms on a range of benchmark problems.

•Aug 29, 2026•0 citations

Quantum-Inspired Optimization of Neural Network Architecture

Jincheng Zhang

This paper explores a novel approach to neural network architecture optimization inspired by quantum superposition and measurement. Traditional neural network architecture search methods, such as reinforcement learning or evolutionary algorithms, often suffer from computational bottlenecks and slow convergence rates. We propose a genetic algorithm that leverages quantum-inspired probability amplitudes to represent and evaluate neural network architectures. Each architecture is assigned a set of probability amplitudes, reflecting the potential for success. Through a simulated measurement process, the algorithm dynamically adjusts these amplitudes, favoring architectures with higher potential and accelerating the search for optimal configurations. The core idea is that quantum superposition allows us to explore a vast solution space concurrently, while the measurement process mimics the collapse of the wave function, focusing the search on promising candidates. This approach demonstrates the potential to significantly reduce the time and resources required for neural network architecture design, paving the way for more efficient and powerful deep learning models. We present a detailed theoretical framework and outline the key components of the algorithm, emphasizing its ability to mimic quantum phenomena for architectural optimization.

•Aug 31, 2026•0 citations

Neural networks with quantum architecture and quantum learning

Massimo Panella, Giuseppe Martinelli

Abstract A method is proposed for solving the two key problems facing quantum neural networks: introduction of nonlinearity in the neuron operation and efficient use of quantum superposition in the learning algorithm. The former is indirectly solved by using suitable Boolean functions. The latter is based on the use of a suitable nonlinear quantum circuit. The resulting learning procedure does not apply any optimization method. The optimal neural network is obtained by applying an exhaustive search among all the possible solutions. The exhaustive search is carried out by the proposed quantum circuit composed of both linear and nonlinear components. Copyright © 2009 John Wiley & Sons, Ltd.

International Journal of Circuit Theory and Applications•Jul 23, 2009•75 citations

Neurofuzzy Networks With Nonlinear Quantum Learning

Massimo Panella, Giovanni Martinelli

Nonlinear quantum processing allows the solution of an optimization problem by the exhaustive search on all its possible solutions. Hence, it can replace advantageously the algorithms for learning from a training set. In order to pursue this possibility in the case of neurofuzzy networks, we propose in this paper to tailor their architectures to the requirements of quantum processing. In particular, superposition is introduced to pursue parallelism and entanglement to associate the network performance with each solution present in the superposition. Two aspects of the proposed method are considered in detail: the binary structure of membership functions and fuzzy reasoning and the use of a particular nonlinear quantum algorithm for extracting the optimal neurofuzzy network by exhaustive search.

IEEE Transactions on Fuzzy Systems•Mar 9, 2009•39 citations

Quantum-Inspired Evolutionary Algorithms for Optimization Problems

Jincheng Zhang

This paper investigates the application of quantum-inspired techniques to enhance the performance of evolutionary algorithms (EAs) for solving complex optimization problems. Traditional EAs often struggle with slow convergence rates, particularly in high-dimensional search spaces. We propose a novel approach that integrates concepts from quantum mechanics, specifically superposition and interference, into the selection and mutation operators of EAs. The core idea is to leverage the ability of quantum systems to explore multiple possibilities simultaneously, thereby accelerating the convergence process. We demonstrate the effectiveness of this hybrid algorithm through theoretical analysis and illustrate its potential through detailed mathematical formulations. The results indicate a significant improvement in convergence speed and robustness compared to standard EAs, suggesting a promising direction for future research in optimization. The primary focus is on developing an EA that mimics quantum superposition to examine multiple solutions simultaneously and then uses interference to guide the search towards optimal solutions. This approach aims to address the limitations of conventional EAs, particularly in challenging optimization scenarios.

•Aug 29, 2026•0 citations
What bio-inspired algorithms mimic are natural mechanisms governing the macroscopic world for optimizing actual performances that are of vital importance. Neural and neurofuzzy networks, genetic, swarm-intelligence and other evolutionary algorithms are well-known results of this imitation. A completely different situation characterizes the microscopic world governed by quantum mechanics. All the possible solutions exist simultaneously in superposition and the problem is to extract the optimal one. In this case, basic mechanisms of quantum mechanics, i.e., superposition and entanglement, are necessary to mimic nature. Following the latter approach, in this paper a quantum architecture was proposed for determining the maximum/minimum in a set of positive integers which is a basic problem related to optimization. The proposed architecture is based on a suitable nonlinear quantum operator and it solves the said problem by an exhaustive search. This was illustrated in detail in the case of a typical NP-complete problem. © 2012 Asian Network for Scientific Information.
Nature-inspired optimization relies on the observation of the efficacy of natural mechanisms for achieving optimal results in the case of processes of vital importance. What is imitated in this case belong to the macroscopic world. However, nature operates with the same efficacy also at the microscopic level, where the laws governing it are those of quantum mechanics. Hence, it is quite reasonable to investigate at this level the possibility of obtaining efficacious optimization algorithms. In the present chapter, a quantum algorithm is proposed for solving a basic problem related to optimization: the determination of the maximum (minimum) in a set of positive integers. The suggested algorithm solves the said problem by an exhaustive procedure based on a suitable nonlinear quantum operator. An example illustrates the details of the algorithm. © 2011 by Nova Science Publishers, Inc. All rights reserved.
This paper presents a novel approach to complex optimization problems by integrating quantum-inspired concepts within an evolutionary algorithm framework. Traditional evolutionary algorithms, such as Genetic Algorithms and Differential Evolution, can struggle with high-dimensional and complex search spaces, often exhibiting slow convergence rates. We hypothesize that principles derived from quantum mechanics, specifically superposition and entanglement, can provide a more effective mechanism for exploring these spaces. Our proposed Quantum-Inspired Evolutionary Algorithm (QIEA) incorporates operators designed to mimic quantum interference and entanglement, allowing for a more nuanced and potentially faster exploration of the solution landscape. The core claim is that these quantum-inspired mechanisms can significantly enhance the efficiency of evolutionary optimization. The paper details the algorithm's design, including the implementation of interference and entanglement operators, and discusses its potential advantages and challenges. Experimental results (though not presented through dedicated experimental sections) demonstrate the algorithm's ability to outperform standard evolutionary algorithms on a range of benchmark problems.
This paper explores a novel approach to neural network architecture optimization inspired by quantum superposition and measurement. Traditional neural network architecture search methods, such as reinforcement learning or evolutionary algorithms, often suffer from computational bottlenecks and slow convergence rates. We propose a genetic algorithm that leverages quantum-inspired probability amplitudes to represent and evaluate neural network architectures. Each architecture is assigned a set of probability amplitudes, reflecting the potential for success. Through a simulated measurement process, the algorithm dynamically adjusts these amplitudes, favoring architectures with higher potential and accelerating the search for optimal configurations. The core idea is that quantum superposition allows us to explore a vast solution space concurrently, while the measurement process mimics the collapse of the wave function, focusing the search on promising candidates. This approach demonstrates the potential to significantly reduce the time and resources required for neural network architecture design, paving the way for more efficient and powerful deep learning models. We present a detailed theoretical framework and outline the key components of the algorithm, emphasizing its ability to mimic quantum phenomena for architectural optimization.
Abstract A method is proposed for solving the two key problems facing quantum neural networks: introduction of nonlinearity in the neuron operation and efficient use of quantum superposition in the learning algorithm. The former is indirectly solved by using suitable Boolean functions. The latter is based on the use of a suitable nonlinear quantum circuit. The resulting learning procedure does not apply any optimization method. The optimal neural network is obtained by applying an exhaustive search among all the possible solutions. The exhaustive search is carried out by the proposed quantum circuit composed of both linear and nonlinear components. Copyright © 2009 John Wiley & Sons, Ltd.
Nonlinear quantum processing allows the solution of an optimization problem by the exhaustive search on all its possible solutions. Hence, it can replace advantageously the algorithms for learning from a training set. In order to pursue this possibility in the case of neurofuzzy networks, we propose in this paper to tailor their architectures to the requirements of quantum processing. In particular, superposition is introduced to pursue parallelism and entanglement to associate the network performance with each solution present in the superposition. Two aspects of the proposed method are considered in detail: the binary structure of membership functions and fuzzy reasoning and the use of a particular nonlinear quantum algorithm for extracting the optimal neurofuzzy network by exhaustive search.
This paper investigates the application of quantum-inspired techniques to enhance the performance of evolutionary algorithms (EAs) for solving complex optimization problems. Traditional EAs often struggle with slow convergence rates, particularly in high-dimensional search spaces. We propose a novel approach that integrates concepts from quantum mechanics, specifically superposition and interference, into the selection and mutation operators of EAs. The core idea is to leverage the ability of quantum systems to explore multiple possibilities simultaneously, thereby accelerating the convergence process. We demonstrate the effectiveness of this hybrid algorithm through theoretical analysis and illustrate its potential through detailed mathematical formulations. The results indicate a significant improvement in convergence speed and robustness compared to standard EAs, suggesting a promising direction for future research in optimization. The primary focus is on developing an EA that mimics quantum superposition to examine multiple solutions simultaneously and then uses interference to guide the search towards optimal solutions. This approach aims to address the limitations of conventional EAs, particularly in challenging optimization scenarios.