Analog nature of quantum adiabatic unstructured search
Abstract
The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the resilience of such algorithms against errors, understanding the impact of imperfections on their performance is of both scientific and practical significance. We study the robustness of the algorithm against various types of imperfections: limited control over the interpolating schedule, Hamiltonian misspecification, and interactions with a thermal environment. We find that the unstructured search algorithm’s quadratic speedup is generally not robust to the presence of any one of the above non-idealities, and in some cases we find that it imposes unrealistic conditions on how the strength of these noise sources must scale to maintain the quadratic speedup.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Nov 01, 2019
- Source ID
- 10.1088/1367-2630/ab51f9
Entities
People
- Itay Hen
- Lev Barash
- Mikhail Slutskii
- Tameem Albash
Organizations
- Intelligence Advanced Research Projects Activity