GapVsP.pdf (943.5 kB)

Relationship between minimum gap and success probability in adiabatic quantum computing

Download (943.5 kB)
journal contribution
posted on 31.01.2013 by M. Cullimore, Mark Everitt, M.A. Ormerod, John Samson, Richard D. Wilson, Alexandre Zagoskin
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability P and the minimum gap Δmin between the ground and first excited states, investigating to what extent the success probability for an ensemble of problem Hamiltonians can be fitted by a function of Δmin and the computation time T. We study a generic adiabatic algorithm and show that a rich structure exists in the distribution of P and Δmin. In the case of two qubits, P is to a good approximation a function of Δmin, of the stage in the evolution at which the minimum occurs and of T. This structure persists in examples of larger systems.

History

School

  • Science

Department

  • Physics

Citation

CULLIMORE, M. ... et al, 2012. Relationship between minimum gap and success probability in adiabatic quantum computing. Journal of Physics A - Mathematical and Theoretical, 45 (50), 505305 (12pp.).

Publisher

© IOP Publishing

Version

AM (Accepted Manuscript)

Publication date

2012

ISSN

1751-8113

Language

en

Exports

Logo branding

Keyword(s)

Exports