loading...
Evolution of Quantum Algorithms for Computer of Reversible Operators
Alexandria, Virginia July 15-July 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EH.2002.10298842002 NASA/DoD Conference on Evolvable ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alvin J. Surkan, University of Nebraska at Lincoln
Amiran Khuskivadze, University of Nebraska at Lincoln
A application of an evolutionary approach to hardware design is presented. A genetic algorithm was developed to discover good designs for quantum computer algorithms. The algorithms are expressed as quantum operator sequences applied in a circuit model. The circuits discovered are configurations of special purpose quantum computers. By simulation, establishes they will compute correctly, a small collection of basic and relatively low-level functions. The feasibility of using genetic algorithms for inventing alternative configurations of evolvable hardware established. Experiments produced designs for primitive quantum computers that evaluate logical or arithmetic functions with a total of twelve or fewer inputs and outputs.
Index Terms:
Program synthesis, genetic programming, evolutionary design and discovery of evolvable hardware, circuit models, qubits, CCNOT Toffoli quantum gates, quantum computation
Citation:
Alvin J. Surkan, Amiran Khuskivadze, "Evolution of Quantum Algorithms for Computer of Reversible Operators," eh, pp.186, 2002 NASA/DoD Conference on Evolvable Hardware (EH'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.