Geometric measure of entanglement and applications to bipartite and multipartite quantum states
Tzu-Chieh Wei, Paul M. Goldbart
备注：
13 pages, 11 figures, this is a combination of three previous manuscripts (quant-ph/0212030, quant-ph/0303079, and quant-ph/0303158) made more extensive and coherent. To appear in PRA
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings (see Shimony 1995 and Barnum and Linden 2001), is explored for bipartite and multipartite pure and mixed states. The measure is determined analytically for arbitrary two-qubit mixed states and for generalized Werner and isotropic states, and is also applied to certain multipartite mixed states. In particular, a detailed analysis is given for arbitrary mixtures of three-qubit GHZ, W and inverted-W states. Along the way, we point out connections of the geometric measure of entanglement with entanglement witnesses and with the Hartree approximation method.
The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.
Monogamy of bipartite correlations leads, for arbitrary pure multi-qubit states, to simple conditions able to indicate various types of multipartite entanglement by being capable to exclude the possibility of k-separability.
We investigate the generation of multipartite entangled SU(k+1) coherent states using a quantum network involving a sequence of k beam splitters. We particularly investigate the entanglement in multipartite SU(2) coherent states (k = 1). We employ the concurrence as measure of the degree of bipartite entanglement.
A group of symmetric operators are introduced to carry out the separability criterion for bipartite and multipartite quantum states. Every symmetric operator, represented by a symmetric matrix with only two nonzero elements, and their arbitrary linear combinations are found to be entanglement witnesses. By using these symmetric operators, Wootters' separability criterion for two-qubit states can be generalized to bipartite and multipartite systems in arbitrary dimensions.
A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but since then only a few other cases have been solved. We solve all remaining bipartite cases, as well as a large family of multipartite cases.
The Schmidt number is a fundamental parameter characterizing the properties of quantum states, and the local projections are a fundamental operation in quantum physics. We investigate the relation between the Schmidt numbers of bipartite states and their projected states. We show that there exist bipartite positive-partial-transpose (PPT) entangled states of any given Schmidt number. We further construct the notion of joint Schmidt number for multipartite states, and its relation with the Schmidt number of bipartite reduced density operators.
Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite entangled states by local operations and classical communication (LOCC), and in this sense, any distributed process based on shared multipartite entanglement and LOCC is simulatable by using only bipartite entangled states and LOCC. We show here that this reduction scenario does not hold when there exists a limitation on the size of the local quantum system of each…
In this work we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for quantifying potential quantum resources. The simplicity and symmetry in the definition facilitates its computation for various multipartite entangled states including the GHZ states and the $W$ states. With explicit examples we show that our measure results in distinct entanglement orderings from other measures, and can detect differences in certain types of genuine…
Entanglement in the symmetric subspace: mapping multipartite to bipartite states
Istituto Nazionale di Ottica - Consiglio Nazionale delle Ricerche (INO-CNR)（意大利国家光学研究所-意大利国家研究委员会）；University of Tsukuba（筑波大学）；Center for Artificial Intelligence Research (C-AIR)（人工智能研究中心）；LENS（欧洲纳米科学实验室）
Any bipartite entanglement witness $W$ can be written as $W=c_σI-σ$, where $σ$ is a quantum state, $I$ is the identity matrix, and $c_σ$ is a non-negative number. We present a general method to extend the given entanglement witness to multipartite cases via purification, partial purification, and direct tensor of the quantum state $σ$. Our methods extend $σ$ but leave the parameter $c_σ$ untouched. This is very valuable since the parameter is generally not easy to compute.
Construction of genuinely entangled multipartite subspaces with certain characteristics has become a relevant task in various branches of quantum information. Here we show that such subspaces can be obtained from an arbitrary collection of bipartite entangled subspaces under joining of their adjacent subsystems. In addition, it is shown that direct sums of such constructions under certain conditions are genuinely entangled. These facts are then used in detecting entanglement of tensor products of mixed states and constructing subspaces that are distillable across every bipartite cut, where for…
We discuss the monotonicity under local operations and classical communication (LOCC) of systematically constructed quantities aiming at quantification of entanglement properties of multipartite quantum systems. The so-called generalized multipartite concurrences can qualify as legitimate entanglement measures if they are monotonous under LOCC. In the paper we give a necessary and sufficient criterion for their monotonicity.
We investigate genuine multipartite entanglement in general multipartite systems. Based on the norms of the correlation tensors of a multipartite state under various partitions, we present an analytical sufficient criterion for detecting the genuine four-partite entanglement. The results are generalized to arbitrary multipartite systems.
Nonlocality swapping of bipartite binary correlated boxes can be realized by a \emph{coupler} ($χ$) in nonsignaling models. By studying the swapping process we find that the previous bipartite coupler can be applied to the swapping of two multipartite boxes, and then generate a multipartite box with more users than that of any of the boxes before swapping. Here quantum bound still appears in the scheme. The bipartite coupler also can be applied to a hybrid scheme of generating a multipartite extremal box from many PR boxes. As the analogue of multipartite entanglement swapping, we generalize t…
We propose a particular encoding for bipartite entangled states derived from multipartite cluster-type entangled coherent states (CTECSs). We investigate the effects of amplitude damping on the entanglement content of this bipartite state, as well as its usefulness as a quantum channel for teleportation. We find interesting relationships among the amplitude of the coherent states constituting the CTECSs, the number of subsystems forming the logical qubits (redundancy), and the extent to which amplitude damping affects the entanglement of the channel. For instance, in the sense of sudden death …
We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytic upper bound for the concurrence of assistance in bipartite quantum systems, and derive a polygamy inequality of multipartite entanglement in arbitrary dimensional quantum systems.
The problems of genuine multipartite entanglement detection and classification are challenging. We show that a multipartite quantum state is genuine multipartite entangled if the multipartite concurrence is larger than certain quantities given by the number and the dimension of the subsystems. This result also provides a classification of various genuine multipartite entanglement. Then, we present a lower bound of the multipartite concurrence in terms of bipartite concurrences. While various operational approaches are available for providing lower bounds of bipartite concurrences, our results …
In this paper, we investigate a genuine multipartite entanglement measure based on the geometric method. This measure arrives at the maximal value for the absolutely maximally entangled states and has desirable properties for quantifying the genuine multipartite entanglement. We present a lower bound of the genuine multipartite entanglement measure. At last, we present some examples to show that the genuine entanglement measure is with distinct entanglement ordering from other measures, and we also present the advantages of the measure proposed here with other measures.
This is a thesis submitted to university of Pune, India, for the Ph.D. degree. This work deals with entanglement production in two qubit, two qutrit and three qubit systems, entanglement in indistinguishable fermionic systems, quantum discord in a Heisenberg chain and geometric measure of quantum discord in an arbitrary state of a bipartite quantum system.
Monogamy of entanglement is generally discussed using a bipartite entanglement measure as an upper bound. Here we discuss a new kind of monogamous relation where the upper bound is given by a multipartite measure of entanglement, the generalized concurrence. We show a new monogamous equality involving the multipartite concurrence, all the bipartite concurrences and the genuine tripartite entanglement for pure three qubits system. The result extends to mixed states in an inequality involving the generalized concurrence and all the bipartite concurrences. We provide a counter-example showing tha…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
We derive a set of algebraic equations, the so-called multipartite separability eigenvalue equations. Based on their solutions, we introduce a universal method for the construction of multipartite entanglement witnesses. We witness multipartite entanglement of $10^3$ coupled quantum oscillators, by solving our basic equations analytically. This clearly demonstrates the feasibility of our method for studying ultra-high orders of multipartite entanglement in complex quantum systems.
We investigate how the genuine multipartite entanglement is distributed among the components of superposed states. Analytical lower and upper bounds for the usual multipartite negativity and the genuine multipartite entanglement negativity are derived. These bounds are shown to be tight by detailed examples.
We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by deriving a formula relating the weight distribution of the code to the average entanglement of encoded states. Multipartite entangling power of quantum evolutions is also investigated.
We present a protocol in which two or more parties can share multipartite entanglement over noisy quantum channels. The protocol is based on the entanglement purification presented by Shor and Preskill [Phys. Rev. Lett. 85, 441 (2000)] and the quantum teleportation via an isotropic state. We show that a nearly perfect purification implies a nearly perfect sharing of multipartite entanglement between two parties so that the protocol can assure a faithful sharing of multipartite entanglement with Shor and Preskill's proof on the entanglement purification.
PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.
We study the occurrence of multipartite entanglement in spin chains. We show that certain genuine multipartite entangled states, namely W states, can be obtained as ground states of simple XX type ferromagnetic spin chains in a transverse magnetic field, for any number of sites. Moreover, multipartite entanglement is proven to exist even at finite temperatures. A transition from a product state to a multipartite entangled state occurs when decreasing the magnetic field to a critical value. Adiabatic passage through this point can thus lead to the generation of multipartite entanglement.
Multipartite entanglement is of important resources for quantum communication and quantum computation. Our goal in this paper is to characterize general multipartite entangled states according to shallow quantum circuits. We firstly prove any genuinely multipartite entanglement on finite-dimensional spaces can be generated by using 2-layer shallow quantum circuit consisting of two biseparable quantum channels, which the smallest nontrivial circuit depth in the shallow quantum circuit model. We further propose a semi-device-independent entanglement model depending on the local connection abilit…
We study entanglement properties of hypergraph states in arbitrary finite dimension. We compute multipartite entanglement of elementary qudit hypergraph states, namely those endowed with a single maximum-cardinality hyperedge. We show that, analogously to the qubit case, also for arbitrary dimension there exists a lower bound for multipartite entanglement of connected qudit hypergraph states; this is given by the multipartite entanglement of an equal-dimension elementary hypergraph state featuring the same number of qudits as the largest-cardinality hyperedge. We highlight interesting differen…
We study the dynamics of multipartite entanglement under the influence of decoherence. A suitable generalization of concurrence reveals distinct scaling of the entanglement decay rate of GHZ and W states, for various environments.
A crucial issue in quantum communication tasks is characterizing how quantum resources can be quantified and distributed over many parties. Consequently, entanglement has been explored extensively. However, the genuine entanglement still lacks of studying. There are few genuine multipartite entanglement measures and whether it is monogamous is unknown so far. In this work, we explore the complete monogamy of genuine multipartite entanglement measure (GMEM) for which, at first, we investigate a framework for unified/complete GMEM according to the unified/complete multipartite entanglement measu…
In tasks, where multipartite entanglement plays a central role, state purification is, due to inevitable noise, a crucial part of the procedure. We consider a scenario exploiting the multipartite entanglement in a straightforward multipartite purification algorithm and compare it to bipartite purification procedures combined with state teleportation. While complete purification requires an infinite amount of input states in both cases, we show that for an imperfect output fidelity the multipartite procedure exhibits a major advantage in terms of input states used.
We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states endowed with all possible hyperedges of cardinality equal to $n-1$ and for those hypergraph states with all possible hyperedges of cardinality greater than or equal to $n-1$. We then find a lower bound to the multipartite entanglement of a generic quantum hypergraph state. We finally apply the multipartite entanglement results to the construction of…
We generalize the Schmidt-correlated states to multipartite systems. The related equivalence under SLOCC, the separability, entanglement witness, entanglement measures of negativity, concurrence and relative entropy are investigated in detail for the generalized Schmidt-correlated states.
In this paper, we define a cross product operator and construct the cross Bell basis, by use this basis and Bell measurements we give a simple scheme of the teleportation of arbitrary multipartite qubit entanglement.
We introduce an operational interpretation for pure-state global multipartite entanglement based on quantum estimation. We show that the estimation of the strength of low-noise locally depolarizing channels, as quantified by the regularized quantum Fisher information, is directly related to the Meyer-Wallach multipartite entanglement measure. Using channels that depolarize across different partitions, we obtain related multipartite entanglement measures. We show that this measure is the sum of expectation values of local observables on two copies of the state.
Quantum chaotic maps can efficiently generate pseudo-random states carrying almost maximal multipartite entanglement, as characterized by the probability distribution of bipartite entanglement between all possible bipartitions of the system. We show that such multipartite entanglement is robust, in the sense that, when realistic noise is considered, distillable entanglement of bipartitions remains almost maximal up to a noise strength that drops only polynomially with the number of qubits.
We revisit the genuine multipartite entanglement by a simplified method, which only involves the Schmidt decomposition and local unitary transformation. We construct a local unitary equivalent class of the tri-qubit quantum state, then use the trace norm of the whole correlation tensor as a measurement to detect genuine multipartite entanglement. By detailed examples, we show our result can detect more genuinely entangled states. Furthermore, we generalize the genuine multipartite entanglement criterion to tripartite higher-dimensional systems.
We establish a set of resource conversion relationships between quantum coherence and multipartite entanglement in many-body systems, where the operational measures of resource cost and distillation are focused. Under the multipartite incoherent operation, the initial coherence of single-party system bounds the maximal amounts of corresponding operational entanglement in an arbitrary bipartite partition as well as the genuine multipartite entanglement in many-body systems. Furthermore, the converted multipartite entanglement can be transferred to its subsystems and restored to coherence of a s…
The research field of quantum entanglement theory is comparatively new. While a basic understanding of the most simple systems in question (i.e. bipartite systems) has been established over the past few decades, multipartite entanglement still holds many unsolved questions and intriguing riddles. In particular, it is completely unclear how several concepts from the bipartite case can be generalised in a meaningful way to multipartite scenarios. In this work, the main issues of multipartite entanglement detection, characterisation and classification are discussed. The differences and similariti…
Multipartite entanglement constitutes one of the key resources in quantum information processing. We exploit correlation tensor norms to develop a framework for its experimental detection without the need for shared frames of reference. By bounding these norms for partially separable states and states of limited dimension we achieve an extensive characterization of entanglement in multipartite systems in an experimentally feasible way. Furthermore we show that both bi- and multipartite dimensionality of entanglement can be revealed by our methods.
A simple entanglement measure for multipartite pure states is formulated based on the partial entropy of a series of reduced density matrices. Use of the proposed new measure to distinguish disentangled, partially entangled, and maximally entangled multipartite pure states is illustrated.
We derive the lower and upper bounds on the entanglement of a given multipartite superposition state in terms of the entanglement of the states being superposed. The first entanglement measure we use is the geometric measure, and the second is the q-squashed entanglement. These bounds allow us to estimate the amount of the multipartite entanglement of superpositions. We also show that two states of high fidelity to one another do not necessarily have nearly the same q-squashed entanglement.
We investigate how much amount of Greenberger-Horne-Zeilinger (GHZ) entanglement is required in order to prepare a given multipartite state by local operations and classical communication (LOCC).We present a LOCC procedure that asymptotically converts GHZ states into an arbitrary multipartite pure state, whose conversion rate is given by the multipartite discord of the state. This reveals that the GHZ-entanglement cost of preparing a pure state is not higher than the multipartite discord of the state. It also provides an operational interpretation of multipartite discord for pure states, namel…
We propose a method to characterize and quantify multipartite entanglement for pure states. The method hinges upon the study of the probability density function of bipartite entanglement and is tested on an ensemble of qubits in a variety of situations. This characterization is also compared to several measures of multipartite entanglement.
In this paper, we focus on two different kinds of multipartite correlation, $k$-nonseparability and $k$-partite entanglement, both of which can describe the essential characteristics of multipartite entanglement. We propose effective methods to detect $k$-nonseparability and $k$-partite entanglement in terms of quantum Fisher information. We illustrate the significance of our results and show that they identify some $k$-nonseparability and $k$-partite entanglement that cannot be identified by known criteria by several concrete examples.
We construct a measure of entanglement for general pure multipartite states based on Segre variety. We also construct a class of entanglement monotones based on the Plücker coordinate equations of the Grassmann variety. Moreover, we discuss and compare these measures of entanglement.
The local uncertainty relation (LUR) criteria for quantum entanglement, which is dependent on chosen observables, is developed recent. In the paper, applying the uncertainty principle, an entanglement criteria for multipartite Gaussian states is given, which is implemented by a minimum optimization computer program and independent on observalbes.
We introduce an intuitive measure of genuine multipartite entanglement which is based on the well-known concurrence. We show how lower bounds on this measure can be derived that also meet important characteristics of an entanglement measure. These lower bounds are experimentally implementable in a feasible way enabling quantification of multipartite entanglement in a broad variety of cases.
