scientific article; zbMATH DE number 2013817

MaRDI QIDQ4437109zbMATH OpenFDO

Authors Tomoyuki Yamakami

Publication date 7 December 2003

Full work available at URL https://arxiv.org/abs/quant-ph/0204010, http://link.springer.de/link/service/series/0558/bibs/2509/25090300.htm

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Quantum computation (81P68) Combinatorial optimization (90C27)

Recommendations

• Quantum optimization
• Strengths and Weaknesses of Quantum Computing
• Quantum stochastic optimization
• Solving NP-Complete Problems with Quantum Search
• The complexity of optimization problems

Cited in

(4)

• Opposition-based quantum firework algorithm for continuous optimisation problems
• Trajectory optimization using quantum computing
• Combinatorial optimization through variational quantum power method
• A practitioner’s guide to quantum algorithms for optimisation problems

This page was built for publication:

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