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

arXiv:2106.03115

Synthesis of Quantum Circuits with an Island Genetic Algorithm

Miranda, Fernando T., Balbi, Pedro Paulo, Pedro C. S. Costa

Published Jun 6, 2021• 11 citations
arXivHTMLPDF

Abstract

While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit, even if as an approximation of the input unitary, is a non-trivial task and can be modeled as a search problem. This work presents an evolutionary search algorithm based on the island model concept, for the decomposition of unitary matrices in their equivalent circuit. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.

DOI
10.48550/arxiv.2106.03115

Related papers

Decomposition of unitary matrices for finding quantum circuits: Application to molecular Hamiltonians

Ammar Daskin, Sabre Kais

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. We test the method on the known decompositions of Toffoli gate, the amplification step of the Grover search algorithm, the quantum Fourier transform, and the sender part of the quantum teleportation. Using this procedure, we present the circuit designs for the simulation of the unitary propagators of the Hamiltonians for the hydrogen and the water molecules. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.

arXiv:1009.5625•The Journal of Chemical Physics•Apr 14, 2011•61 citations

Application Of Genetic Algorithms For Evolution Of Quantum Equivalents Of Boolean Circuits

Swanti Satsangi, Ashish Gulati, Prem Kumar Kalra +1 more

Due to the non- intuitive nature of Quantum algorithms, it becomes difficult for a classically trained person to efficiently construct new ones. So rather than designing new algorithms manually, lately, Genetic algorithms (GA) are being implemented for this purpose. GA is a technique to automatically solve a problem using principles of Darwinian evolution. This has been implemented to explore the possibility of evolving an n-qubit circuit when the circuit matrix has been provided using a set of single, two and three qubit gates. Using a variable length population and universal stochastic selection procedure, a number of possible solution circuits, with different number of gates can be obtained for the same input matrix during different runs of GA. The given algorithm has also been successfully implemented to obtain two and three qubit Boolean circuits using Quantum gates. The results demonstrate the effectiveness of the GA procedure even when the search spaces are large.

•Mar 23, 2012•7 citations

Evolutionary discovery of algorithms as circuits for quantum computers

Alvin J. Surkan, A.A. Khuskivadze

This paper demonstrates an application of an evolutionary approach for solving a class of non-trivial, hardware-design problems. Array processing features of the computer language APL simplify the implementation of an evolutionary solution in which simulation is performed by a genetic algorithm on a population of candidate solutions until one or more are satisfactory quantum algorithms. The objective of the simulation model is the automatic discovery of quantum computer algorithms. The algorithms are expressed in a circuit model that specifies the sequences in which quantum operators are to be applied. The automatically configured circuits operate as quantum computers that for the present have their domains of application limited to evaluation of only a few specific functions. The simulations use a small collection of basic and relatively low-level operators to obtain perfect results for five different target functions. These functions were chosen to demonstrate how, on a personal computer, an evolutionary method is able to discover novel designs of computing hardware. The results establish that it is feasible to use genetic algorithms in an evolutionary method to invent correct hardware designs. The progress of simulated evolution is directed by input/output constraints and a fitness function. Alternative configurations of circuit models can obtain algorithms with promise for future quantum computers. Current simulations yield primitive quantum algorithms with a total of twelve or fewer inputs and outputs. The discovered algorithms produce the correct results for evaluating the five selected logical and arithmetic functions.

ACM SIGAPL APL Quote Quad•Jun 1, 2002•1 citation

Evolutionary discovery of algorithms as circuits for quantum computers

Alvin J. Surkan, A.A. Khuskivadze

