Skip to main content
Log in

Multipartite entanglement in Grover’s search algorithm

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

We firstly investigate the multipartite entanglement features of the quantum states by means of the separable degree and the entanglement measure. Then we give the qualitative and quantitative descriptions of the entanglement dynamics of the quantum states in Grover’s search algorithm. Our results show that for most instances (1) the separable degrees of these states and ranges of their maximum Schmidt numbers are invariable by following the dynamics of Grover’s search algorithm; (2) the dynamics of Grover’s search algorithm is almost “filled” by the fully entangled states.

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.

Similar content being viewed by others

References

  • Bruß D, Macchiavello C (2011) Multipartite entanglement in quantum algorithms. Phys Rev A 83:052313

    Article  Google Scholar 

  • Deutsch D, Jozsa R (1992) Rapid solution of problems by quantum computation. Proc R Soc Lond A 439:553

    Article  MATH  MathSciNet  Google Scholar 

  • Einstein A, Podolsky B, Rosen N (1935) Can quantum mechanical description of physical reality be considered complete? Phys Rev 47:777

    Article  MATH  Google Scholar 

  • Grover L (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th annual ACM symposium on the theory of computing. ACM Press, New York

  • Horodecki R, Horodecki P, Horodecki M, Horodecki K (2009) Quantum entanglement. Rev Mod Phys 81:865

    Article  MATH  MathSciNet  Google Scholar 

  • Nielsen M, Chuang I (2000) Quantum computation and quantum information. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Qu R, Bao Y-R (2012) Quantum entanglement in n-qubit real equally weighted states. (e-print) arXiv:quant-ph/1207.2518

  • Schrdinger E (1935) Die gegenwrtige situation in der quantenmechanik. Naturwisssenschaften 23:807

    Article  Google Scholar 

  • Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser S (ed) Proceedings of the 35th IEEE symposium on the foundations of computer science. IEEE Computer Society, Los Alamitos, CA

  • Simon D (1994) On the power of quantum computation. In: Goldwasser S (ed) Proceedings of the 35th IEEE symposium on the foundations of computer science. IEEE computer society, Los Alamitos, CA

  • Vidal G (2000) Entanglement monotones. J Mod Opt 47:355

    Article  MathSciNet  Google Scholar 

  • Vidal G (2003) Efficient classical simulation of slightly entangled quantum computations. Phys Rev Lett 91:147902

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the Chinese National Program on Key Basic Research Project (973 Program, Grant Nos. 2014CB744605 and 2013CB329304), the Natural Science Foundation of China (Grant Nos. 61170178, 61272254 and 61272265).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanru Bao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qu, R., Shang, B., Bao, Y. et al. Multipartite entanglement in Grover’s search algorithm. Nat Comput 14, 683–689 (2015). https://doi.org/10.1007/s11047-014-9481-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-014-9481-2

Keywords

Navigation