Physics – Quantum Physics
Scientific paper
2009-12-03
Proceedings of the National Academy of Sciences of the United States of America, 107(28):12446-12450, 2010
Physics
Quantum Physics
14 pages, 4 figures
Scientific paper
10.1073/pnas.1002116107
Understanding NP-complete problems is a central topic in computer science. This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer. The efficiency of this approach is limited by small spectral gaps between the ground and excited states of the quantum computer's Hamiltonian. We show that the statistics of the gaps can be analyzed in a novel way, borrowed from the study of quantum disordered systems in statistical mechanics. It turns out that due to a phenomenon similar to Anderson localization, exponentially small gaps appear close to the end of the adiabatic algorithm for large random instances of NP-complete problems. This implies that unfortunately, adiabatic quantum optimization fails: the system gets trapped in one of the numerous local minima.
Altshuler Boris
Krovi Hari
Roland Jérémie
No associations
LandOfFree
Anderson localization casts clouds over adiabatic quantum optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Anderson localization casts clouds over adiabatic quantum optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anderson localization casts clouds over adiabatic quantum optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-419833