Evolving Hogg’s Quantum Algorithm Using Linear-Tree GP
Authors:
- 18 June 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 390-400
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding a better-than-classical quantum AND/OR algorithm using genetic programming2003
- Experimental implementation of Hogg’s algorithm on a three-quantum-bit NMR quantum computerPhysical Review A, 2002
- Linear-Tree GP and Its Comparison with Other GP StructuresLecture Notes in Computer Science, 2001
- Quantum Computing2001
- Quantum circuits for OR and AND of ORsJournal of Physics A: General Physics, 2000
- Solving Highly Constrained Search Problems with Quantum ComputersJournal of Artificial Intelligence Research, 1999
- Advances in Genetic Programming1999
- Highly Structured Searches with Quantum ComputersPhysical Review Letters, 1998
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985