Evolutionary algorithms for quantum computers

DOI10.1007/S00453-013-9784-1MaRDI QIDQ2441596zbMATH OpenOpenAlexFDO

Authors Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Publication date 25 March 2014

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/325350/files/453_2013_Article_9784.pdf

zbMATH Keywords

evolutionary computationquantum algorithmruntime analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The quantum evolutionary algorithm
• scientific article; zbMATH DE number 1962898
• Reviews of current studying progress on quantum evolutionary computation
• Advances in quantum-inspired evolutionary algorithms
• Implementing pure adaptive search with Grover's quantum algorithm

Cites work

• A study of drift analysis for estimating computation time of evolutionary algorithms
• Exponential lower bound for 2-query locally decodable codes via a quantum argument
• How to analyse evolutionary algorithms.
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Lower Bounds for Local Search by Quantum Arguments
• New upper and lower bounds for randomized and quantum local search
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the hitting times of quantum versus random walks
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Quantum Query Complexity of Some Graph Problems
• Quantum Random Walks – New Method for Designing Quantum Algorithms
• Quantum Walk Based Search Algorithms
• Search via Quantum Walk
• SOFSEM 2004: Theory and Practice of Computer Science
• Strengths and Weaknesses of Quantum Computing

Cited in

(4)

• An adaptive niche quantum evolutionary algorithm for multimodal functions
• scientific article; zbMATH DE number 5811427 (Why is no real title available?)
• scientific article; zbMATH DE number 1962898 (Why is no real title available?)
• Quantum-inspired evolutionary algorithms: a survey and empirical study

This page was built for publication: Evolutionary algorithms for quantum computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441596)