This paper demonstrates an application of an evolutionary approach for solving a class of non-trivial, hardware-design problems. Array processing features of the computer language APL simplify the implementation of an evolutionary solution in which simulation is performed by a genetic algorithm on a population of candidate solutions until one or more are satisfactory quantum algorithms. The objective of the simulation model is the automatic discovery of quantum computer algorithms. The algorithms are expressed in a circuit model that specifies the sequences in which quantum operators are to be applied. The automatically configured circuits operate as quantum computers that for the present have their domains of application limited to evaluation of only a few specific functions. The simulations use a small collection of basic and relatively low-level operators to obtain perfect results for five different target functions. These functions were chosen to demonstrate how, on a personal computer, an evolutionary method is able to discover novel designs of computing hardware. The results establish that it is feasible to use genetic algorithms in an evolutionary method to invent correct hardware designs. The progress of simulated evolution is directed by input/output constraints and a fitness function. Alternative configurations of circuit models can obtain algorithms with promise for future quantum computers. Current simulations yield primitive quantum algorithms with a total of twelve or fewer inputs and outputs. The discovered algorithms produce the correct results for evaluating the five selected logical and arithmetic functions.

International Conference on APL (APL)•Jun 1, 2002•3 citations

Quantum Circuit Synthesis Using Fuzzy-Logic-Assisted Genetic Algorithms

Ishraq Islam, Vinayak Jha, Sneha Thomas +11 more

Quantum algorithms will likely play a key role in future high-performance-computing (HPC) environments. These algorithms are typically expressed as quantum circuits composed of arbitrary gates or as unitary matrices. Executing these on physical devices, however, requires translation to device-compatible circuits, in a process called quantum compilation or circuit synthesis, since these devices support a limited number of native gates. Moreover, these devices typically have specific qubit topologies, which constrain how and where gates can be applied. Consequently, logical qubits in input circuits and unitaries may need to be mapped to and routed between physical qubits. Furthermore, current Noisy Intermediate-Scale Quantum (NISQ) devices present additional constraints. They are vulnerable to errors during gate application and their short decoherence times lead to qubits rapidly succumbing to accumulated noise and possibly corrupting computations. Therefore, circuits synthesized for NISQ devices need to minimize gates and execution times. The problem of synthesizing device-compatible circuits, while optimizing for low gate count and short execution times, can be shown to be computationally intractable using analytical methods. Therefore, interest has grown towards heuristics-based synthesis techniques, which are able to produce approximations of the desired algorithm, while optimizing depth and gate-count. In this work, we investigate using genetic algorithms (GA)—a proven gradient-free optimization technique based on natural selection—for circuit synthesis. In particular, we formulate the quantum synthesis problem as a multi-objective optimization (MOO) problem, with the objectives of minimizing the approximation error, number of multi-qubit gates, and circuit depth. We also employ fuzzy logic for runtime parameter adaptation of GA to enhance search efficiency and solution quality in our proposed method.

