DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwon, Hyeokjea | ko |
dc.contributor.author | Bae, Joonwoo | ko |
dc.date.accessioned | 2022-11-28T06:03:14Z | - |
dc.date.available | 2022-11-28T06:03:14Z | - |
dc.date.created | 2022-11-25 | - |
dc.date.issued | 2022-08-21 | - |
dc.identifier.citation | SPIE Optical Engineering + Applications | - |
dc.identifier.issn | 0277-786X | - |
dc.identifier.uri | http://hdl.handle.net/10203/301125 | - |
dc.description.abstract | 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( p 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. | - |
dc.language | English | - |
dc.publisher | The Society of Photo-Optical Instrumentation Engineers (SPIE) | - |
dc.title | Quantum amplitude amplification operators: exact quantum search | - |
dc.type | Conference | - |
dc.identifier.wosid | 000877358900006 | - |
dc.identifier.scopusid | 2-s2.0-85141831791 | - |
dc.type.rims | CONF | - |
dc.citation.publicationname | SPIE Optical Engineering + Applications | - |
dc.identifier.conferencecountry | US | - |
dc.identifier.conferencelocation | San Diego, CA | - |
dc.identifier.doi | 10.1117/12.2626449 | - |
dc.contributor.localauthor | Bae, Joonwoo | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.