Unstructured randomness, small gaps and localization
Author(s)
Farhi, Edward; Goldstone, Jeffrey; Gosset, David Nicholas; Gutmann, Sam; Shor, Peter W.
DownloadFarhi0009.pdf (742.8Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We study the Hamiltonian associated with the quantum adiabatic algorithm with a random cost function. Because the cost function lacks structure we can prove results about the ground state. We find the ground state energy as the number of bits goes to infinity, show that the minimum gap goes to zero exponentially quickly, and we see a localization transition. We prove that there are no levels approaching the ground state near the end of the evolution. We do not know which features of this model are shared by a quantum adiabatic algorithm applied to random instances of satisfiability since despite being random they do have bit structure.
Description
published in arxiv only per Mat Willmott.
Date issued
2010-09Department
Massachusetts Institute of Technology. Center for Theoretical Physics; Massachusetts Institute of Technology. Department of Mathematics; Massachusetts Institute of Technology. Department of PhysicsJournal
arXiv.org
Publisher
Cornell University Library
Citation
Farhi, Edward et al. "Unstructured Randomness, Small Gaps and Localization." 30 Sep 2010, arXiv.org, Cornell University Library.
Version: Author's final manuscript
Other identifiers
arXiv:1010.0009v1 [quant-ph]
MIT-CTP/4181