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 Computational and Theoretical Nanoscience

Searching for Quantum Programs and Quantum Protocols

Susan Stepney, John A. Clark

Published May 1, 2008• 12 citations
Publisher

Abstract

We review how computational search techniques inspired by biological evolution have been used to discover quantum circuits and quantum algorithms. We discuss issues in representing quantum artefacts in a form suitable for evolutionary search, various quantum artefacts that have been discovered through evolutionary search, and future prospects for this approach.

DOI
10.1166/jctn.2008.2535

Related papers

Toward a Framework for Quantum Evolutionary Computation

Donald Sofge

Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers

IEEE Conference on Cybernetics and Intelligent Systems•Jun 1, 2006•8 citations

Prospective Algorithms for Quantum Evolutionary Computation

Donald Sofge

This effort examines the intersection of the emerging field of quantum computing and the more established field of evolutionary computation. The goal is to understand what benefits quantum computing might offer to computational intelligence and how computational intelligence paradigms might be implemented as quantum programs to be run on a future quantum computer. We critically examine proposed algorithms and methods for implementing computational intelligence paradigms, primarily focused on heuristic optimization methods including and related to evolutionary computation, with particular regard for their potential for eventual implementation on quantum computing hardware.

arXiv:0804.1133•Apr 7, 2008•26 citations

On the Evolutionary Design of Quantum Circuits

Timothy Reid

The goal of this work is to understand the application of the evolutionary programming approach to the problem of quantum circuit design. This problem is motivated by the following observations: In order to keep up with the seemingly insatiable demand for computing power our computing devices will continue to shrink, all the way down to the atomic scale, at which point they become quantum mechanical systems. In fact, this event, known as Moore?s Horizon, is likely to occur in less than 25 years. The recent discovery of several quantum algorithms which can solve some interesting problems more efficiently than any known classical algorithm. While we are not yet certain that quantum computers will ever be practical to build, there do now exist the first few astonishing experimental devices capable of briefly manipulating small quantities of quantum information. The programming of these devices is already a nontrivial problem, and as these devices and their algorithms become more complicated this problem will quickly become a significant challenge. The Evolutionary Programming (EP) approach to problem solving seeks to mimic the processes of evolutionary biology which have resulted in the awesome complexity of living systems, almost all of which are well beyond our current analysis and engineering capabilities. This approach is motivated by the highly successful application of Koza?s Genetic Programming (GP) approach to a variety of circuit design problems, and specifically the preliminary reports byWilliams and Gray and also Rubinstein who applied GP to quantum circuit design. Accompanying this work is software for evolutionary quantum circuit design which incorporates several advances over previous approaches, including: A formal language for describing parallel quantum circuits out of an arbitary elementary gate set, including gates with one or more parameters. A fitness assessment procedure that measures both average case fidelity with a respect for global phase equivalences, and implementation cost. A Memetic Programming (MP) based reproductive strategy that uses a combination of global genetic and local memetic searches to effectively search through diverse circuit topologies and optimize the parameterized gates they contain. Several benchmark experiments are performed on small problems which support the conclusion that Evolutionary Programming is a viable approach to quantum circuit design and that further experiments utilizing more computational resources and more problem insight can be expected to yield many new and interesting quantum circuits.

•Jan 1, 2005•11 citations

A Fundamental Concept & Systematic Reviews, Understanding of The Quantum Search Algorithms

Ashish Bhatt, Sumit Chaudhary, Rashmi Kuksal +3 more

A groundbreaking advancement in computing theory, quantum search algorithms leverage quantum mechanics to outperform their classical counterparts in solving search issues. With a focus on their theoretical underpinnings, practical applications, and performance in a variety of computational contexts, this systematic review carefully investigates the evolution, progress, and current state of quantum search algorithms. We present a thorough analysis of significant algorithms, such as Grover’s search algorithm, together with recent developments in quantum optimization and quantum-enhanced search techniques. We also go over the challenges with quantum error correction, scalability, and hardware constraints that prevent the broad application of quantum search techniques.

International Conference on Intelligent Systems for Cybersecurity (ISCS)•Nov 14, 2025•0 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

Evolutionary and Quantum Computing for Community Detection: A Survey

Clara Pizzuti

