Quasi-adiabatic Grover search via the WKB approximation

Abstract

In various applications one is interested in quantum dynamics at intermediate evolution times, for which the adiabatic approximation is inadequate. Here we develop a quasi-adiabatic approximation based on the WKB method, designed to work for such intermediate evolution times. We apply it to the problem of a single qubit in a time-varying magnetic field, and to the Hamiltonian Grover search problem, and show that already at first order, the quasi-adiabatic WKB captures subtle features of the dynamics that are missed by the adiabatic approximation. However, we also find that the method is sensitive to the type of interpolation schedule used in the Grover problem, and can give rise to nonsensical results for the wrong schedule, due to loss of normalization. Conversely, it reproduces the quadratic Grover speedup when the well-known optimal schedule is used.

arXiv comment13 pages, 13 figures; updated to published version

References in corpus (13)

• Quantum Mechanics helps in searching for a needle in a haystack
• Strengths and Weaknesses of Quantum Computing
• Quantum Search by Local Adiabatic Evolution
• Bounds for the adiabatic approximation with applications to quantum computation
• Analytically solvable driven time-dependent two-level quantum systems
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
• Optimal control of quantum gates and suppression of decoherence in a system of interacting two-level particles
• Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics
• Cosmological particle production and the precision of the WKB approximation
• Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
• Rapid adiabatic preparation of injective PEPS and Gibbs states
• Accuracy vs run time in adiabatic quantum search