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

Algorithmica

Evolutionary Algorithms for Quantum Computers

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Published Apr 19, 2013• 2 citations
Publisher
DOI
10.1007/s00453-013-9784-1

Related papers

Quantum Inspired Evolutionary Algorithms

Anthony Brabazon, Michael O’Neill, Seán McGarraghy

Natural computing series•Jan 1, 2015•0 citations

Probability evolutionary algorithm for functional and combinatorial optimization

Shuhan Shen, Yuncai Liu

A novel evolutionary algorithm called Probability Evolutionary Algorithm (PEA) is proposed, which is inspired by the Quantum computation and Quantum-inspired Evolutionary Algorithm (QEA). The individual in PEA is encoded by a probabilistic superposed bit which can represent a linear superposition of the states 0 to k (k ≥ 1). The observing step is used in PEA to obtain the observed individual, and the update method is used to evolve the population. The function optimization and 0-k knapsack problem experiments show that PEA has apparent superior in application area, searching capability and computation time compared with QEA and canonical genetic algorithm (CGA).

World Congress on Intelligent Control and Automation•Jan 1, 2008•5 citations

Hybrid quantum algorithm and its application in flow shop problem

Xie Jin-hua

Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Evolutionary Algorithms for the Design of Quantum Protocols

Walter O. Krawec, Stjepan Picek, Domagoj Jakobović

Lecture notes in computer science•Jan 1, 2019•11 citations

Experimental Study on Pair Swap Strategy in Quantum-Inspired Evolutionary Algorithm

Takahiro Imabeppu, Shigeru Nakayama, Satoshi Ono

Quantum-Inspired Evolutionary Algorithm (QEA), a type of stochastic algorithm for solving combinatorial optimization problems, is evolutionary computation using quantum bits and superposition states in quantum computation. Although coarse-grained parallel, QEA has many parameters that must be adjusted manually. The simpler algorithm, Quantum-inspired Evolutionary Computation with Pair Swap operator (QEAPS), the authors propose involves just one population and a simple genetic operation exchanging best solution information between two individuals chosen randomly, instead of the migration operation used in QEA, and thereby fewer parameters to be adjusted. The authors found in experiments that QEAPS finds highly qualified solutions, is more robust against constraint handling, and has a higher search performance of thanks to diversified best solution information.

Journal of Advanced Computational Intelligence and Intelligent Informatics•Mar 20, 2009•2 citations

Implementing evolutionary optimization on actual quantum processors

Giovanni Acampora, Autilia Vitiello

Information Sciences•Jun 18, 2021•54 citations
A novel evolutionary algorithm called Probability Evolutionary Algorithm (PEA) is proposed, which is inspired by the Quantum computation and Quantum-inspired Evolutionary Algorithm (QEA). The individual in PEA is encoded by a probabilistic superposed bit which can represent a linear superposition of the states 0 to k (k ≥ 1). The observing step is used in PEA to obtain the observed individual, and the update method is used to evolve the population. The function optimization and 0-k knapsack problem experiments show that PEA has apparent superior in application area, searching capability and computation time compared with QEA and canonical genetic algorithm (CGA).
Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.
Quantum-Inspired Evolutionary Algorithm (QEA), a type of stochastic algorithm for solving combinatorial optimization problems, is evolutionary computation using quantum bits and superposition states in quantum computation. Although coarse-grained parallel, QEA has many parameters that must be adjusted manually. The simpler algorithm, Quantum-inspired Evolutionary Computation with Pair Swap operator (QEAPS), the authors propose involves just one population and a simple genetic operation exchanging best solution information between two individuals chosen randomly, instead of the migration operation used in QEA, and thereby fewer parameters to be adjusted. The authors found in experiments that QEAPS finds highly qualified solutions, is more robust against constraint handling, and has a higher search performance of thanks to diversified best solution information.