© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

International Conference on Education Technology and Computer

An analytical optimization algorithm based on quantum computing embedded into evolutionary algorithm

Rajeev Kumar, Alok Ranjan, Pankaj Srivastava

Published Jun 1, 2010• 3 citations

Abstract

Optimization is one of the most primary jobs of all the engineering problems. We are fortunate to have blessed with scores of methods available for optimization purpose. Evolutionary algorithm is fast becoming one of the most sought after methods for this purpose. This method depends upon random moves. So sometimes the time consumed by this algorithm is much more than expected. With an aim to get rid of this problem, in this paper we propose an entirely new approach of evolutionary algorithm based on quantum computing. A quantum evolutionary algorithm can be termed as a concept which utilizes certain tools of quantum computing for search and optimization purposes. A quantum algorithm relies heavily on qubits and quantum gates. Qubits are the entities which actually contain information in quantum computing. They can either remain in a secluded state or a superposition of two or more qubits states. When they are in a superposition state we employ the concepts of probability to predict where they can actually be found. On the other hand quantum gates utilize qubits to achieve some predefined goals. These predefined goals in case of an optimization problem are to maximize or minimize some sort of objective function. This paper proposes a novel evolutionary algorithm employing quantum computing to address optimization problems. We have tested our algorithm on a famous problem known as Gear Train Design Problem. The results so obtained outperform the classical optimization methods.

DOI: 10.1109/icetc.2010.5529653

Related papers

Real-Coded Quantum Inspired Evolution Algorithm Applied to Engineering Optimization Problems

Fawzan S. Alfares, I.I. Esat

A novel evolutionary algorithm based on quantum computing concepts is applied to engineering optimization problems. Quantum computing mimics behavior of atoms in processing information. Quantum inspired algorithm is a concept, which employs certain elements of quantum computing to use in a wider class of search and optimization problems. The main parts of a quantum-inspired algorithm are the qubits (quantum equivalent of bits) and the quantum gates. Qubits hold the information in a superposition of all the states, while the quantum gates evolve the qubit to achieve the desired objective, which is, in optimization the maximum or the minimum. The paper addresses the ability of the Quantum-Inspired Evolution Algorithm (QIEA) to solve practical engineering optimization problems. QIEA, which is developed by authors, is based on their previous work and it is extended to acquire the floating-point representation of the information. The RQIEA is tested on a four benchmark engineering optimization problems. The results showed that the new algorithm has the ability to compete and even overcome other well known methods.

Leveraging Applications of Formal Methods•Nov 1, 2006•15 citations

Genetic quantum algorithm and its application to combinatorial optimization problem

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

IEEE Congress on Evolutionary Computation (CEC)•Nov 7, 2002•672 citations

Quantum evolutionary computational technique for constrained engineering optimization

V. Astuti, K. Hans Raj

A Quantum Evolutionary Computational Technique (QECT) is proposed in this paper. The approach is based on the integration of quantum computing concepts such as superposition of states, application of quantum gate with the concept of genetic algorithm and simulated annealing. To demonstrate effectiveness and applicability of QECT, simulations are carried out on five Benchmark Test functions, which are well-known combinatorial optimization problems. These exemplify that the proposed algorithm has a capability to obtain near global optimum, without premature convergence unlike other variants. QECT has the strong capability to explore the nonlinear search regions and it is a step forward in the area of hybrid stochastic search. It is applied on a problem of mechanical engineering design of a pressure vessel. The application of proposed heuristic technique in mechanical engineering design is a step towards agility in design and manufacturing.

International Conference on Next Generation Computing Technologies•Oct 1, 2016•1 citation

Improving Quantum Genetic Algorithms through Recursive Search Space Exploration

Giovanni Acampora, Autilia Vitiello

Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.

IEEE Congress on Evolutionary Computation (CEC)•Jun 30, 2024•0 citations

An Adaptive Quantum Evolutionary Algorithm for Engineering Optimization Problems

Ashish Mani, C. Patvardhan

Real world problems in engineering domain are typically constraint optimization problems.An Adaptive Quantum Evolutionary Algorithm for solving such problems is proposed in this paper.The proposed technique uses a novel qubits representation for search and optimization and uses feasibility rules for handling constraints.Moreover, it does not need stochastic ranking or niching or other methods for maintaining diversity.It does not even require mutation and local heuristics.The algorithm is tested on a standard set of four widely studied benchmark engineering design optimization problems.The results obtained are better than the existing state of the art approaches.The proposed algorithm is simple in concept and implementation, while being robust.

International Journal of Computer Applications•Feb 25, 2010•11 citations

Advanced Quantum Inspired Evolutionary Optimization Algorithm

Sai Siddhartha Vivek Dhir Rangoju, Om Prakash Patel, Neha Bharill

In this paper, an advanced quantum-inspired evolutionary optimization algorithm (A-QEOA) is proposed. This algorithm is based on the principle of quantum computing such as quantum bit representation and superposition of states. Like other evolutionary algorithms, the quantum-inspired evolutionary algorithm has characteristics of exploration and exploitation. The quantum-inspired evolutionary algorithm achieves exploration using observation process and exploitation using quantum rotation gate. Exploration helps to find the search space for a parameter that needs to be optimized. However, the observation process needs a random number which may sometimes increase the number of iterations to converge the algorithm or may lead to premature convergence. In this paper, we propose an algorithm with an updated observation process that helps to converge the algorithm optimally and helps to get results faster in comparison to the existing quantum inspired evolutionary algorithm (QEA).

