Multipartite Pure States Research Articles

Coherence measures based on coherence eigenvalue and their applications

The quantification of coherence is central in quantum information theory and far from being fully understood, particularly for multipartite quantum states. In this work, we first propose the coherence eigenvalue for multipartite pure quantum states and then define the coherence measure for a given multipartite pure or mixed state based on it. It is found that the convex roof coherence measure is equal to the geometric measure based on fidelity. This finding allows us to give an alternative way to prove that the geometric measure of coherence is monotone under selective measurements on average. The other two new coherence measures based on coherence eigenvalue are presented, and their properties are also investigated. As an application, the bounds of several well-known coherence measures are derived by using of coherence eigenvalue. In particular, by proposing a new coherence witness which is related to coherence eigenvalue, we obtain a bound to robustness of coherence and give it a corresponding geometric interpretation.

Distillation of Greenberger–Horne–Zeilinger States by Combinatorial Methods

We prove a lower bound on the rate of Greenberger-Horne-Zeilinger states distillable from pure multipartite states by local operations and classical communication (LOCC). Our proof is based on a modification of a combinatorial argument used in the fast matrix multiplication algorithm of Coppersmith and Winograd. Previous use of methods from algebraic complexity in quantum information theory concerned transformations with stochastic local operations and classical operation (SLOCC), resulting in an asymptotically vanishing success probability. In contrast, our new protocol works with asymptotically vanishing error.

Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement

The purpose of this paper is to study the problem of computing unitary eigenvalues (U-eigenvalues) of non-symmetric complex tensors. By means of symmetric embedding of complex tensors, the relationship between U-eigenpairs of a non-symmetric complex tensor and unitary symmetric eigenpairs (US-eigenpairs) of its symmetric embedding tensor is established. An algorithm (Algorithm \ref{algo:1}) is given to compute the U-eigenvalues of non-symmetric complex tensors by means of symmetric embedding. Another algorithm, Algorithm \ref{algo:2}, is proposed to directly compute the U-eigenvalues of non-symmetric complex tensors, without the aid of symmetric embedding. Finally, a tensor version of the well-known Gauss-Seidel method is developed. Efficiency of these three algorithms are compared by means of various numerical examples. These algorithms are applied to compute the geometric measure of entanglement of quantum multipartite non-symmetric pure states.

Multipartite states under elementary local operations

Multipartite pure states are equivalent under Stochastic Local Operations and Classical Communication (SLOCC) whenever they can be mapped into one another by Invertible Local Operations. It is shown that this is equivalent to the inter-convertibility through finite sequences of Elementary Local Operations. A multipartite version of the Gauss-Jordan elimination strategy is then obtained, enabling the analytical SLOCC-classification of previously unknown examples. It is argued that the problem of SLOCC-classification is equivalent to the problem of classifying the Multipartite Fully Reduced Forms that the coefficient matrix of a state can assume after being subjected to this Gauss-Jordan elimination procedure. The method is applied to examples of so-called LME and hypergraph states, showing new SLOCC-equivalences. Moreover, possible physical implications for states with a Dicke-like structure are sketched.

The Asymptotic Spectrum of LOCC Transformations

We study the exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in the success probability, known as the converse error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterization of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [1] , where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent, the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case, we prove that this bound holds with equality.

Inequivalent multipartite coherence classes and two operational coherence monotones

Quantum coherence has received significant attention in recent years, but its study is mostly conducted in single party settings. In this paper, we generalize important results in multipartite entanglement theory to their counterparts in quantum coherence theory. First, we give a necessary and sufficient condition for when two pure multipartite states are equivalent under local quantum incoherent operations and classical communication (LICC), i.e., two states can be deterministically transformed to each other under LICC operations. Next, we investigate and give the conditions in which such a transformation succeeds only stochastically. Different from entanglement case for two-qubit states, we find that the SLICC equivalence classes are infinite. Moreover, it's possible that there are some classes of states in multipartite entanglement can convert into each other, while, they cannot convert into each other in multipartite coherence. In order to show the difference among SLICC classes, we introduce two coherence monotones: accessible coherence and source coherence, following the logistics given in [\emph{Phys.~Rev.~Lett. 115,~150502 (2015)}]. These coherence monotones have a straightforward operational interpretation, namely, the accessible coherence characterizes the proficiency of a state to generate other states via quantum incoherent operations, while the source coherence characterizes the set of states that can be reached via quantum incoherent operations acting on the given state of interest.

Polygamy relations of multipartite entanglement beyond qubits

We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the th power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the th () power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.

Device-Independent Detection of Genuine Multipartite Entanglement for All Pure States.

