Unstructured randomness, small gaps and localization
Name
Farhi0009.pdf
Size
742.82 KB
Format
Adobe PDF
Checksum (MD5)
20ca2fd3b7383334b7fb47c7d6d35f7a
Author(s)
Farhi, Edward
Goldstone, Jeffrey
Gosset, David Nicholas
Gutmann, Sam
Shor, Peter W.
Date Issued
September 2010
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Massachusetts Institute of Technology. Department of Mathematics
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.48550/arXiv.1010.0009
