2013/02/26 by Alexander I. Nesterov, Gennady P. Berman, Juan C. Beas Zepeda +1
Mathematics · Physics and Astronomy · #math-ph #math.MP #physics.comp-ph #quant-ph
paper · pdf · doi:10.1007/s11128-013-0656-z
published as Quantum Inf. Process. 13, 371-379 (2014) · 19 pages, 6 figures. arXiv admin note: substantial text overlap with arXiv:1211.3178
arxiv created 2013/02/26 · arxiv updated 2015/01/05
A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an antiferromagnetic Ising chain. We demonstrate analytically and numerically (for up to N=1024 spins) that our approach leads to a significant reduction of the annealing time that is proportional to ln N, which is much less than the time (proportional to N2) required for the quantum annealing based on the corresponding Hermitian algorithm. We propose to use this approach to achieve similar speed-up for NP-complete problems by using classical computers in combination with quantum algorithms.