Related papers: On the degree conjecture for separability of multi…
We study a coarse-graining map arising from incomplete and imperfect addressing of particles in a multipartite quantum system. In its simplest form, corresponding to a two-qubit state, the resulting channel produces a convex mixture of the…
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this issue by giving necessary and sufficient…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical…
Recently, Milani\v{c} and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems…
Based on the residual entanglement [9] (Phys. Rev. A \textbf{71}, 044301 (2005)), we present the global entanglement for a multipartite quantum state. The measure is shown to be also obtained by the bipartite partitions of the multipartite…
We propose a method to detect genuine quantum correlation for arbitrary quantum state in terms of the rank of coefficient matrices associated with the pure state. We then derive a necessary and sufficient condition for a quantum state to…
We propose an entanglement tensor to compute the entanglement of a general pure multipartite quantum state. We compare the ensuing tensor with the concurrence for bipartite state and apply the tensor measure to some interesting examples of…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state…
We introduce algebraic sets in the complex projective spaces for the mixed states in bipartite quantum systems as their invariants under local unitary operations. The algebraic sets of the mixed state have to be the union of the linear…
We obtain a collection of necessary (sufficient) conditions for a bipartite system of qubits to be separable (entangled), which are based on the Landau-Pollak formulation of the uncertainty principle. These conditions are tested, and…
We study the \emph{Bipartite Degree Realization} (BDR) problem: given a graphic degree sequence $D$, decide whether it admits a realization as a bipartite graph. While bipartite realizability for a fixed vertex partition can be decided in…
Bipartite quantum states are classified into three categories: separable states, bound entangled states, and free entangled states. It is of great importance to characterize these families of states for the development of quantum…
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…