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

Theoretical Computer Science

Entangling and disentangling in Grover's search algorithm

Minghua Pan, Daowen Qiu, Paulo Mateus, Jozef Gruska

Published Oct 18, 2018• 13 citations
Publisher
DOI
10.1016/j.tcs.2018.10.001

Related papers

Entanglement in the Grover search algorithm

Yiyuan Fang, Dagomir Kaszlikowski, Chunming Chin +3 more

Physics Letters A•Jul 23, 2005•23 citations

Multipartite entanglement in Grover’s search algorithm

Ri Qu, Bing-jian Shang, Yan-ru Bao +3 more

Natural Computing•Jan 8, 2015•7 citations

Entropy of a needle in a haystack

Yiyuan Fang, L. C. Kwek, Keng Wah Choo +2 more

In a quantum search algorithm, the initial state which is a linear superposition of all possible basis states is a separable state. At each iteration, the state becomes more and more entangled until eventually it disentangles and reverts to a separable state consisting of the marked state. It is therefore interesting to study how entanglement changes in a Grover search algorithm.

Laser Physics•Feb 1, 2006•1 citation

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

Grover Search and its Applications

Byung-Soo Choi

•Jun 1, 2011•0 citations

Decoherence in Grover search algorithm

Yuan Sun

Quantum Information Processing•May 13, 2024•11 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.