A General Phase Matching Condition for Quantum Searching Algorithm

Abstract

A general consideration on the phase rotations in quantum searching algorithm is taken in this work. As four phase rotations on the initial state, the marked states, and the states orthogonal to them are taken account, we deduce a phase matching condition for a successful search. The optimal options for these phase are obtained consequently.

3 pages, 3 figures

Cited by in corpus (8)

• Variationally Learning Grover's Quantum Search Algorithm
• Quantum algorithm to distinguish Boolean functions of different weights
• Strength and Weakness in Grover's Quantum Search Algorithm
• A General SU(2) Formulation for Quantum Searching with Certainty
• Complementary-multiphase quantum search for all numbers of target items
• $T$-depth-optimized Quantum Search with Quantum Data-access Machine
• Constant-Time Quantum Algorithm For The Unstructured Search Problem
• Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q