Paper Info
Title
Evolving Hogg's quantum algorithm using linear-tree GP
Abstract
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.
Year
DOI
Venue
2003
10.1007/3-540-45105-6_48
GECCO
Keywords
Field
DocType
quantum circuit,linear-tree gp,natural linear-tree structure,linear-tree genome structure,1-sat problem,scalable quantum algorithm,conditional branching,intermediate measurement,evolving hogg,quantum algorithm,genetic programming system,automatic quantum circuit design,programming language,tree structure
Quantum Turing machine,Quantum phase estimation algorithm,One-way quantum computer,Computer science,Algorithm,Quantum computer,Theoretical computer science,Quantum sort,Quantum algorithm,Quantum information,Quantum network
Conference
Volume
ISSN
ISBN
2723
0302-9743
3-540-40602-6
Citations 
PageRank 
References 
10
0.70
7
Authors
2
Name
Order
Citations
PageRank
André Leier119719.87
Wolfgang Banzhaf22627367.13