Limits of Short-Time Evolution of Local Hamiltonians
arXiv:2104.12808 · doi:10.22331/q-2022-06-27-744
Abstract
Evolutions of local Hamiltonians in short times are expected to remain local and thus limited. In this paper, we validate this intuition by proving some limitations on short-time evolutions of local time-dependent Hamiltonians. We show that the distribution of the measurement output of short-time (at most logarithmic) evolutions of local Hamiltonians are \emph{concentrated} and satisfy an \emph{isoperimetric inequality}. To showcase explicit applications of our results, we study the \textsc{MaxCut} problem and conclude that quantum annealing needs at least a run-time that scales logarithmically in the problem size to beat classical algorithms on \textsc{MaxCut}. To establish our results, we also prove a Lieb-Robinson bound that works for time-dependent Hamiltonians which might be of independent interest.
25 pages, 4 figures
References in corpus (10)
- A Quantum Approximate Optimization Algorithm
- Lieb-Robinson bounds and the generation of correlations and topological quantum order
- Propagation of Correlations in Quantum Lattice Systems
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Quantum annealing correction for random Ising problems
- Hybrid quantum-classical algorithms for approximate graph coloring
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
- Optimal Control for Closed and Open System Quantum Optimization
- Behavior of Analog Quantum Algorithms