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

Genetic and Evolutionary Computation Conference (GECCO)

Evolution of a human-competitive quantum fourier transform algorithm using genetic programming

Paul Massey, John A. Clark, Susan Stepney

Published Jun 25, 2005• 27 citations
Publisher

Abstract

In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.
DOI
10.1145/1068009.1068288

Related papers

Human-competitive evolution of quantum computing artefacts

Philip Massey, John A. Clark, Susan Stepney

We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP. \n

•Apr 1, 2006•0 citations

Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming

Paul Massey, John A. Clark, Susan Stepney

We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.

Evolutionary Computation•Feb 26, 2006•23 citations

Meta-genetic programming for static quantum circuits

Kenton M. Barnes, Michael B. Gale

Quantum programs are difficult for humans to develop due to their complex semantics that are rooted in quantum physics. It is therefore preferable to write specifications and then use techniques such as genetic programming (GP) to generate quantum programs instead. We present a new genetic programming system for quantum circuits which can evolve solutions to the full-adder and quantum Fourier transform problems in fewer generations than previous work, despite using a general set of gates. This means that it is no longer required to have any previous knowledge of the solution and choose a specialised gate set based on it.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 10, 2019•2 citations

Evolving quantum computer algorithms

Lee C. Spector

Computer science will be radically transformed if ongoing efforts to build large-scale quantum computers eventually succeed and if the properties of these computers meet optimistic expectations. Nevertheless, computer scientists still lack a thorough understanding of the power of quantum computing, and it is not always clear how best to utilize the power that is understood. This dilemma exists because quantum algorithms are difficult to grasp and even more difficult to write. Despite large-scale international efforts, only a few important quantum algorithms are documented, leaving many essential questions about the potential of quantum algorithms unanswered. These unsolved problems are ideal challenges for the application of automatic programming technologies. Genetic programming techniques, in particular, have already produced several new quantum algorithms and it is reasonable to expect further discoveries in the future. These methods will help researchers to discover how additional practical problems can be solved using quantum computers, and they will also help to guide theoretical work on both the power and limits of quantum computing. This tutorial will provide an introduction to quantum computing and an introduction to the use of evolutionary computation for automatic quantum computer programming. No background in physics or in evolutionary computation will be assumed. While the primary focus of the tutorial will be on general concepts, specific results will also be presented, including human-competitive results produced by genetic programming. Follow-up material is available from the presenter's book, Automatic Quantum Computer Programming: A Genetic Programming Approach, published by Springer and Kluwer Academic Publishers.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 8, 2009•0 citations

Evolving Quantum Algorithms with Genetic Programming

Duncan MacKinnon

In this thesis we present a genetic programming scheme for evolving quantum programs in the form of arbitrary unitary operators. Expanding on the work done by Hutsell and Greenwood, and later by Krawec in developing unitary operator evolution schemes, we present an alternative representation for unitary operators which has a better search topology than the representations used in these previous implementations. This alternative representation is tested on a general unitary evolution problem, and displays better convergence than previously implemented representations.

•Dec 20, 2017•3 citations

Application of Genetic Algorithm for Evolution of Quantum Fourier Transform Circuits

Swanti Satsangi, C. Patvardhan

Advances in intelligent systems and computing•Sep 4, 2015•1 citation
Quantum programs are difficult for humans to develop due to their complex semantics that are rooted in quantum physics. It is therefore preferable to write specifications and then use techniques such as genetic programming (GP) to generate quantum programs instead. We present a new genetic programming system for quantum circuits which can evolve solutions to the full-adder and quantum Fourier transform problems in fewer generations than previous work, despite using a general set of gates. This means that it is no longer required to have any previous knowledge of the solution and choose a specialised gate set based on it.
Computer science will be radically transformed if ongoing efforts to build large-scale quantum computers eventually succeed and if the properties of these computers meet optimistic expectations. Nevertheless, computer scientists still lack a thorough understanding of the power of quantum computing, and it is not always clear how best to utilize the power that is understood. This dilemma exists because quantum algorithms are difficult to grasp and even more difficult to write. Despite large-scale international efforts, only a few important quantum algorithms are documented, leaving many essential questions about the potential of quantum algorithms unanswered. These unsolved problems are ideal challenges for the application of automatic programming technologies. Genetic programming techniques, in particular, have already produced several new quantum algorithms and it is reasonable to expect further discoveries in the future. These methods will help researchers to discover how additional practical problems can be solved using quantum computers, and they will also help to guide theoretical work on both the power and limits of quantum computing. This tutorial will provide an introduction to quantum computing and an introduction to the use of evolutionary computation for automatic quantum computer programming. No background in physics or in evolutionary computation will be assumed. While the primary focus of the tutorial will be on general concepts, specific results will also be presented, including human-competitive results produced by genetic programming. Follow-up material is available from the presenter's book, Automatic Quantum Computer Programming: A Genetic Programming Approach, published by Springer and Kluwer Academic Publishers.
In this thesis we present a genetic programming scheme for evolving quantum programs in the form of arbitrary unitary operators. Expanding on the work done by Hutsell and Greenwood, and later by Krawec in developing unitary operator evolution schemes, we present an alternative representation for unitary operators which has a better search topology than the representations used in these previous implementations. This alternative representation is tested on a general unitary evolution problem, and displays better convergence than previously implemented representations.