Recursive simulation of quantum annealing
arXiv:1508.04938 · doi:10.1088/1751-8113/48/41/415301
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.
arXiv comment17 pages, accepted by Journal of Physics A: Theoretical and Mathematical
References in corpus (8)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Defining and detecting quantum speedup
- Adiabatic Quantum Computation in Open Systems
- Experimental determination of Ramsey numbers
- Quantum and Classical in Adiabatic Computation
- Theorem on the existence of a nonzero energy gap in adiabatic quantum computation
- The relationship between minimum gap and success probability in adiabatic quantum computing