Quantum Amplitude Amplification Operators
arXiv:2105.09559 · doi:10.1103/PhysRevA.104.062438
Abstract
In this work, we show the characterization of quantum iterations that would generally construct quantum amplitude amplification algorithms with a quadratic speedup, namely, quantum amplitude amplification operators (QAAOs). Exact quantum search algorithms that find a target with certainty and with a quadratic speedup can be composed of sequential applications of QAAO: existing quantum amplitude amplification algorithms thus turn out to be sequences of QAAOs. We show that an optimal and exact quantum amplitude amplification algorithm corresponds to the Grover algorithm together with a single iteration of QAAO. We then realize 3-qubit QAAOs with the current quantum technologies via cloud-based quantum computing services, IBMQ and IonQ. Finally, our results find that fixed-point quantum search algorithms known so far are not a sequence of QAAOs, e.g. the amplitude of a target state may decrease during quantum iterations.
arXiv comment11 pages, 7 figures, 2 tables
References in corpus (22)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Quantum Mechanics helps in searching for a needle in a haystack
- Strengths and Weaknesses of Quantum Computing
- Quantum Amplitude Amplification and Estimation
- Parameterized quantum circuits as machine learning models
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- Grover Algorithm with zero theoretical failure rate
- Quantum advantage with shallow circuits
- The Expressive Power of Parameterized Quantum Circuits
- Amplitude estimation without phase estimation
- Fixed-point quantum search with an optimal number of queries
- A different kind of quantum search
- On Arbitrary Phases in Quantum Amplitude Amplification
- Quantum Algorithms for Jet Clustering
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- Variationally Learning Grover's Quantum Search Algorithm
- Searching in Grover's Algorithm
- The Grover search as a naturally occurring phenomenon
- State preparation based on Grover's algorithm in the presence of global information about the state