Open Collections

Adiabatic Quantum Optimization and Anderson Localization

University of British Columbia. Department of Physics and Astronomy; Workshop on Quantum Algorithms, Computational Models and Foundations of Quantum Mechanics; Pacific Institute for the Mathematical Sciences; Summer School on Quantum Information (10th : 2010 : Vancouver, B.C.)

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 will discuss the statistics of the gaps using the borrowed from the theory of quantum disordered systems. 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. We will present the quantitative analysis of the small spectral gaps and discuss possible consequence of this phenomenon on the adiabatic optimization paradigm.

Text; Moving Image

2010-11-22

Attribution-NonCommercial-NoDerivatives 4.0 International

http://hdl.handle.net/2429/30065

Unreviewed

http://creativecommons.org/licenses/by-nc-nd/4.0/