We show that genuine multipartite entanglement of all multipartite pure states in arbitrary finite dimension can be detected in a device-independent way by employing bipartite Bell inequalities on states that are deterministically generated from the initial state via local operations. This leads to an efficient scheme for large classes of multipartite states that are relevant in quantum computation or condensed-matter physics, including cluster states and the ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) model. For cluster states the detection of genuine multipartite entanglement involves only measurements on a constant number of systems with an overhead that scales linearly with the system size, while for the AKLT model the overhead is polynomial. In all cases our approach shows some robustness against experimental imperfections.

Entanglement robustness against particle loss in multiqubit systems

When some of the parties of a multipartite entangled pure state are lost, the question arises whether the residual mixed state is also entangled, in which case the initial entangled pure state is said to be robust against particle loss. In this paper, we investigate this entanglement robustness for $N$-qubit pure states. We identify exhaustively all entangled states that are fragile, i.e., not robust, with respect to the loss of any single qubit of the system. We also study the entanglement robustness properties of symmetric states and put these properties in the perspective of the classification of states with respect to stochastic local operations assisted with classic communication (SLOCC classification).

Quantum secret sharing and Mermin operator

Quantum secret sharing is well known as a method for players to share a classical secret for secret sharing in quantum mechanical ways. Most of the results associated with quantum secret sharing are based on pure multipartite entangled states. In reality, however, it is difficult for players to share a pure entangled state, although they can share a state close to the state. Thus, it is necessary to study how to perform the quantum secret sharing based on a general multipartite state. We here present a quantum secret sharing protocol on an $N$-qubit state close to a pure $N$-qubit Greenberger-Horne-Zeilinger state. In our protocol, $N$ players use an inequality derived from the Mermin inequality to check secure correlation of classical key bits for secret sharing. We show that if our inequality holds then every legitimate player can have key bits with positive key rate. Therefore, for sufficiently many copies of the state, the players can securely share a classical secret with high probability by means of our protocol.

Several nonlocal sets of multipartite pure orthogonal product states

It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bases with the property that if such a basis is given then no state can be eliminated from that basis by performing orthogonality-preserving measurements. On the other hand, an uncompletable set of the present kind contains several Shifts unextendible product bases (UPBs) that belong to qubit subspaces. Identifying these subspace UPBs, it is possible to obtain a class of high-dimensional multipartite bound entangled states. Finally, it is shown that a two-qubit maximally entangled Bell state shared between any two parties is sufficient as a resource to distinguish the states of any completable set (of the above kind) perfectly by LOCC. This constitutes an example where the amount of entanglement, sufficient to accomplish the aforesaid task, depends neither on the dimension of the individual subsystems nor on the number of parties.

Closing the detection loophole in multipartite Bell experiments with a limited number of efficient detectors

The problem of closing the detection loophole in Bell tests is investigated in the presence of a limited number of efficient detectors using emblematic multipartite quantum states. To this end, a family of multipartite Bell inequalities is introduced basing on local projective measurements conducted by $N-k$ parties and applying a $k$-party Bell inequality on the remaining parties. Surprisingly, we find that most of the studied pure multipartite states involving e.g. cluster states, the Dicke states, and the Greenberger-Horne-Zeilinger states can violate our inequalities with only the use of two efficient detectors, whereas the remaining detectors may have arbitrary small efficiencies. We believe that our inequalities are useful in Bell experiments and device-independent applications if only a small number of highly efficient detectors are in our disposal.

Transformations among Pure Multipartite Entangled States via Local Operations are Almost Never Possible

Local operations assisted by classical communication (LOCC) constitute the free operations in entanglement theory. Hence, the determination of LOCC transformations is crucial for the understanding of entanglement. We characterize here almost all LOCC transformations among pure multipartite multilevel states. Combined with the analogous results for qubit states shown by Gour \emph{et al.} [J. Math. Phys. 58, 092204 (2017)], this gives a characterization of almost all local transformations among multipartite pure states. We show that nontrivial LOCC transformations among generic, fully entangled, pure states are almost never possible. Thus, almost all multipartite states are isolated. They can neither be deterministically obtained from local-unitary-inequivalent (LU-inequivalent) states via local operations, nor can they be deterministically transformed to pure, fully entangled LU-inequivalent states. In order to derive this result, we prove a more general statement, namely, that, generically, a state possesses no nontrivial local symmetry. We discuss further consequences of this result for the characterization of optimal, probabilistic single copy and probabilistic multi-copy LOCC transformations and the characterization of LU-equivalence classes of multipartite pure states.

Geometric measures of entanglement in multipartite pure states via complex-valued neural networks

Abstract The geometric measure of entanglement of a multipartite pure state is defined it terms of its geometric distance from the set of separable pure states. The quantum eigenvalue problem is derived to compute the separable pure state nearest to the given multipartite pure state. Computing the modulus largest quantum eigenvalue for a multipartite pure state is equivalent to finding the best complex rank-one approximation of the complex unit tensors, associated with the multipartite pure states. This paper is devoted to present a complex-valued neural networks approach for the computation of the quantum eigenvalue problem for multipartite pure states. We design the neural networks for computing the best rank-one tensor approximation of complex tensors, and prove that the solution of the networks is locally asymptotically stable in the sense of Lyapunov stability theory. This solution also converges to the local optimal solutions of the best complex rank-one tensor approximation. We illustrate our theoretical results via numerical simulations.