International Conference on Emerging Techniques in Computational Intelligence (ICETCI)•Aug 25, 2022•2 citations

Optimization is one of the most primary jobs of all the engineering problems. We are fortunate to have blessed with scores of methods available for optimization purpose. Evolutionary algorithm is fast becoming one of the most sought after methods for this purpose. This method depends upon random moves. So sometimes the time consumed by this algorithm is much more than expected. With an aim to get rid of this problem, in this paper we propose an entirely new approach of evolutionary algorithm based on quantum computing. A quantum evolutionary algorithm can be termed as a concept which utilizes certain tools of quantum computing for search and optimization purposes. A quantum algorithm relies heavily on qubits and quantum gates. Qubits are the entities which actually contain information in quantum computing. They can either remain in a secluded state or a superposition of two or more qubits states. When they are in a superposition state we employ the concepts of probability to predict where they can actually be found. On the other hand quantum gates utilize qubits to achieve some predefined goals. These predefined goals in case of an optimization problem are to maximize or minimize some sort of objective function. This paper proposes a novel evolutionary algorithm employing quantum computing to address optimization problems. We have tested our algorithm on a famous problem known as Gear Train Design Problem. The results so obtained outperform the classical optimization methods.

A novel evolutionary algorithm based on quantum computing concepts is applied to engineering optimization problems. Quantum computing mimics behavior of atoms in processing information. Quantum inspired algorithm is a concept, which employs certain elements of quantum computing to use in a wider class of search and optimization problems. The main parts of a quantum-inspired algorithm are the qubits (quantum equivalent of bits) and the quantum gates. Qubits hold the information in a superposition of all the states, while the quantum gates evolve the qubit to achieve the desired objective, which is, in optimization the maximum or the minimum. The paper addresses the ability of the Quantum-Inspired Evolution Algorithm (QIEA) to solve practical engineering optimization problems. QIEA, which is developed by authors, is based on their previous work and it is extended to acquire the floating-point representation of the information. The RQIEA is tested on a four benchmark engineering optimization problems. The results showed that the new algorithm has the ability to compete and even overcome other well known methods.

This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

A Quantum Evolutionary Computational Technique (QECT) is proposed in this paper. The approach is based on the integration of quantum computing concepts such as superposition of states, application of quantum gate with the concept of genetic algorithm and simulated annealing. To demonstrate effectiveness and applicability of QECT, simulations are carried out on five Benchmark Test functions, which are well-known combinatorial optimization problems. These exemplify that the proposed algorithm has a capability to obtain near global optimum, without premature convergence unlike other variants. QECT has the strong capability to explore the nonlinear search regions and it is a step forward in the area of hybrid stochastic search. It is applied on a problem of mechanical engineering design of a pressure vessel. The application of proposed heuristic technique in mechanical engineering design is a step towards agility in design and manufacturing.

Recently, quantum computing has emerged as a new paradigm that promises to improve artificial intelligence techniques. One of the research fields that is certainly benefiting from this new computational paradigm is evolutionary optimization. In literature, efforts have been already made to run evolutionary algorithms on quantum computers using quantum effects such as superposition and entanglement to converge towards sub-optimal solutions of hard problems. However, the performance of these quantum evolutionary approaches is limited by the number of qubits available on current quantum devices. This limitation is more noticeable in the case of continuous optimization problems, where the search space is potentially infinite. This paper presents a recursive algorithmic structure that embodies a quantum evolutionary algorithm to overcome the limitations mentioned above. The result is an innovative and efficient approach in the context of quantum evolutionary optimization.

Real world problems in engineering domain are typically constraint optimization problems.An Adaptive Quantum Evolutionary Algorithm for solving such problems is proposed in this paper.The proposed technique uses a novel qubits representation for search and optimization and uses feasibility rules for handling constraints.Moreover, it does not need stochastic ranking or niching or other methods for maintaining diversity.It does not even require mutation and local heuristics.The algorithm is tested on a standard set of four widely studied benchmark engineering design optimization problems.The results obtained are better than the existing state of the art approaches.The proposed algorithm is simple in concept and implementation, while being robust.

In this paper, an advanced quantum-inspired evolutionary optimization algorithm (A-QEOA) is proposed. This algorithm is based on the principle of quantum computing such as quantum bit representation and superposition of states. Like other evolutionary algorithms, the quantum-inspired evolutionary algorithm has characteristics of exploration and exploitation. The quantum-inspired evolutionary algorithm achieves exploration using observation process and exploitation using quantum rotation gate. Exploration helps to find the search space for a parameter that needs to be optimized. However, the observation process needs a random number which may sometimes increase the number of iterations to converge the algorithm or may lead to premature convergence. In this paper, we propose an algorithm with an updated observation process that helps to converge the algorithm optimally and helps to get results faster in comparison to the existing quantum inspired evolutionary algorithm (QEA).