Related papers: On the degree conjecture for separability of multi…
A geometrical characterization of robustly separable (that is, remaining separable under sufficiently small variiations) mixed states of a bipartite quantum system is given. It is shown that the density matrix of any such state can be…
The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…
Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated…
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets $A$ and~$B$, where $A$ is an independent set and $B$ induces a graph from some specified graph class ${\cal…
We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
We address the question of whether or not global entanglement of a quantum state can be inferred from local properties. Specifically, we are interested in genuinely multiparticle entangled states whose two-body marginals are all separable,…
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated…
A vertex partition in which every part induces a 2-connected subgraph is called a 2-proper partition. This concept was introduced by Ferrara et al. in 2013, and Borozan et al. gave the best possible minimum degree condition for the…
In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits [Phys. Rev. A 61, 052306 (2000)] to the tripartite systems in higher dimension. The spirit lies in the…
Genuine multipartite entanglement and full inseparability are two inequivalent quantum resources. Even though all genuinely multipartite entangled states are also fully inseparable, not all fully inseparable states are genuinely…
We study separability criteria in multipartite quantum systems of arbitrary dimensions by using the Bloch representation of density matrices. We first derive the norms of the correlation tensors and obtain the necessary conditions for…
Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in the light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal…
We study the robustness of genuine multipartite entanglement and inseparability of multipartite pure states under superposition with product pure states. We introduce the concept of the maximal and the minimal Schmidt ranks for multipartite…
Entanglement shared among multiple parties presents complex challenges for the characterisation of different types of entanglement. One of the most fundamental insights is the fact that some mixed states can feature entanglement across…
Suppose we have an unknown multipartite quantum state, how can we experimentally find out whether it is genuine multipartite entangled or not? Recall that even for a bipartite quantum state whose density matrix is known, it is already…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…
In the context of network information theory, one often needs a multiparty probability distribution to be typical in several ways simultaneously. When considering quantum states instead of classical ones, it is in general difficult to prove…