论文信息 - Some Properties of Quantum Data Search Algorithms

Some Properties of Quantum Data Search Algorithms

This paper deals with some properties of quantum data search algorithms. First, Grover’s and Ventura’s algorithms for quantum data search are introduced and compared with each other. As a result, it is shown that both algorithms are not always universal with the number of stored data. Further, some properties on the data search algorithms are shown.

[1] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[2] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[3] Yen-Yu Chen,et al. Blocking Artifacts Reduction using Two Modes Shift Block Filter , 2008 .

[4] Tony R. Martinez,et al. Quantum associative memory , 2000, Inf. Sci..

[5] T. Martinez,et al. Initializing the Amplitude Distribution of a Quantum State , 1998, quant-ph/9807054.

[6] Chang-Su Kim,et al. Post-Processing Algorithm for Reducing Ringing Artefacts in Deblurred Images , 2008 .

[7] Markus Grassl,et al. Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.