Related papers: On the degree conjecture for separability of multi…
We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which…
In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits (Phys. Rev. A \textbf{61}, 052306 (2000)) to the tripartite systems in higher dimension. The spirit…
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing…
As one of the most profound features of quantum mechanics, entanglement is a vital resource for quantum information processing. Inspired by the recent work on PT-moments and separablity [Phys. Rev. Lett. {\bf 127}, 060504 (2021)], we…
The operator Schmidt rank is the minimum number of terms required to express a state as a sum of elementary tensor factors. Here we provide a new proof of the fact that any bipartite mixed state with operator Schmidt rank two is separable,…
We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…
To determine whether a given multipartite quantum state is separable with respect to some partition we construct a family of entanglement measures R_m. This is done utilizing generalized concurrences as building blocks which are defined by…
We find that the m-separability and k-partite entanglement of a multipartite quantum system is correlated with quantum coherence of the same with respect to complete orthonormal bases, distinguishable under local operations and classical…
A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…
Recently, it has been argued that quantum mechanics is complete, and that quantum states vectors are necessarily in one-to-one correspondence with the elements of reality, under the assumptions that quantum theory is correct and that…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…
The theory of quantum states over time extends the density operator formalism into the temporal domain, providing a unified of treatment of timelike and spacelike separated systems in quantum theory. Although recent results have…
This paper present a geometric diagram of a separable state: If a mixed state $\sigma $ is separable, there are $2^{nS(\sigma)}$ linearly independant product vectors which span the same Hilbert space as the $2^{nS(\sigma)}$ ``likely''…
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states…
We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…
Motivated by the notions of $k$-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al (Phys. Rev. A, 69:022308), we introduce parallel definitions in the context of Gaussian…
For any unitarily invariant convex function F on the states of a composite quantum system which isolates the trace there is a critical constant C such that F(w)<= C for a state w implies that w is not entangled; and for any possible D > C…
We generalize the definition of strong positive partial transpose (SPPT) to the multipartite system. The tripartite case was first considered by X.-Y. Yu and H. Zhao [ Int. J. Theor. Phys.,54, 292, (2015)]. In this extension, unfortunately,…
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…