Abstract
Spector et al. have shown [1],[2],[3] that genetic programming can be used to evolve quantum circuits. In this paper, we present new results in this field, introducing probabilistic and deterministic quantum circuits that have not been previously published. We compare our techniques with those of Spector et al, and point out some differences in perspective between our two approaches. Finally, we show how, by using sets of functions rather than precise quantum states as fitness cases, our basic technique can be extended to evolve true quantum algorithms.
Original language | English |
---|---|
Title of host publication | GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS |
Editors | K Deb, R Poli, W Banzhaf, HG Beyer, E Burke, P Darwen, D Dasgupta, D Floreano, O Foster, M Harman, O Holland, PL Lanzi, L Spector, A Tettamanzi, D Thierens, A Tyrrell |
Place of Publication | BERLIN |
Publisher | Springer |
Pages | 569-580 |
Number of pages | 12 |
ISBN (Print) | 3-540-22343-6 |
Publication status | Published - 2004 |
Event | 6th Annual Genetic and Evolutionary Computation Conference (GECCO 2004) - Seattle Duration: 26 Jun 2004 → 30 Jun 2004 |
Conference
Conference | 6th Annual Genetic and Evolutionary Computation Conference (GECCO 2004) |
---|---|
City | Seattle |
Period | 26/06/04 → 30/06/04 |
Keywords
- quantum computing
- genetic programming
- COMPUTER