Phase Matching in Quantum Searching

  title={Phase Matching in Quantum Searching},
  author={Gui Lu Long and Yan Li and W. L. Zhang and Li Niu},
  journal={Physics Letters A},
Abstract When arbitrary phase rotations are used instead of inversions in Grover's quantum algorithm, they must satisfy a matching condition. When phase matching is satisfied, the quantum search is an approximate rotation in 2-dimensional space. An approximate formula for the amplitude is derived. A simple explanation is also given. 
Phase matching condition for quantum search with a generalized initial state
We present a general phase matching condition for the quantum search algorithm with arbitrary unitary transformation and arbitrary phase rotations in the case of a general initial state. We show byExpand
Geometric pictures for quantum search algorithms
The geometric pictures for quantum search algorithms in decomposed form are given, namely in terms of a phase rotation of the marked state and a phase rotated about the average, to show how state vectors evolve during the search process. Expand
The Generalized Quantum Database Search Algorithm
In this paper, we analyze and enhance previously achieved results related to the generalized Grover search algorithm in terms of arbitrary initial pure state, arbitrary unitary transformation,Expand
Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
Abstract Grover's quantum algorithm for an unstructured search problem and the COUNT algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximallyExpand
Influences of Gate Operation Errors in the Quantum Counting Algorithm
It has been found that the random error plays as important a role as the systematic error does in the phase inversion operations in the quantum counting algorithm. Expand
Experimental NMR realization of a generalized quantum search algorithm
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by pi /2 phase rotations, is realized in a 2-qubit NMR heteronuclear system.Expand
Fixed-point quantum search for different phase shifts
Grover recently presented the fixed-point search algorithm. In this Letter, we study the fixed-point search algorithm obtained by replacing equal phase shifts of π/3 by different phase shifts.
More general quantum search algorithm Q=−IγVIτU and the precise formula for the amplitude and the non-symmetric effects of different rotating angles
Abstract This Letter presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desiredExpand
Implementation of quantum search algorithm using classical Fourier optics.
An experiment on Grover's quantum search algorithm shows that classical waves can search a N-item database as efficiently as quantum mechanics can, although the lack of quantum entanglement limits the size of the database. Expand
Search an unsorted database with quantum mechanics
  • G. Long, Y. Liu
  • Computer Science
  • Frontiers of Computer Science in China
  • 2007
The phase matching conditions in quantum search algorithm for unsorted database search problem are reviewed and several issues that may cause confusion are clarified. Expand


Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover's Quantum Search Algorithm
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation can be used to construct a (less efficient) quantum search algorithm isExpand
Quantum Computers Can Search Rapidly by Using Almost Any Transformation
This paper shows that this algorithm for exhaustive search can be implemented by replacing the W-H transform by almost any quantum mechanical operation, which leads to several new applications where it improves the number of steps by a square-root. Expand
Experimental realization of a quantum algorithm
Quantum computers can in principle exploit quantum-mechanical effects to perform computations (such as factoring large numbers or searching an unsorted database) more rapidly than classicalExpand
Tight bounds on quantum searching
A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table. Expand
Experimental Implementation of Fast Quantum Searching
Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover’s search algorithm for a system with four states. By performing a tomographic reconstruction ofExpand
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Quantum mechanics can speed up a range of search applications over unsorted data. For example, imagine a phone directory containing $N$ names arranged in completely random order. To find someone'sExpand
Quantum computers can search arbitrarily large databases by a single query
This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database can search a database for a unique item satisfying a given condition, in aExpand
Implementation of a quantum search algorithm on a quantum computer
In 1982 Feynman observed that quantum-mechanical systems have an information-processing capability much greater than that of corresponding classical systems, and could thus potentially be used toExpand
Searching a Quantum Phone Book
Finding a phone number in a directory when one knows the name is easy; much harder is finding the name given the number. On average, a search algorithm will have to scan half the total number ofExpand
Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantumExpand