Lower bounds for adiabatic quantum algorithms by quantum speed limits
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial state. After examining adiabatic versions of certain keystone cir...
Main Author: | Jyong-Hao Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2023-09-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.5.033175 |
Similar Items
-
Bounds on quantum adiabaticity in driven many-body systems from generalized orthogonality catastrophe and quantum speed limit
by: Jyong-Hao Chen, et al.
Published: (2022-10-01) -
ANALYSIS OF LOWER BOUNDS FOR QUANTUM CONTROL TIMES AND THEIRRELATION TO THE QUANTUM SPEED LIMIT
by: P. M. Poggi
Published: (2020-04-01) -
Kibble-Zurek scaling in quantum speed limits for shortcuts to adiabaticity
by: Ricardo Puebla, et al.
Published: (2020-07-01) -
Bounding first-order quantum phase transitions in adiabatic quantum computing
by: Matthias Werner, et al.
Published: (2023-12-01) -
Effects of coherence on quantum speed limits and shortcuts to adiabaticity in many-particle systems
by: Tian-Niu Xu, et al.
Published: (2020-05-01)