Rising quantum technologies undertake to provide new strategies for solving hard combinatorial problems. Community detection is a fundamental issue in network studies with applications in various complex systems. A review of methods proposed in the last years in the context of quantum optimization and quantum-inspired metaheuristics to detect communities in networks is presented. Quantum optimization is introduced by recalling the main available computation models and the most popular hybridization approaches. The advantages and limitations of methods based on quantum computing and evolutionary computing are discussed.

International Conference on Information, Intelligence, Systems & Applications (IISA)•Jul 17, 2024•2 citations
We review how computational search techniques inspired by biological evolution have been used to discover quantum circuits and quantum algorithms. We discuss issues in representing quantum artefacts in a form suitable for evolutionary search, various quantum artefacts that have been discovered through evolutionary search, and future prospects for this approach.
Biological evolution provides an immensely powerful toolset for problem solving, while evolutionary computation attempts to harness the power of biological evolution for solving problems using classical computing paradigms. Quantum computing offers many apparent advantages over classical computing for certain types of problems, such as searching or optimizing over large solution sets. Once practical quantum computers are available, we would like to take advantage of their highly parallel computing capabilities for use in evolutionary computation. In this work we explore the nexus between quantum and evolutionary computation, and propose an approach toward a practical framework for performing evolutionary computation on quantum computers
This effort examines the intersection of the emerging field of quantum computing and the more established field of evolutionary computation. The goal is to understand what benefits quantum computing might offer to computational intelligence and how computational intelligence paradigms might be implemented as quantum programs to be run on a future quantum computer. We critically examine proposed algorithms and methods for implementing computational intelligence paradigms, primarily focused on heuristic optimization methods including and related to evolutionary computation, with particular regard for their potential for eventual implementation on quantum computing hardware.
The goal of this work is to understand the application of the evolutionary programming approach to the problem of quantum circuit design. This problem is motivated by the following observations: In order to keep up with the seemingly insatiable demand for computing power our computing devices will continue to shrink, all the way down to the atomic scale, at which point they become quantum mechanical systems. In fact, this event, known as Moore?s Horizon, is likely to occur in less than 25 years. The recent discovery of several quantum algorithms which can solve some interesting problems more efficiently than any known classical algorithm. While we are not yet certain that quantum computers will ever be practical to build, there do now exist the first few astonishing experimental devices capable of briefly manipulating small quantities of quantum information. The programming of these devices is already a nontrivial problem, and as these devices and their algorithms become more complicated this problem will quickly become a significant challenge. The Evolutionary Programming (EP) approach to problem solving seeks to mimic the processes of evolutionary biology which have resulted in the awesome complexity of living systems, almost all of which are well beyond our current analysis and engineering capabilities. This approach is motivated by the highly successful application of Koza?s Genetic Programming (GP) approach to a variety of circuit design problems, and specifically the preliminary reports byWilliams and Gray and also Rubinstein who applied GP to quantum circuit design. Accompanying this work is software for evolutionary quantum circuit design which incorporates several advances over previous approaches, including: A formal language for describing parallel quantum circuits out of an arbitary elementary gate set, including gates with one or more parameters. A fitness assessment procedure that measures both average case fidelity with a respect for global phase equivalences, and implementation cost. A Memetic Programming (MP) based reproductive strategy that uses a combination of global genetic and local memetic searches to effectively search through diverse circuit topologies and optimize the parameterized gates they contain. Several benchmark experiments are performed on small problems which support the conclusion that Evolutionary Programming is a viable approach to quantum circuit design and that further experiments utilizing more computational resources and more problem insight can be expected to yield many new and interesting quantum circuits.
A groundbreaking advancement in computing theory, quantum search algorithms leverage quantum mechanics to outperform their classical counterparts in solving search issues. With a focus on their theoretical underpinnings, practical applications, and performance in a variety of computational contexts, this systematic review carefully investigates the evolution, progress, and current state of quantum search algorithms. We present a thorough analysis of significant algorithms, such as Grover’s search algorithm, together with recent developments in quantum optimization and quantum-enhanced search techniques. We also go over the challenges with quantum error correction, scalability, and hardware constraints that prevent the broad application of quantum search techniques.
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.
Rising quantum technologies undertake to provide new strategies for solving hard combinatorial problems. Community detection is a fundamental issue in network studies with applications in various complex systems. A review of methods proposed in the last years in the context of quantum optimization and quantum-inspired metaheuristics to detect communities in networks is presented. Quantum optimization is introduced by recalling the main available computation models and the most popular hybridization approaches. The advantages and limitations of methods based on quantum computing and evolutionary computing are discussed.