Algorithms•Mar 21, 2025•9 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
While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit, even if as an approximation of the input unitary, is a non-trivial task and can be modeled as a search problem. This work presents an evolutionary search algorithm based on the island model concept, for the decomposition of unitary matrices in their equivalent circuit. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuits on classical computers. Here, we use the group leaders optimization algorithm to decompose a given unitary matrix into a proper-minimum cost quantum gate sequence. We test the method on the known decompositions of Toffoli gate, the amplification step of the Grover search algorithm, the quantum Fourier transform, and the sender part of the quantum teleportation. Using this procedure, we present the circuit designs for the simulation of the unitary propagators of the Hamiltonians for the hydrogen and the water molecules. The approach is general and can be applied to generate the sequence of quantum gates for larger molecular systems.
Due to the non- intuitive nature of Quantum algorithms, it becomes difficult for a classically trained person to efficiently construct new ones. So rather than designing new algorithms manually, lately, Genetic algorithms (GA) are being implemented for this purpose. GA is a technique to automatically solve a problem using principles of Darwinian evolution. This has been implemented to explore the possibility of evolving an n-qubit circuit when the circuit matrix has been provided using a set of single, two and three qubit gates. Using a variable length population and universal stochastic selection procedure, a number of possible solution circuits, with different number of gates can be obtained for the same input matrix during different runs of GA. The given algorithm has also been successfully implemented to obtain two and three qubit Boolean circuits using Quantum gates. The results demonstrate the effectiveness of the GA procedure even when the search spaces are large.
This paper demonstrates an application of an evolutionary approach for solving a class of non-trivial, hardware-design problems. Array processing features of the computer language APL simplify the implementation of an evolutionary solution in which simulation is performed by a genetic algorithm on a population of candidate solutions until one or more are satisfactory quantum algorithms. The objective of the simulation model is the automatic discovery of quantum computer algorithms. The algorithms are expressed in a circuit model that specifies the sequences in which quantum operators are to be applied. The automatically configured circuits operate as quantum computers that for the present have their domains of application limited to evaluation of only a few specific functions. The simulations use a small collection of basic and relatively low-level operators to obtain perfect results for five different target functions. These functions were chosen to demonstrate how, on a personal computer, an evolutionary method is able to discover novel designs of computing hardware. The results establish that it is feasible to use genetic algorithms in an evolutionary method to invent correct hardware designs. The progress of simulated evolution is directed by input/output constraints and a fitness function. Alternative configurations of circuit models can obtain algorithms with promise for future quantum computers. Current simulations yield primitive quantum algorithms with a total of twelve or fewer inputs and outputs. The discovered algorithms produce the correct results for evaluating the five selected logical and arithmetic functions.
This paper demonstrates an application of an evolutionary approach for solving a class of non-trivial, hardware-design problems. Array processing features of the computer language APL simplify the implementation of an evolutionary solution in which simulation is performed by a genetic algorithm on a population of candidate solutions until one or more are satisfactory quantum algorithms. The objective of the simulation model is the automatic discovery of quantum computer algorithms. The algorithms are expressed in a circuit model that specifies the sequences in which quantum operators are to be applied. The automatically configured circuits operate as quantum computers that for the present have their domains of application limited to evaluation of only a few specific functions. The simulations use a small collection of basic and relatively low-level operators to obtain perfect results for five different target functions. These functions were chosen to demonstrate how, on a personal computer, an evolutionary method is able to discover novel designs of computing hardware. The results establish that it is feasible to use genetic algorithms in an evolutionary method to invent correct hardware designs. The progress of simulated evolution is directed by input/output constraints and a fitness function. Alternative configurations of circuit models can obtain algorithms with promise for future quantum computers. Current simulations yield primitive quantum algorithms with a total of twelve or fewer inputs and outputs. The discovered algorithms produce the correct results for evaluating the five selected logical and arithmetic functions.
Quantum algorithms will likely play a key role in future high-performance-computing (HPC) environments. These algorithms are typically expressed as quantum circuits composed of arbitrary gates or as unitary matrices. Executing these on physical devices, however, requires translation to device-compatible circuits, in a process called quantum compilation or circuit synthesis, since these devices support a limited number of native gates. Moreover, these devices typically have specific qubit topologies, which constrain how and where gates can be applied. Consequently, logical qubits in input circuits and unitaries may need to be mapped to and routed between physical qubits. Furthermore, current Noisy Intermediate-Scale Quantum (NISQ) devices present additional constraints. They are vulnerable to errors during gate application and their short decoherence times lead to qubits rapidly succumbing to accumulated noise and possibly corrupting computations. Therefore, circuits synthesized for NISQ devices need to minimize gates and execution times. The problem of synthesizing device-compatible circuits, while optimizing for low gate count and short execution times, can be shown to be computationally intractable using analytical methods. Therefore, interest has grown towards heuristics-based synthesis techniques, which are able to produce approximations of the desired algorithm, while optimizing depth and gate-count. In this work, we investigate using genetic algorithms (GA)—a proven gradient-free optimization technique based on natural selection—for circuit synthesis. In particular, we formulate the quantum synthesis problem as a multi-objective optimization (MOO) problem, with the objectives of minimizing the approximation error, number of multi-qubit gates, and circuit depth. We also employ fuzzy logic for runtime parameter adaptation of GA to enhance search efficiency and solution quality in our proposed method.
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.