Quantum search algorithms show quadratic speedups over their classical counterparts, and the speedup also turns out to be optimal. They share the common structure that an iteration contains two inversions, one with respect to a target state and the other to an initial state, and such iterations are applied O( √ N) times for an unsorted database of N items. In this work, we present the characterization to an iteration that leads to exact quantum search with a quadratic speedup. We show that the fixed-point quantum search algorithm with a quadratic speedup contains iterations that are not QAAOs whereas exact quantum algorithms are sequences of QAAOs. We also demonstrate 3-qubit QAAOs in cloud-based quantum computing services, IBMQ and IonQ.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.