The quantum adiabatic optimization algorithm and local minima

DOI10.1145/1007352.1007428zbMath1192.81098OpenAlexW2040469943MaRDI QIDQ3581005

Ben W. Reichardt

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007428

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (14)

Quantum machine learning: a classical perspective ⋮ QUBO formulations of the longest path problem ⋮ Partial adiabatic quantum search algorithm and its extensions ⋮ The performance of the quantum adiabatic algorithm on spike Hamiltonians ⋮ Quantum algorithm design: techniques and applications ⋮ Optimality of partial adiabatic search and its circuit model ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ An introduction to quantum annealing ⋮ The fundamental gap for a class of Schrödinger operators on path and hypercube graphs ⋮ Anderson localization makes adiabatic quantum optimization fail ⋮ Minor-embedding in adiabatic quantum computation. I: The parameter setting problem ⋮ Adiabatic graph-state quantum computation ⋮ Mapping a logical representation of TSP to quantum annealing ⋮ A quantum genetic algorithm for optimization problems on the Bloch sphere

This page was built for publication: The quantum adiabatic optimization algorithm and local minima