Entanglement and quantum combinatorial designs

We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous classes of designs. We show that mutually orthogonal quantum Latin arrangements can be entangled in the same way than quantum states are entangled. Furthermore, we show that such designs naturally define a remarkable class of genuinely multipartite highly entangled states called $k$-uniform, i.e. multipartite pure states such that every reduction to $k$ parties is maximally mixed. We derive infinitely many classes of mutually orthogonal quantum Latin arrangements and quantum orthogonal arrays having an arbitrary large number of columns. The corresponding multipartite $k$-uniform states exhibit a high persistency of entanglement, which makes them ideal candidates to develop multipartite quantum information protocols.

Small violations of Bell inequalities for multipartite pure random states

For any finite number of parts, measurements, and outcomes in a Bell scenario, we estimate the probability of random N-qudit pure states to substantially violate any Bell inequality with uniformly bounded coefficients. We prove that under some conditions on the local dimension, the probability to find any significant amount of violation goes to zero exponentially fast as the number of parts goes to infinity. In addition, we also prove that if the number of parts is at least 3, this probability also goes to zero as the local Hilbert space dimension goes to infinity.

Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity

A pure multipartite quantum state is called absolutely maximally entangled (AME), if all reductions obtained by tracing out at least half of its parties are maximally mixed. Maximal entanglement is then present across every bipartition. The existence of such states is in many cases unclear. With the help of the weight enumerator machinery known from quantum error correction and the shadow inequalities, we obtain new bounds on the existence of AME states in dimensions larger than two. To complete the treatment on the weight enumerator machinery, the quantum MacWilliams identity is derived in the Bloch representation. Finally, we consider AME states whose subsystems have different local dimensions, and present an example for a system that shows maximal entanglement across every bipartition.

Multipartite monogamous relations for entanglement and discord

The distribution of quantum correlations in multipartite systems play a significant role in several aspects of the quantum information theory. While it is well known that these quantum correlations can not be freely distributed, the way that it is shared in multipartite system is an open problem even for small set of qubits. Based on new monogamylike relations between entanglement and discord for $n$-partite systems, we show how these correlations are distributed in general, determining distinct equalities and inequalities to the quantum discord and the entanglement of formation for arbitrary multipartite pure states.

Exact stabilization of entangled states in finite time by dissipative quantum circuits

Open quantum systems evolving according to discrete-time dynamics are capable, unlike continuous-time counterparts, to converge to a stable equilibrium in finite time with zero error. We consider dissipative quantum circuits consisting of sequences of quantum channels subject to specified quasi-locality constraints, and determine conditions under which stabilization of a pure multipartite entangled state of interest may be exactly achieved in finite time. Special emphasis is devoted to characterizing scenarios where finite-time stabilization may be achieved robustly with respect to the order of the applied quantum maps, as suitable for unsupervised control architectures. We show that if a decomposition of the physical Hilbert space into virtual subsystems is found, which is compatible with the locality constraint and relative to which the target state factorizes, then robust stabilization may be achieved by independently cooling each component. We further show that if the same condition holds for a scalable class of pure states, a continuous-time quasi-local Markov semigroup ensuring rapid mixing can be obtained. Somewhat surprisingly, we find that the commutativity of the canonical parent Hamiltonian one may associate to the target state does not directly relate to its finite-time stabilizability properties, although in all cases where we can guarantee robust stabilization, a (possibly non-canonical) commuting parent Hamiltonian may be found. Beside graph states, quantum states amenable to finite-time robust stabilization include a class of universal resource states displaying two-dimensional symmetry-protected topological order, along with tensor network states obtained by generalizing a construction due to Bravyi and Vyalyi. Extensions to representative classes of mixed graph-product and thermal states are also discussed.

Multipartite entanglement accumulation in quantum states: Localizable generalized geometric measure

Multiparty quantum states are useful for a variety of quantum information and computation protocols. We define a multiparty entanglement measure based on local measurements on a multiparty quantum state, and an entanglement measure averaged on the post-measurement ensemble. Using the generalized geometric measure as the measure of multipartite entanglement for the ensemble, we demonstrate, in the case of several well-known classes of multipartite pure states, that the localized multipartite entanglement can exceed the entanglement present in the original state. We also show that measurement over multiple parties may be beneficial in enhancing localizable multipartite entanglement. We point out that localizable generalized geometric measure faithfully signals quantum critical phenomena in well-known quantum spin models even when considerable finite-size effect is present in the system.