Phase matching in quantum searching
arXiv:quant-ph/9906020 · doi:10.1016/S0375-9601(99)00631-3
Abstract
Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θand the inversion for the prepared state |γ> is replaced by rotation through ϕ, we found that these phase rotations must satisfy a matching condition θ=ϕ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. We give also a simple explanation of the phase matching requirement.
arXiv comment13 pages, 7 figures
References in corpus (8)
- Quantum Mechanics helps in searching for a needle in a haystack
- Tight bounds on quantum searching
- Quantum computers can search rapidly by using almost any transformation
- Experimental realization of a quantum algorithm
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Quantum computers can search arbitrarily large databases by a single query
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm
Cited by in corpus (42)
- Grover Algorithm with zero theoretical failure rate
- Fixed-point quantum search with an optimal number of queries
- The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
- Implementation of quantum search algorithm using classical Fourier optics
- On Arbitrary Phases in Quantum Amplitude Amplification
- Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
- Aberration and the Speed of Gravity
- Variationally Learning Grover's Quantum Search Algorithm
- Time-efficient implementation of quantum search with qudits
- Experimental NMR Realization of A Generalized Quantum Search Algorithm
- Staggered Quantum Walks with Hamiltonians
- General framework for quantum search algorithms
- Multi-phase matching in the Grover algorithm
- Dynamic Grover Search: Applications in Recommendation systems and Optimization problems
- Scalable quantum search using trapped ions
- An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
- A More General Quantum Searching Algorithm And the Precise Formula of the Amplitude and the Non-symmetric Effects of Different Rotating Angles
- Quantum heuristic algorithm for traveling salesman problem
- Quantum algorithm to distinguish Boolean functions of different weights
- Fixed-point Quantum Search for Different Phase Shifts
- Exact Quantum Search by Parallel Unitary Discrimination Schemes
- A Query-based Quantum Eigensolver
- A General Phase Matching Condition for Quantum Searching Algorithm
- Complementarity between Success Probability and Coherence in Grover Search Algorithm
- Algebraic analysis of quantum search with pure and mixed states
- Generalized Quantum PageRank Algorithm with Arbitrary Phase Rotations
- The Precise Formula in a Sine Function Form of the norm of the Amplitude and the Necessary and Sufficient Phase Condition for Any Quantum Algorithm with Arbitrary Phase Rotations
- Circuit Design for Clique Problem and Its Implementation on Quantum Computer
- A full circuit-based quantum algorithm for excited-states in quantum chemistry
- Quantum computers can search rapidly by using almost any selective transformations
- Amplitude Amplification for Optimization via Subdivided Phase Oracle
- Parameter-Parallel Distributed Variational Quantum Algorithm
- Quantum Walk Search through Potential Barriers
- Optimization of probabilistic quantum search algorithm with a priori information
- Quantifiable simulation of quantum computation beyond stochastic ensemble computation
- Complementary-multiphase quantum search for all numbers of target items
- Fixed-point quantum continuous search algorithm with optimal query complexity
- -depth-optimized Quantum Search with Quantum Data-access Machine
- Quantum versatility in PageRank
- Robust Quantum Circuit for Clique Problem with Intermediate Qudits
- Quantum algorithm for unstructured search of ranked targets
- Gaussian Amplitude Amplification for Quantum Pathfinding