Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Natural Computing

Multipartite entanglement in Grover’s search algorithm

Ri Qu, Bing-jian Shang, Yan-ru Bao, Dawei Song, ChunMing Teng, Zhiwei Zhou

Published Jan 8, 2015• 7 citations
Publisher
DOI
10.1007/s11047-014-9481-2

Related papers

Global multipartite entanglement dynamics in Grover’s search algorithm

Minghua Pan, Daowen Qiu, Shenggen Zheng

arXiv:2003.03483•Quantum Information Processing•Jul 20, 2017•17 citations

Entanglement in the Grover search algorithm

Yiyuan Fang, Dagomir Kaszlikowski, Chunming Chin +3 more

Physics Letters A•Jul 23, 2005•23 citations

The quadratic speedup in Grover's search algorithm from the entanglement perspective

Pranaw Rungta

arXiv:0707.1410•Physics Letters A•May 31, 2009•21 citations

Entangling and disentangling in Grover's search algorithm

Minghua Pan, Daowen Qiu, Paulo Mateus +1 more

Theoretical Computer Science•Oct 18, 2018•13 citations

Implementation of Grover's search algorithm using entangled `clock state' qubits

Kathy-Anne Brickman, M. Acton, Louis Deslauriers +3 more

Bulletin of the American Physical Society•May 17, 2006•0 citations

Multipartite entanglement and Grover's search algorithm

Ri Qu, Juan Wang, Zong-shang Li +3 more

We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by applying single Oracle operation, employed in Grover's search algorithm by means of the separable degree and the entanglement measure. Then we give the quantitative and qualitative descriptions of the entanglement dynamics in Grover's search algorithm. Our results show that for most instances (i) the separable degrees of these states and ranges of their maximum Schmidt numbers are invariable by following the dynamics of Grover's search algorithm; (ii) the dynamics of Grover's search algorithm is almost "filled" by the fully entangled states.

arXiv:1210.3418•Oct 12, 2012•3 citations
We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by applying single Oracle operation, employed in Grover's search algorithm by means of the separable degree and the entanglement measure. Then we give the quantitative and qualitative descriptions of the entanglement dynamics in Grover's search algorithm. Our results show that for most instances (i) the separable degrees of these states and ranges of their maximum Schmidt numbers are invariable by following the dynamics of Grover's search algorithm; (ii) the dynamics of Grover's search algorithm is almost "filled" by the fully entangled states.