Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm
arXiv:quant-ph/9904077 · doi:10.1088/0253-6102/32/3/335
Abstract
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover's search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grover's quantum search algorithm. The results also show that Grover's quantum search algorithm is robust.
arXiv comment5 pages, 5 figures
Cited by in corpus (15)
- On Arbitrary Phases in Quantum Amplitude Amplification
- Phase matching in quantum searching
- Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
- Variationally Learning Grover's Quantum Search Algorithm
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
- Experimental NMR Realization of A Generalized Quantum Search Algorithm
- Prime Factorization in the Duality Computer
- A More General Quantum Searching Algorithm And the Precise Formula of the Amplitude and the Non-symmetric Effects of Different Rotating Angles
- Exact Quantum Search by Parallel Unitary Discrimination Schemes
- Analysis of Grover's quantum search algorithm as a dynamical system
- Algebraic analysis of quantum search with pure and mixed states
- Amplitude Amplification for Optimization via Subdivided Phase Oracle
- Query complexity for searching multiple marked states from an unsorted database
- Invariance of success probability in Grover's quantum search under local noise with memory
- Gaussian Amplitude Amplification for Quantum Pathfinding