Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q

Abstract

In [Phys. Rev. Lett. 113, 210501 (2014)], to achieve the optimal fixed-point quantum search in the case of unknown fraction (denoted by $\lambda$) of target items, the analytical multiphase matching (AMPM) condition has been proposed. In this paper, we find out that the AMPM condition can also be used to design the exact quantum search algorithm in the case of known $\lambda$, and the minimum number of iterations reaches the optimal level of existing exact algorithms. Experiments are performed to demonstrate the proposed algorithm on IBM's quantum computer. In addition, we theoretically find two coincidental phases with equal absolute value in our algorithm based on the AMPM condition and that algorithm based on single-phase matching. Our work confirms the practicability of the AMPM condition in the case of known $\lambda$, and is helpful to understand the mechanism of this condition.

13 pages, 6 figures, 1 table. Comments are warmly welcome!

References in corpus (14)

• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum computers can search rapidly by using almost any transformation
• Grover Algorithm with zero theoretical failure rate
• Fixed-point quantum search with an optimal number of queries
• A different kind of quantum search
• On Arbitrary Phases in Quantum Amplitude Amplification
• Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
• Multi-phase matching in the Grover algorithm
• Fixed-Point Adiabatic Quantum Search
• Generalized Grover's algorithm for multiple phase inversion states
• A General Phase Matching Condition for Quantum Searching Algorithm
• A family of sure-success quantum algorithms for solving a generalized Grover search problem
• Complementary-multiphase quantum search for all numbers of target items
• Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution