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

arXiv:1007.4179 · Physical Review A

Multipartite entanglement in quantum algorithms

Dagmar Bruß, Chiara Macchiavello

Published May 17, 2011• 98 citations
arXivHTMLPDF

Abstract

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyze the multipartite entanglement properties in the Deutsch-Jozsa, Grover, and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
DOI
10.1103/physreva.83.052313

Related papers

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•4 citations

Quantum entanglement in n-qubit real equally weighted states

Ri Qu, Yan-ru Bao

The n-qubit real equally weighted states are employed in some quantum algorithms including Deutsch-Jozsa, Grover, Simon, and so on. We qualitatively investigate the entanglement properties of n-qubit real equally weighted states. Firstly, all of the n-qubit real equally weighted states are classified into 7 parts by means of their structural degrees. Then we analyze the multipartite entanglement features of the states in every part by means of separable and similar degrees.

arXiv:1207.2518•Jul 11, 2012•11 citations

Coherence Depletion in Quantum Algorithms

Ye-Chao Liu, Jiangwei Shang, Xiangdong Zhang

Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover's algorithm, Deutsch-Jozsa algorithm, and Shor's algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future.

arXiv:1808.02222•Entropy•Mar 7, 2019•22 citations

Multipartite entanglement measures: A review

Mengru Ma, Yinfei Li, Jiangwei Shang

Quantum entanglement, a fundamental aspect of quantum mechanics, has captured significant attention in the era of quantum information science. In multipartite quantum systems, entanglement plays a crucial role in facilitating various quantum information processing tasks, such as quantum teleportation and dense coding. In this article, we review the theory of multipartite entanglement measures, with a particular focus on the genuine as well as the operational meaning of multipartite entanglement measures. By providing a thorough and valuable insight on this field, we hope that this review would inspire and guide researchers in their endeavors to further develop novel approaches for characterizing multipartite entanglement.

arXiv:2309.09459•Fundamental Research•Jun 19, 2024•56 citations

Essentiality of Entanglement in a Quantum Algorithm

Ashutosh Goswami, Prasanta Kumar Panigrahi

Quantum algorithms utilize quantum parallelism or quantum coherence to solve certain problems more efficiently than the classical algorithms. Whether quantum entanglement is useful or not for quantum computation is a question of debate. Here, we present a new quantum algorithm, where entanglement is required to gain advantage over classical algorithms.

•Jun 28, 2017•1 citation

Quantum advantage and noise reduction in distributed quantum computing

J. E. Avron, Ofer Casper, Ilan Rozen

Distributed quantum computing can provide substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of a Grover search. This motivates study of the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithms. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from $O(n)$ to $O({n}^{2})$, where $n={log}_{2}(N)$. The distributed Deutsch-Jozsa algorithm deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.

arXiv:2104.07817•Physical Review A•Nov 5, 2021•55 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.
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover's algorithm, Deutsch-Jozsa algorithm, and Shor's algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future.
Quantum entanglement, a fundamental aspect of quantum mechanics, has captured significant attention in the era of quantum information science. In multipartite quantum systems, entanglement plays a crucial role in facilitating various quantum information processing tasks, such as quantum teleportation and dense coding. In this article, we review the theory of multipartite entanglement measures, with a particular focus on the genuine as well as the operational meaning of multipartite entanglement measures. By providing a thorough and valuable insight on this field, we hope that this review would inspire and guide researchers in their endeavors to further develop novel approaches for characterizing multipartite entanglement.
Distributed quantum computing can provide substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of a Grover search. This motivates study of the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithms. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n)O(n)O(n) to O(n2)O({n}^{2})O(n2), where n=log2(N)n={log}_{2}(N)n=log2​(N). The distributed Deutsch-Jozsa algorithm deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.