Skip to main content
Log in

Quantum Counting: Algorithm and Error Distribution

  • Published:
Acta Applicandae Mathematicae Aims and scope Submit manuscript

Abstract

Counting is one of the most basic procedures in mathematics and statistics. In statistics literature it is usually done via the proportion estimation method. In this article we manifest a radically different counting procedure first proposed in the late 1990’s based on the techniques of quantum computation. It combines two major tools in quantum computation, quantum Fourier transform and quantum amplitude amplification, and shares similar structure to the quantum part of the celebrated Shor’s factoring algorithm. We present complete details of this quantum counting algorithm and the analysis of its error distribution. Comparing it with the conventional proportion estimation method, we demonstrate that this quantum approach achieves much faster convergence rate than the classical approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. In [8], they are misdefined to be the other way around.

References

  1. Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46, 493–506 (1998)

    Article  Google Scholar 

  2. Brassard, G., Hoyer, P., Tapp, A.: Quantum counting. In: Proc. of the 25th Int. Colloquium on Automata, Languages and Programming. Lecture Notes in Comp. Sci., vol. 1443, pp. 820–831. Springer, New York (1998)

    Chapter  Google Scholar 

  3. Casella, G., Berger, R.L.: Statistical Inference. Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove (1990)

    MATH  Google Scholar 

  4. Diao, Z.: Quantum Computation. Handbook of Linear Algebra. Discrete Mathematics and Its Applications, pp. 62–71. Chapman & Hall/CRC Press, Boca Raton (2006)

    Google Scholar 

  5. Diao, Z.: Exactness of the original Grover search algorithm. Phys. Rev. A 82, 044301 (2010)

    Article  Google Scholar 

  6. Durrett, R.: Probability: Theory and Examples. Duxbury Press, Belmont (1996)

    Google Scholar 

  7. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 78, 325–328 (1997)

    Article  Google Scholar 

  8. Mosca, M.: Quantum computer algorithms. Ph.D. Thesis, Oxford University Press (1999)

  9. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

Download references

Acknowledgements

The first author was supported by an Ohio University Faculty Research Activity Fund. The second author was supported by National Science Foundation Award DMS 0808993. The third author was partially supported by a grant from the Scientific Research Foundation for the Returned Overseas Chinese Scholars, Ministry of Education of China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zijian Diao.

Additional information

To Prof. Goong Chen on the occasion of his 60th birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diao, Z., Huang, C. & Wang, K. Quantum Counting: Algorithm and Error Distribution. Acta Appl Math 118, 147–159 (2012). https://doi.org/10.1007/s10440-012-9682-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10440-012-9682-6

Keywords

Mathematics Subject Classification (2010)

Navigation