Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914712196743168 |
|---|---|
| author | Schiffer, Benjamin F. Wild, Dominik S. Maskara, Nishad Cain, Madelyn Lukin, Mikhail D. Samajdar, Rhine |
| author_facet | Schiffer, Benjamin F. Wild, Dominik S. Maskara, Nishad Cain, Madelyn Lukin, Mikhail D. Samajdar, Rhine |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_13131 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization Schiffer, Benjamin F. Wild, Dominik S. Maskara, Nishad Cain, Madelyn Lukin, Mikhail D. Samajdar, Rhine Quantum Physics Statistical Mechanics Strongly Correlated Electrons 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. |
| title | Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization |
| topic | Quantum Physics Statistical Mechanics Strongly Correlated Electrons |
| url | https://arxiv.org/abs/2306.13131 |