Optimal parametrizations of adiabatic paths
arXiv:1003.2172 · doi:10.1103/PhysRevA.82.040304
Abstract
The parametrization of adiabatic paths is optimal when tunneling is minimized. Hamiltonian evolutions do not have unique optimizers. However, dephasing Lindblad evolutions do. The optimizers are simply characterized by an Euler-Lagrange equation and have a constant tunneling rate along the path irrespective of the gap. Application to quantum search algorithms recovers the Grover result for appropriate scaling of the dephasing. Dephasing rates that beat Grover imply hidden resources in Lindblad operators.
arXiv comment4 pages, 2 figures; To prevent from misunderstanding, we clarified the discussion of an apparent speedup in the Grover algorithm; figures improved + minor changes
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
- Robustness of adiabatic quantum computation
- Bounds for the adiabatic approximation with applications to quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Adiabatic Quantum Computation in Open Systems
- Quantum Adiabatic Brachistochrone
- Quantum search by measurement
- General Adiabatic Evolution with a Gap Condition
- Measuring Energy, Estimating Hamiltonians, and the Time-Energy Uncertainty Relation
- Robustness of the adiabatic quantum search
- On the quasi-static evolution of nonequilibrium steady states
Cited by in corpus (14)
- Decoherence in adiabatic quantum computation
- Geometry and response of Lindbladians
- Adiabatic theorems for generators of contracting evolutions
- A dissipative environment may improve the quantum annealing performances of the ferromagnetic p-spin model
- Adiabatic Quantum Search in Open Systems
- Testing a quantum annealer as a quantum thermal sampler
- Feedback-controlled adiabatic quantum computation
- The relationship between minimum gap and success probability in adiabatic quantum computing
- Adiabatic quantum trajectories in engineered reservoirs
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- Quantum Dissipative Search via Lindbladians
- Quantum adiabatic optimization without heuristics
- Landau-Zener tunneling for dephasing Lindblad evolutions
- Adiabatic theorem for a class of quantum stochastic equations