Bell inequalities for graph states

We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.     

The entanglement of several graph states

We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ??two-colorable?? graphs. to non ??two-colorable?? graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2. is improved to 2.9275, less than the upper bound determined by local operations and classical communication. communication. An upper bound of entanglement is proposed based on the definition of graph state. state.     

Activating distillation with an infinitesimal amount of bound entanglement

We show that bipartite quantum states of any dimension, which do not have a positive partial transpose (NPPT), become 1-distillable when one adds an infinitesimal amount of bound entanglement. To this end we investigate the activation properties of a new class of symmetric bound entangled states of full rank. It is shown that in this set there exist universal activator states capable of activating the distillation of any NPPT state. The result shows that even a small amount of bound entanglement can be useful for quantum information purposes.     

Criticality, the area law, and the computational power of projected entangled pair states

The projected entangled pair state (PEPS) representation of quantum states on two-dimensional lattices induces an entanglement based hierarchy in state space. We show that the lowest levels of this hierarchy exhibit a very rich structure including states with critical and topological properties. We prove, in particular, that coherent versions of thermal states of any local 2D classical spin model correspond to such PEPS, which are in turn ground states of local 2D quantum Hamiltonians. This correspondence maps thermal onto quantum fluctuations, and it allows us to analytically construct critical quantum models exhibiting a strict area law scaling of the entanglement entropy in the face of power law decaying correlations. Moreover, it enables us to show that there exist PEPS which can serve as computational resources for the solution of NP-hard problems.     

构造纠缠目击的一般方法

量子纠缠作为量子通信和量子计算过程中不可缺少的资源,在量子信息领域中有着广泛的应用.如何判定一个给定的量子态是否为纠缠态仍然是一个重要的课题.纠缠目击是一种特殊的自伴算子,它可以用来判断一个量子态是否为纠缠态.本文首先从纠缠目击的定义入手,给出构造纠缠目击的一般方法,证明了当一个可测量A在可分纯态上的最大期望CA严格小于它的最大特征值λ_(max)(A)时,对任何满足条件C_A≤Cλ_(max)(A)的参数C,算子W_C=CI-A都是一个纠缠目击;然后,作为应用得到了利用图态的稳定子构造纠缠目击的一系列方法.     

Measures of genuine multipartite entanglement for graph states

Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.     

Persistent entanglement in arrays of interacting particles

We study the entanglement properties of a class of N-qubit quantum states that are generated in arrays of qubits with an Ising-type interaction. These states contain a large amount of entanglement as given by their Schmidt measure. They also have a high persistency of entanglement which means that approximately N/2 qubits have to be measured to disentangle the state. These states can be regarded as an entanglement resource since one can generate a family of other multiparticle entangled states such as the generalized Greenberger-Horne-Zeilinger states of 相似文献   

Comment on “Multipartite Entanglement in Four-qubit Graph States”

The following comment is based on an article by Jafarpour and Assadi (Eur. Phys. J. D 70, 62 2016) which with an exploitation of Scott measure (or generalized Meyer-Wallach measure) the entanglement quantity of four-qubit graph states has been calculated. We are to reveal that a 2-2 partition necessarily always does not provide a stronger entanglement than a 3-1 partition in all the graph states.     

Dynamics of genuine multipartite entanglement under local non-Markovian dephasing

We study dynamics of genuine entanglement for quantum states of three and four qubits under non-Markovian dephasing. Using a computable entanglement monotone for multipartite systems, we find that the GHZ state is quite resilient state whereas the W state is the most fragile. We compare dynamics of chosen quantum states with dynamics of random pure states and weighted graph states.     

Detecting Entanglement of States by Entries of Their Density Matrices

For any bipartite systems, a universal entanglement witness of rank-4 for pure states is obtained and a class of finite rank entanglement witnesses is constructed. In addition, a method of detecting entanglement of a state only by entries of its density matrix with respect to some product basis is obtained.     

Teleportation and dense coding with genuine multipartite entanglement

We present an explicit protocol E0 for faithfully teleporting an arbitrary two-qubit state via a genuine four-qubit entangled state. By construction, our four-partite state is not reducible to a pair of Bell states. Its properties are compared and contrasted with those of the four-party Greenberger-Horne-Zeilinger and W states. We also give a dense coding scheme D0 involving our state as a shared resource of entanglement. Both D0 and E0 indicate that our four-qubit state is a likely candidate for the genuine four-partite analogue to a Bell state.     

Unextendible Product Bases,Uncompletable Product Bases and Bound Entanglement

