2013/03/25 by Hitoshi Katsuda, Katsuda, Hitoshi, Hidetoshi Nishimori +1
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum many-body systems #Statistical Mechanics (cond-mat.stat-mech) #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.48550/arxiv.1303.6045
9 pages, 2 figures. submitted to Phys. Rev. E
arxiv created 2013/03/25 · openalex publication_date 2013/03/25 · arxiv updated 2013/03/26 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We propose a nonadiabatic approach to quantum annealing, in which we repeat quantum annealing in nonadiabatic time scales, and collect the final states of many realizations to find the ground state among them. In this way, we replace the diffculty of long annealing time in adiabatic quantum annealing by another problem of the number of nonsidabatic (short-time) trials. The one-dimensional transverse-field Ising model is used to test this idea, and it is shown that nonadiabatic quantum annealing has the same computational complexity to find the ground state as the conventional adiabatic annealing does. This result implies that the nonadiabatic method may be used to replace adiabatic annealing to avoid the effects of external disturbances, to which the adiabatic method is more prone than the nonadiabatic counterpart.