English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

MPS-Authors
/persons/resource/persons261006

Schiffer,  Benjamin
Theory, Max Planck Institute of Quantum Optics, Max Planck Society;
MCQST - Munich Center for Quantum Science and Technology, External Organizations;
IMPRS (International Max Planck Research School), Max Planck Institute of Quantum Optics, Max Planck Society;

/persons/resource/persons265336

Wild,  Dominik
Theory, Max Planck Institute of Quantum Optics, Max Planck Society;
MCQST - Munich Center for Quantum Science and Technology, External Organizations;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2306.13131.pdf
(Preprint), 3MB

6507.pdf
(Publisher version), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Schiffer, B., Wild, D., Maskara, N., Cain, M., Lukin, M. D., & Samajdar, R. (2024). Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization. Physical Review Research, 6: 013271. doi:10.1103/PhysRevResearch.6.013271.


Cite as: https://hdl.handle.net/21.11116/0000-000D-6524-9
Abstract
Classical optimization problems can be solved by adiabatically preparing the
ground state of a quantum Hamiltonian that encodes the problem. The performance
of this approach is determined by the smallest gap encountered during the
evolution. Here, we consider the maximum independent set problem, which can be
efficiently encoded in the Hamiltonian describing a Rydberg atom array. We
present a general construction of instances of the problem for which the
minimum gap decays superexponentially with system size, implying a
superexponentially large time to solution via adiabatic evolution. The small
gap arises from locally independent choices, which cause the system to
initially evolve and localize into a configuration far from the solution in
terms of Hamming distance. We investigate remedies to this problem.
Specifically, we show that quantum quenches in these models can exhibit
signatures of quantum many-body scars, which in turn, can circumvent the
superexponential gaps. By quenching from a suboptimal configuration, states
with a larger ground state overlap can be prepared, illustrating the utility of
quantum quenches as an algorithmic tool.