Quick Navigation
Topics
Quantum Simulation
Recursive simulation of quantum annealing
arXiv
Authors: A. P. Sowa, M. J. Everitt, J. H. Samson, S. E. Savel'ev, A. M. Zagoskin, S. Heidel, J. C. Zúñiga-Anaya
Year
2015
Paper ID
27702
Status
Preprint
Abstract Read
~2 min
Abstract Words
76
Citations
N/A
Abstract
The evaluation of the performance of adiabatic annealers is hindered by 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.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2015 reference point for readers tracking recent quantum research.
- The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.