Recursive simulation of quantum annealing

The evaluation of the performance of adiabatic annealers is hindered by the lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient recursive method for its numerical simulation in case of...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. A, Mathematical and theoretical Vol. 48; no. 41; pp. 415301 - 21
Main Authors Sowa, A P, Everitt, M J, Samson, J H, Savel'ev, S E, Zagoskin, A M, Heidel, S, Zúñiga-Anaya, J C
Format Journal Article
LanguageEnglish
Published IOP Publishing 16.10.2015
Subjects
Adiabatic flow
adiabatic quantum computing
Algorithms
Annealing
classical simulation
Computer simulation
Evolution
Mathematical analysis
Mathematical models
quantum annealing
Recursive
Online AccessGet full text

Cover

More Information
Summary:The evaluation of the performance of adiabatic annealers is hindered by the lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient recursive method for its numerical simulation in case of both unitary and non-unitary evolution. Numerical simulations show distinctly different distributions for the most important figure of merit of adiabatic quantum computing-the success probability-in these two cases.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8113
1751-8121
DOI:10.1088/1751-8113/48/41/415301