Probing nonlinear adiabatic paths with a universal integrator

Abstract

We apply a flexible numerical integrator to the simulation of adiabatic quantum computation with nonlinear paths. We find that a nonlinear path may significantly improve the performance of adiabatic algorithms versus the conventional straight-line interpolations. The employed integrator is suitable for solving the time-dependent Schrödinger equation for any qubit Hamiltonian. Its flexible storage format significantly reduces cost for storage and matrix-vector multiplication in comparison to common sparse matrix schemes.

8 pages, 6 figures

References in corpus (7)

• 14-qubit entanglement: creation and coherence
• Bounds for the adiabatic approximation with applications to quantum computation
• Anderson localization casts clouds over adiabatic quantum optimization
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• First order phase transition in the Quantum Adiabatic Algorithm
• Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
• Adiabatic preparation without Quantum Phase Transitions

Cited by in corpus (6)

• The theory of variational hybrid quantum-classical algorithms
• Conditions tighter than noncommutation needed for nonclassicality
• Schedule path optimization for quantum annealing and adiabatic quantum computing
• Theorem on the existence of a nonzero energy gap in adiabatic quantum computation
• Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
• Kirkwood-Dirac classical pure states