A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computing applications of genetic programming
Advances in genetic programming
Quantum computing
Quantum computation and quantum information
Quantum computation and quantum information
Linear-Tree GP and Its Comparison with Other GP Structures
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Evolution of Quantum Algorithms for Computer of Reversible Operators
EH '02 Proceedings of the 2002 NASA/DoD Conference on Evolvable Hardware (EH'02)
Solving highly constrained search problems with quantum computers
Journal of Artificial Intelligence Research
Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming
Evolutionary Computation
Implementing quantum genetic algorithms: a solution based on Grover's algorithm
Proceedings of the 3rd conference on Computing frontiers
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
A review of procedures to evolve quantum algorithms
Genetic Programming and Evolvable Machines
A quantum genetic algorithm with quantum crossover and mutation operations
Quantum Information Processing
| Hi-index | 0.00 |
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a Genetic Programming system based on linear-tree genome structures developed for the purpose of automatic quantum circuit design is introduced. It was applied to instances of the 1-SAT problem, resulting in evidently and "visibly" scalable quantum algorithms, which correspond to Hogg's quantum algorithm.