Abstract
Quantum search algorithms have been shown to deliver quadratic speedups over classical ones. The authors propose a generalized form of such algorithms through the use of ``quantum amplitude-amplification operators'' (QAAOs), with a goal of implementing them on near-term quantum devices. They demonstrate three-qubit examples on cloud-based quantum computing services, and use their framework to distinguish between exact and fixed-point quantum search algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
