Despite the fundamental importance of quantum entanglement in many-body systems, our understanding is mostly limited to bipartite situations. Indeed, even defining appropriate notions of multipartite entanglement is a significant challenge for general quantum systems. In this work, we initiate the study of multipartite entanglement in a rich, yet tractable class of quantum states called stabilizer tensor networks. We demonstrate that, for generic stabilizer tensor networks, the geometry of the tensor network informs the multipartite entanglement structure of the state. In particular, we show that the average number of Greenberger-Horne-Zeilinger (GHZ) triples that can be extracted from a stabilizer tensor network is small, implying that tripartite entanglement is scarce. This, in turn, restricts the higher-partite entanglement structure of the states. Recent research in quantum gravity found that stabilizer tensor networks reproduce important structural features of the AdS/CFT correspondence, including the Ryu-Takayanagi formula for the entanglement entropy and certain quantum error correction properties. Our results imply a new operational interpretation of the monogamy of the Ryu-Takayanagi mutual information and an entropic diagnostic for higher-partite entanglement. Our technical contributions include a spin model for evaluating the average GHZ content of stabilizer tensor networks, as well as a novel formula for the third moment of random stabilizer states, which we expect to find further applications in quantum information.
The stabilizer group of an n-qubit state ψis the set of all matrices of the form g=g_1\otimes\cdots\otimes g_n, with g_1,...,g_n being any 2x2 invertible complex matrices, that satisfy gψ=ψ. We show that for 5 or more qubits, except for a set of states of zero measure, the stabilizer group of multipartite entangled states is trivial; that is, containing only the identity element. We use this result to show that for 5 or more qubits, the action of deterministic local operations and classical communication (LOCC) can almost always be simulated simply by local unitary (LU) operations. This proves…
Bell inequality with self-testing property has played an important role in quantum information field with both fundamental and practical applications. However, it is generally challenging to find Bell inequalities with self-testing property for multipartite states and actually there are not many known candidates. In this work, we propose a systematical framework to construct Bell inequalities from stabilizers which are maximally violated by general stabilizer states, with two observables for each local party. We show that the constructed Bell inequalities can self-test any stabilizer state whi…
We discover a simple factorization law describing how multipartite entanglement of a composite quantum system evolves when one of the subsystems undergoes an arbitrary physical process. This multipartite entanglement decay is determined uniquely by a single factor we call the entanglement resilient factor (ERF). Since the ERF is a function of the quantum channel alone, we find that multipartite entanglement evolves in exactly the same way as bipartite (two qudits) entanglement. For the two qubits case, our factorization law reduces to the main result of Nature Physics 4, 99 (2008). In addition…
A resonating valence bond (RVB) state of a lattice of quantum systems is a potential resource for quantum computing and communicating devices. It is a superposition of singlet, i.e., dimer, coverings - often restricted to nearest-neighbour ones - of the lattice. We develop a polynomial representation of multipartite quantum states to prove that RVB states on ladder lattices possess genuine multipartite entanglement. The multipartite entanglement of doped RVB states and RVB states that are superposed with varying weights for singlet coverings of ladder lattices can both be detected by using thi…
We elaborate the concept of entanglement for multipartite system with bosonic and fermionic constituents and its generalization to systems with arbitrary parastatistics. The entanglement is characterized in terms of generalized Segre maps, supplementing thus an algebraic approach to the problem by a more geometric point of view.
We consider universal methods for obtaining (uniform) continuity bounds for characteristics of multipartite quantum systems. We pay a special attention to infinite-dimensional multipartite quantum systems under the energy constraints. By these methods we obtain continuity bounds for several important characteristics of a multipartite quantum state: the quantum (conditional) mutual information, the squashed entanglement, the c-squashed entanglement and the conditional entanglement of mutual information. The continuity bounds for the multipartite quantum mutual information are asymptotically tig…
We refine recent local unitary entanglement classification for symmetric pure states of $n$ qubits (that is, states invariant under permutations of qubits) using local unitary stabilizer subgroups and Majorana configurations. Stabilizer subgroups carry more entanglement distinguishing power than do the stabilizer subalgebras used in our previous work. We extend to mixed states recent results about local operations on pure symmetric states by showing that if two symmetric density operators are equivalent by a local unitary operation, then they are equivalent via a local unitary operation that i…
Genuinely entangled subspaces are a class of subspaces in the multipartite Hilbert spaces that are composed of only genuinely entangled states. They are thus an interesting object of study in the context of multipartite entanglement. Here we provide a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) in the sense that any mixed state supported on them has non-positive partial transpose across any bipartition. Our construction originates from the stabilizer formalism known for its use in quantum error correction. To …
We propose a unified mathematical scheme, based on a classical tensor isomorphism, for characterizing entanglement that works for pure states of multipartite systems of any number of particles. The degree of entanglement is indicated by a set of absolute values of the determinants for each subspace of the multipartite systems. Unlike other schemes, our scheme provides indication of the degrees of entanglement when the qubits are measured or lost successively, and leads naturally to the necessary and sufficient conditions for multipartite pure states to be separable. For systems with a large nu…
We introduce a new information-theoretic measure of multipartite quantum/classical correlations $Δ_P$, by generalizing the entanglement of purification to multipartite states. We provide proofs of its various properties, focusing on several entropic inequalities, in generic quantum systems. In particular, it turns out that the multipartite entanglement of purification gives an upper bound on multipartite mutual information, which is a generalization of quantum mutual information in the spirit of relative entropy. After that, motivated by a tensor network description of the AdS/CFT corresponden…
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.
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…
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.
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.
Asymptotic Entanglement Hiding under Stabilizer Restrictions
School of Computer Science and Technology, University of Science and Technology of China（中国科学技术大学计算机科学与技术学院）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）；School of Software Engineering, University of Science and Technology of China（中国科学技术大学软件工程学院）；Suzhou Institute for Advanced Research, University of Science and Technology of China（中国科学技术大学苏州高等研究院）
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.
In this paper, we show how to construct non-binary entanglement-assisted stabilizer quantum codes by using pre-shared entanglement between the sender and receiver. We also give an algorithm to determine the circuit for non-binary entanglement-assisted stabilizer quantum codes and some illustrated examples. The codes we constructed do not require the dual-containing constraint, and many non-binary classical codes, like non-binary LDPC codes, which do not satisfy the condition, can be used to construct non-binary entanglement-assisted stabilizer quantum codes.
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.
Sperner state and multipartite entanglement signals
School of Physical Sciences, University of Chinese Academy of Sciences（中国科学院大学物理科学学院）；Kavli Institute for Theoretical Sciences, University of Chinese Academy of Sciences（中国科学院大学理论科学研究所）
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…
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…
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…
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.
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 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.
Entanglement of formation is a fundamental measure that quantifies the entanglement of bipartite quantum states. This measure has recently been extended into multipartite states taking the name $α$-entanglement of formation. In this work, we follow an analogous multipartite extension for the Gaussian version of entanglement of formation, and focusing on the the finest partition of a multipartite Gaussian state we show this measure is fully additive and computable for 3-mode Gaussian states.