We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representation we give a complete characterization of unextendible product bases for two qutrits. We present several generalizations of UPBs to arbitrary high dimensions and multipartite systems. We present a sufficient condition for sets of orthogonal product states to be distinguishable by separable superoperators. We prove that bound entangled states cannot help increase the distillable entanglement of a state beyond its regularized entanglement of formation assisted by bound entanglement.     

Witness for Non-Quasi Maximally Entangled States

Maximally entangled states, defined as those states that have the maximal entanglement of formation under some entanglement measure, are the ideal resource for many quantum missions. In this paper, we call a convex roof of maximally entangled pure states a quasi maximally entangled state. First, we present the concept of a witness for non-quasi maximally entangled states, which is an observable that can distinguish some non-quasi maximally entangled states from quasi maximally entangled ones. Then we prove that every non-quasi maximally entangled state can be witnessed by a witness and obtain some necessary and sufficient conditions for an observable to be a witness for non-quasi maximally entangled states. Lastly, we give some classes of Hermitian operators, which can become witnesses. Especially, we compute non-quasi maximally entangled states that can be detected by a specific product operator.     

Typical universal entanglers

A universal entangler is a very powerful fault-tolerant entangling device for generating quantum entanglements from any joint states. Our paper aims to address the construction of universal entanglers. We prove that universal entanglers may be obtained from random unitary gates according to the Harr measure. The success probability is close to 1 for large system spaces. This result represents the typical density of entanglement subspaces in large state spaces. It also partially solves an open problem of universal bipartite entanglers and is explained by some experiment simulations.     

Monogamy and entanglement in tripartite quantum states

We present an interesting monogamy equation for (2⊗2⊗n)-dimensional pure states, by which a quantity is found to characterize the tripartite entanglement with the GHZ type and W type entanglements as a whole. In particular, we, for the first time, reveals that for any quantum state of a pair of qubits, the difference between the two remarkable entanglement measures, concurrence and negativity, characterizes the W type entanglement of tripartite pure states with the two-qubit state as reduced density.     

Ground-state approximation for strongly interacting spin systems in arbitrary spatial dimension

We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These states allow for the efficient computation of all local observables (e.g., energy) and include states with diverging correlation length and unbounded multiparticle entanglement. As a demonstration, we apply our approach to the Ising model on 1D, 2D, and 3D square lattices. We also present generalizations to higher spins and continuous-variable systems, which allows for the investigation of lattice field theories.     

Dynamics of entanglement of bosonic modes on symmetric graphs

We investigate the dynamics of an initially disentangled Gaussian state on a general finite symmetric graph. As concrete examples we obtain properties of this dynamics on mean field graphs (also called fully connected or complete graphs) of arbitrary sizes. In the same way that chains can be used for transmitting entanglement by their natural dynamics, these graphs can be used to store entanglement. We also consider two kinds of regular polyhedron which show interesting features of entanglement sharing.     

Entanglement Dynamics of Electrons and Photons

Entanglement is a fundamental feature of quantum theory as well as a key resource for quantum computing and quantum communication, but the entanglement mechanism has not been found at present. We think when the two subsystems exist interaction directly or indirectly, they can be in entanglement state. such as, in the Jaynes-Cummings model, the entanglement between the atom and the light field comes from their interaction. In this paper, we have studied the entanglement mechanism of electron-electron and photon-photon, which are from the spin-spin interaction. We found their total entanglement states are relevant both space state and spin state. When two electrons or two photons are far away, their entanglement states should be disappeared even if their spin state is entangled.     

Quantum computational capability of a 2D valence bond solid phase

Quantum phases of naturally-occurring systems exhibit distinctive collective phenomena as manifestation of their many-body correlations, in contrast to our persistent technological challenge to engineer at will such strong correlations artificially. Here we show theoretically that quantum correlations exhibited in the 2D valence bond solid phase of a quantum antiferromagnet, modeled by Affleck, Kennedy, Lieb, and Tasaki (AKLT) as a precursor of spin liquids and topological orders, are sufficiently complex yet structured enough to simulate universal quantum computation when every single spin can be measured individually. This unveils that an intrinsic complexity of naturally-occurring 2D quantum systems—which has been a long-standing challenge for traditional computers—could be tamed as a computationally valuable resource, even if we are limited not to create newly entanglement during computation. Our constructive protocol leverages a novel way to herald the correlations suitable for deterministic quantum computation through a random sampling, and may be extensible to other ground states of various 2D valence bond phases beyond the AKLT state.