Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Explorations in quantum computing
Explorations in quantum computing
Quantum computing
Transformation rules for designing CNOT-based quantum circuits
Proceedings of the 39th annual Design Automation Conference
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Quantum computation and quantum information
Quantum computation and quantum information
Feynman Lectures on Computation
Feynman Lectures on Computation
Journal of Systems Architecture: the EUROMICRO Journal
Evolving Quantum Circuits Using Genetic Algorithm
EH '02 Proceedings of the 2002 NASA/DoD Conference on Evolvable Hardware (EH'02)
Multi-Output Galois Field Sum of Products Synthesis with New Quantum Cascades
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Regular Realization of Symmetric Functions Using Reversible Logic
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
Novel methods for reversible logic synthesis and their application to quantum computing
Novel methods for reversible logic synthesis and their application to quantum computing
A quantum genetic algorithm with quantum crossover and mutation operations
Quantum Information Processing
| Hi-index | 0.00 |
The paper discusses the evolutionary computation approach to the problem of optimal synthesis of Quantum and Reversible Logic circuits. Our approach uses standard Genetic Algorithm (GA) and its relative power as compared to previous approaches comes from the encoding and the formulation of the cost and fitness functions for quantum circuits synthesis. We analyze new operators and their role in synthesis and optimization processes. Cost and fitness functions for Reversible Circuit synthesis are introduced as well as local optimizing transformations. It is also shown that our approach can be used alternatively for synthesis of either reversible or quantum circuits without a major change in the algorithm. Results are illustrated on synthesized Margolus, Toffoli, Fredkin and other gates and Entanglement Circuits. This is for the first time that several variants of these gates have been automatically synthesized from quantum primitives.