# Bounds for Error Reduction with Few Quantum Queries

Conference paper

## Abstract

We consider the quantum database search problem, where we are given a function where

*f*: [*N*] → {0,1}, and are required to return an*x*∈ [*N*] (a target address) such that*f*(*x*)=1. Recently, Grover [G05] showed that there is an algorithm that after making one quantum query to the database, returns an*X*∈ [*N*] (a random variable) such that$$ \Pr[f(X)=0] = \epsilon^3,$$

*ε*= |*f*^{− − 1}(0)|/*N*. Using the same idea, Grover derived a*t*-query quantum algorithm (for infinitely many*t*) that errs with probability only*ε*^{2 t + 1}. Subsequently, Tulsi, Grover and Patel [TGP05] showed, using a different algorithm, that such a reduction can be achieved for all*t*. This method can be placed in a more general framework, where given any algorithm that produces a target state for some database*f*with probability of error*ε*, one can obtain another that makes*t*queries to*f*, and errs with probability*ε*^{2t + 1}. For this method to work, we do not require prior knowledge of*ε*. Note that no classical randomized algorithm can reduce the error probability to significantly below*ε*^{ t + 1}, even if*ε*is known. In this paper, we obtain*lower bounds*that show that the amplification achieved by these quantum algorithms is essentially optimal. We also present simple alternative algorithms that achieve the same bound as those in Grover [G05], and have some other desirable properties. We then study the best reduction in error that can be achieved by a*t*-query quantum algorithm, when the initial error*ε*is known to lie in an interval of the form [ℓ,*u*]. We generalize our basic algorithms and lower bounds, and obtain nearly tight bounds in this setting.## Keywords

Quantum Algorithm Error Reduction Quantum Circuit Quantum Search Target Address
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [BB+95]Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. FOCS, 352–361 (1998), quant-ph/9802049 Google Scholar
- [BC+99]Buhrman, H., Cleve, R., de Wolf, R., Zalka, C.: Bounds for Small-Error and Zero-Error Quantum Algorithms. In: FOCS, pp. 358–368 (1999)Google Scholar
- [BH+02]Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Lomonaco, S.J., Brandt, H.E. (eds.) Quantum Computation and Information. AMS Contemporary mathematics Series, vol. (305), pp. 53–74 (2002), quantph/ 0005055Google Scholar
- [G96]Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC, pp. 212–219 (1996), quant-ph/9605043Google Scholar
- [G97]Grover, L.K.: Quantum Mechanics helps in searching for a needle in a haystack. Physical Review Letters 79(2), 325–328 (1997), quant-ph/9706033CrossRefGoogle Scholar
- [G98a]Grover, L.K.: A framework for fast quantum mechanical algorithms. In: Proc. 30th ACM Symposium on Theory of Computing (STOC), pp. 53–63 (1998)Google Scholar
- [G98b]Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phy. Rev. Letters 80(19), 4329–4332 (1998), quant-ph/9711043CrossRefGoogle Scholar
- [G05]Grover, L.K.: A different kind of quantum search (March 2005), quant-ph/0503205 Google Scholar
- [MP]Minsky, M.L., Papert, S.A.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Cambridge (1968)Google Scholar
- [NC]Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
- [TGP05]Tulsi, T., Grover, L.K., Patel, A.: A new algorithm for directed quantum search (May 2005), quant-ph/0505007Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 2005