pith. sign in

arxiv: 1010.0669 · v3 · pith:4CTG2K57new · submitted 2010-10-04 · 🪐 quant-ph

Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?

classification 🪐 quant-ph
keywords adiabaticnp-completeoptimizationquantumfailproblemproblemsprove
0
0 comments X
read the original abstract

It has been recently argued that adiabatic quantum optimization would fail in solving NP-complete problems because of the occurrence of exponentially small gaps due to crossing of local minima of the final Hamiltonian with its global minimum near the end of the adiabatic evolution. Using perturbation expansion, we analytically show that for the NP-hard problem of maximum independent set there always exist adiabatic paths along which no such crossings occur. Therefore, in order to prove that adiabatic quantum optimization fails for any NP-complete problem, one must prove that it is impossible to find any such path in polynomial time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.