Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search
Author(s) -
Gaitan Frank
Publication year - 2008
Publication title -
complexity
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.447
H-Index - 61
eISSN - 1099-0526
pISSN - 1076-2787
DOI - 10.1002/cplx.20252
Subject(s) - hamiltonian (control theory) , adiabatic process , exponent , adiabatic quantum computation , statistical physics , hamiltonian path , hamiltonian path problem , noise (video) , scaling , mathematics , quantum , power law , physics , computer science , quantum mechanics , quantum computer , mathematical optimization , statistics , discrete mathematics , geometry , graph , linguistics , philosophy , artificial intelligence , image (mathematics)
We numerically simulate the effects of noise‐induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP‐complete problem N‐bit Exact Cover 3. The noise‐averaged median runtime is determined as the noise‐power and number of bits N are varied, and power‐law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise‐power values. We discuss whether this shift might be connected to arguments in the literature that suggest that altering the Hamiltonian path might benefit QuAdS performance. © 2008 Wiley Periodicals, Inc. Complexity, 2009
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom