Related papers: On the degree conjecture for separability of multi…
We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also…
The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
We present a novel approach to the separability problem for Gaussian quantum states of bosonic continuous variable systems. We derive a simplified necessary and sufficient separability criterion for arbitrary Gaussian states of $m$ vs $n$…
We construct a density matrix whose elements are written in terms of expectation values of non-Hermitian operators and their products for arbitrary dimensional bipartite states. We then show that any expression which involves matrix…
One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
We present a general method to characterize the quantum correlations obtained after local measurements on multipartite systems. Sufficient conditions for a quantum system to be fully-nonlocal according to a given partition, as well as being…
We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication.…
We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…
We propose a novel form of classification of multipartite states, in terms of the maximum degree of non-locality they can exhibit under any choice of local observables. This uses the hierarchy of notions previously introduced by Abramsky…
The separability from spectrum problem asks for a characterization of the eigenvalues of the bipartite mixed states {\rho} with the property that U^*{\rho}U is separable for all unitary matrices U. This problem has been solved when the…
In this brief report, we consider the equivalence between two sets of $m+1$ bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree $m$…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
Entanglement distillation is a basic task in quantum information, and the distillable entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in [Phys. Rev. A 84, 012325 (2011)]. We extend this…
We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…
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…
Explicit sufficient and necessary conditions for separability of $N$-dimensional rank two multiparty quantum mixed states are presented. A nonseparability inequality is also given, for the case where one of the eigenvectors corresponding to…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…