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.
Similar content being viewed by others
References
Bruß D, Macchiavello C (2011) Multipartite entanglement in quantum algorithms. Phys Rev A 83:052313
Deutsch D, Jozsa R (1992) Rapid solution of problems by quantum computation. Proc R Soc Lond A 439:553
Einstein A, Podolsky B, Rosen N (1935) Can quantum mechanical description of physical reality be considered complete? Phys Rev 47:777
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
Nielsen M, Chuang I (2000) Quantum computation and quantum information. Cambridge University Press, Cambridge
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
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
Vidal G (2003) Efficient classical simulation of slightly entangled quantum computations. Phys Rev Lett 91:147902
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
Corresponding author
Rights and permissions
About this article
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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-014-9481-2