Related papers: A combinatorial approach for studying LOCC transfo…

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…

Multipartite quantum states constitute the key resource for quantum computation. The understanding of their internal structure is thus of great importance in the field of quantum information. This paper aims at examining the structure of…

We introduce on physical grounds a new measure of multipartite entanglement for pure states. The function we define is discriminant and monotone under LOCC and moreover can be expressed in terms of observables of the system.

We study the problem of locally distinguishing pure quantum states using shared entanglement as a resource. For a given set of locally indistinguishable states, we define a resource state to be useful if it can enhance local…

We propose the usage of persistent homologies to characterize multipartite entanglement. On a multi-qubit data set we introduce metric-like measures defined only in terms of bipartite entanglement and then we derive barcodes. We show that…

Any deterministic bipartite entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such…

One way to explore multiparticle entanglement is to ask for maximal entanglement with respect to different bipartitions, leading to the notion of absolutely maximally entangled states or perfect tensors. A different path uses unitary…

We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally…

We present experimentally and numerically accessible quantities that can be used to differentiate among various families of random entangled states. To this end, we analyze the entanglement properties of bipartite reduced states of a…

Suppose two distant observers Alice and Bob share a pure biparticle entangled state secretly chosen from a set, it is shown that Alice (Bob) can probabilistic concentrate the state to a maximally entangled state by applying local operations…

Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication…

The entanglement of collaboration (EoC) quantifies the maximum amount of entanglement, that can be generated between two parties, A and B, given collaboration with N-2 other parties, when the N parties share a multipartite (possibly mixed)…

To quantify the entanglement is one of the most important topics in quantum entanglement theory. In [arXiv: 2006.12408], the authors proposed a method to build a measure from the orginal domain to a larger one. Here we apply that method to…

Absolutely Maximally Entangled (AME) states are maximally entangled for every bipartition of the system. They are crucial resources for various quantum information protocols. We present techniques for verifying either two AME states are…

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,…

The geometric measure of entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with…

Using an inductive approach to classify multipartite entangled states under stochastic local operations and classical communication introduced recently by the authors [Phys. Rev. A 74, 052336 (2006)], we give the complete classification of…

We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. To this end, we fix a multipartite entanglement measure and consider two quantities: the multipartite…

In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the…

Classical spectral graph theory characterizes graphs with logarithmic mixing time. In this work, we present a combinatorial characterization of graphs with constant mixing time. The combinatorial characterization is based on the small-set…