Tighter lower bounds on quantum annealing times
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently, the bounds are computable without knowledge of th...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SciPost
2025-05-01
|
| Series: | SciPost Physics |
| Online Access: | https://scipost.org/SciPostPhys.18.5.159 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently, the bounds are computable without knowledge of the annealer's dynamics and, in certain cases, scale with the size of the system. We discuss spin systems where the bounds are polynomially tighter than existing bounds, qualitatively capturing the scaling of the exact annealing times as a function of the number of spins. |
|---|---|
| ISSN: | 2542-4653 |