Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CEC
2003
IEEE

favoriteEmaildiscussreport

116views Artificial Intelligence» more CEC 2003»

Exploring the search space of quantum programs

13 years 9 months ago

Exploring the search space of quantum programs

Download www.cs.bham.ac.uk

Here we present a ﬁrst study of search spaces and ﬁtness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa problem as a starting point for the exploration of search spaces of quantum algorithms and analyze the structure of mutation landscapes using autocorrelation functions and information measures for characterizing their behavior. The relationship between landscape characteristics and quantum algorithm evolution is useful for improving the efﬁciency of the search process.

André Leier, Wolfgang Banzhaf

Real-time Traffic

Artificial Intelligence | CEC 2003 | Quantum Algorithm | Quantum Algorithm Evolution | Search Spaces |

claim paper

Related Content

» Automated Planning Using Quantum Computation

» A new quantum behaved particle swarm optimization

» When Do Bounds and Domain Propagation Lead to the Same Search Space

» Exhaustive Optimization Phase Order Space Exploration

» Search Strategies for Hybrid Search Spaces

» Microarchitectural Design Space Exploration Using an ArchitectureCentric Approach

» SyntaxDriven Reachable State Space Construction of Synchronous Reactive Programs

» Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming

» Representation and structural biases in CGP

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	CEC
Authors	André Leier, Wolfgang Banzhaf

Comments (0)