相关论文: Entanglement and local information access for grap…

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…

We investigate the properties and relations of two classes of operational bipartite and multipartite entanglement measures, the so-called source and the accessible entanglement. The former measures how easy it is to generate a given state…

We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement…

We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…

Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…

For a multipartite system, we sort out all possible entanglements, each of which is among a set of subsystems. Each entanglement can be measured by a generalized relative entropy of entanglement, which is conserved on average under…

An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with…

In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…

Entanglement is the resource to overcome the natural limitations of spatially separated parties restricted to Local Operations assisted by Classical Communications (LOCC). Recently two new classes of operational entanglement measures, the…

The study of multipartite entanglement is much less developed than the bipartite scenario. Recently, a string of results have proposed using tools from Topological Data Analysis (TDA) to attach topological quantities to multipartite states.…

We introduce two operational entanglement measures which are applicable for arbitrary multipartite (pure or mixed) states. One of them characterizes the potentiality of a state to generate other states via local operations assisted by…

Bound entangled states are states that are entangled but from which no entanglement can be distilled if all parties are allowed only local operations and classical communication. However, in creating these states one needs nonzero…

Multipartite entanglement is regarded as a crucial physical resource in quantum network communication. However, due to the intrinsic complexity of quantum many-body systems, identifying a multipartite entanglement measure that is both…

Quantifying experimentally created entanglement could in principle be accomplished by measuring the entire density matrix and calculating an entanglement measure of choice thereafter. Due to the tensor-structure of the Hilbert space, this…

Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…

We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…

Ordering physical states is the key to quantifying some physical property of the states uniquely. Bipartite pure entangled states are totally ordered under local operations and classical communication (LOCC) in the asymptotic limit and…

Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and…