Non-Adiabatic Quantum Dynamics of Grover's Adiabatic Search Algorithm
arXiv:1406.7138 · doi:10.1063/1.4903451
Abstract
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the non-adiabatic transition probability from exponential decay for short running time to inverse-square decay for long running time. The size dependence of the critical running time is expressed in terms of Lambert function. The transitionless driving Hamiltonian is obtained to make a quantum state follow the adiabatic path. We demonstrate that a constant Hamiltonian, approximate to the exact time-dependent driving Hamiltonian, can alter the non-adiabatic transition probability from the inverse square decay to the inverse fourth power decay with running time. This may open up a new way of reducing errors in adiabatic quantum computation.
arXiv comment7 figures, submitted
References in corpus (23)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Towards Quantum Chemistry on a Quantum Computer
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Fast optimal frictionless atom cooling in harmonic traps
- Shortcuts to adiabaticity
- Lewis-Riesenfeld invariants and transitionless tracking algorithm
- Quantum Brachistochrone
- Assisted finite-rate adiabatic passage across a quantum critical point: Exact solution for the quantum Ising model
- Experimental signature of programmable quantum annealing
- Fast-forward of adiabatic dynamics in quantum mechanics
- Adiabatic Quantum Simulation of Quantum Chemistry
- Review of Decoherence Free Subspaces, Noiseless Subsystems, and Dynamical Decoupling
- Multivariable Optimization: Quantum Annealing & Computation
- Accuracy vs run time in adiabatic quantum search
- General error estimate for adiabatic quantum computing
- Time-dependent Hamiltonians with 100% evolution speed efficiency
- Resonant Adiabatic Passage with Three Qubits
- Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm
- Adiabatic quantum search algorithm for structured problems
- Quantum splines