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

International Conference on Natural Computation (ICNC)

Multipartite entanglement in adiabatic quantum searching algorithm

Wen Jiayan, Cao Wei

Published May 1, 2012• 2 citations
Publisher

Abstract

To explore the role of multipartite entanglement in Grover's algorithm, we generalized the Meyer-Wallach measure to include all possible bipartitions of the system, and use this generalized measure as the quantify of multipartite entanglement. It is shown that along with the bipartite entanglement during the process of adiabatic quantum search algorithm, multipartite entanglement also exists and evolution with the system. Moreover, similar scaling behaviors show both in bipartite and multipartite case.

DOI
10.1109/icnc.2012.6234553

Related papers

Coherence and Entanglement Monogamy in the Discrete Analogue of Analog Grover Search

Namit Anand, Arun Kumar Pati

Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the $\textit{analog analogue of Grover search algorithm}$. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a $n$-party monogamy inequality for arbitrary times, hence bounding the amount of $n$-qubit entanglement during the quantum search.

arXiv:1611.04542•Nov 14, 2016•53 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•4 citations

Genuine multipartite entanglement in quantum optimization

Gopal Chandra Santra, Sudipto Singha Roy, Daniel J. Egger +1 more

The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in the context of solving complicated optimization problems using quantum devices. It is thus crucial from both the algorithmic and hardware standpoints to understand whether multipartite entanglement contributes to achieving a good solution. Here we tackle this challenge by analyzing genuine multipartite entanglement---quantified by the generalized geometric measure---generated in Trotterized quantum annealing and the quantum approximate optimization algorithm. Using numerical benchmarks, we analyze its occurrence in the annealing schedule in detail. We observe a multipartite-entanglement barrier, and we explore how it correlates to the algorithm's success. We also prove how multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution. Vice versa, the overlaps to the initial and final product states, which can be easily measured experimentally, offer upper bounds for the multipartite entanglement during the entire schedule. Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.

arXiv:2411.08119•Physical Review A•Feb 20, 2025•15 citations

Scale invariance of entanglement dynamics in Grover's quantum search algorithm

Matteo A. C. Rossi, Dagmar Bruß, Chiara Macchiavello

We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present. Remarkably, the dynamics of any type of entanglement as well as of genuine multipartite entanglement is independent of the number $n$ of qubits for large $n$, thus exhibiting a scale invariance property. We compare this result with the entanglement dynamics induced by a fixed-point quantum search algorithm. We also investigate criteria for efficient simulatability in the context of Grover's algorithm.

arXiv:1205.3000•Physical Review A•Feb 21, 2013•38 citations

Entanglement Monotones and Measures: An Overview

Volkan Erol

Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor’s factorization algorithm, Grover’s search algorithm, quantum Fourrier transformation, etc. [1]. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can measure the amount of entanglement of multilateral systems, has not yet been found. However, since it must be used in many information processing tasks, the production and processing of multilateral quantum entangled systems is at the top of the hot topics of recent years [5-11]. Much of the work in the basic quantum technologies, such as quantum cryptography, communications, and computers, requires multi-partite entangled systems such as GHZ, W [22,30]. It can be suggested that the quantum entanglement criteria reflects the different properties of the systems. Many recent research has been done in entanglement and its related disciplines like entanglement measures and majorization, etc. [62-71]. In this work, we make an overview of recent research on the topic entanglement monotones/measures with an analitical approach.

arXiv:1704.05058•Apr 17, 2017•6 citations

Evolution of Entanglement in Groverian Search Algorithm: n-qudit System

Arti Chamoli, Chandra Mohan Bhandari

Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm has been obtained for qutrit systems with real coefficients and the calculated results agree well with the conventional entropy based measure. The entanglement measure is further generalised for qudit (d-level) systems with real coefficients.

arXiv:quant-ph/0702222•Feb 24, 2007•1 citation
To explore the role of multipartite entanglement in Grover's algorithm, we generalized the Meyer-Wallach measure to include all possible bipartitions of the system, and use this generalized measure as the quantify of multipartite entanglement. It is shown that along with the bipartite entanglement during the process of adiabatic quantum search algorithm, multipartite entanglement also exists and evolution with the system. Moreover, similar scaling behaviors show both in bipartite and multipartite case.
Grover's search algorithm is the optimal quantum algorithm that can search an unstructured database quadratically faster than any known classical algorithm. The role of entanglement and correlations in the search algorithm have been studied in great detail and it is known that entanglement between the qubits is necessary to gain a quadratic speedup, for pure state implementation of the Grover search algorithm. Here, we systematically investigate the behavior of quantum coherence and monogamy of entanglement in the discrete analogue of the analog analogue of Grover search algorithm\textit{analog analogue of Grover search algorithm}analog analogue of Grover search algorithm. The analog analogue of Grover search is a continuous time quantum algorithm based on the adiabatic Hamiltonian evolution that gives a quadratic speedup, similar to the original Grover search algorithm. We show that the decrease of quantum coherence, quantified using various coherence monotones, is a clear signature of attaining the maximum success probability in the analog Grover search. We also show that for any two qubit reduced density matrix of the system, the concurrence evolves in close vicinity to the increasing rate of success probability. Furthermore, we show that the system satisfies a nnn-party monogamy inequality for arbitrary times, hence bounding the amount of nnn-qubit entanglement during the quantum search.
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.
The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in the context of solving complicated optimization problems using quantum devices. It is thus crucial from both the algorithmic and hardware standpoints to understand whether multipartite entanglement contributes to achieving a good solution. Here we tackle this challenge by analyzing genuine multipartite entanglement---quantified by the generalized geometric measure---generated in Trotterized quantum annealing and the quantum approximate optimization algorithm. Using numerical benchmarks, we analyze its occurrence in the annealing schedule in detail. We observe a multipartite-entanglement barrier, and we explore how it correlates to the algorithm's success. We also prove how multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution. Vice versa, the overlaps to the initial and final product states, which can be easily measured experimentally, offer upper bounds for the multipartite entanglement during the entire schedule. Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.
We calculate the amount of entanglement of the multiqubit quantum states employed in the Grover algorithm, by following its dynamics at each step of the computation. We show that genuine multipartite entanglement is always present. Remarkably, the dynamics of any type of entanglement as well as of genuine multipartite entanglement is independent of the number nnn of qubits for large nnn, thus exhibiting a scale invariance property. We compare this result with the entanglement dynamics induced by a fixed-point quantum search algorithm. We also investigate criteria for efficient simulatability in the context of Grover's algorithm.
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor’s factorization algorithm, Grover’s search algorithm, quantum Fourrier transformation, etc. [1]. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can measure the amount of entanglement of multilateral systems, has not yet been found. However, since it must be used in many information processing tasks, the production and processing of multilateral quantum entangled systems is at the top of the hot topics of recent years [5-11]. Much of the work in the basic quantum technologies, such as quantum cryptography, communications, and computers, requires multi-partite entangled systems such as GHZ, W [22,30]. It can be suggested that the quantum entanglement criteria reflects the different properties of the systems. Many recent research has been done in entanglement and its related disciplines like entanglement measures and majorization, etc. [62-71]. In this work, we make an overview of recent research on the topic entanglement monotones/measures with an analitical approach.