Related papers: Highly entangled multi-qubit states with simple al…
We present a complete classification of the geometry of the mutually complementary sets of entangled and separable states in three-dimensional Hilbert subspaces of bipartite and multipartite quantum systems. Our analysis begins by finding…
We study the closest disentangled state to a given entangled state in any system (multi-party with any dimension). We obtain the set of equations the closest disentangled state must satisfy, and show that its reduction is strongly related…
The usefulness of the genuinely entangled six qubit state that was recently introduced by Borras et al. is investigated for the quantum teleportation of an arbitrary three qubit state and for quantum state sharing (QSTS) of an arbitrary two…
We investigate genuinely entangled $N$-qubit states with no $N$-partite correlations in the case of symmetric states. Using a tensor representation for mixed symmetric states, we obtain a simple characterization of the absence of…
We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case,…
The work is intended to represent some interesting and apparently peculiar features of entangled system in both pure as well as mixed states level. In the pure state level, we are largely concerned about the existence and characteristics of…
Algebraic approach to quantum non - separability is applied to the case of two qubits. It is based on the partition of the algebra of observables into independent subalgebras and the tensor product structure of the Hilbert space is not…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
We present a classification of three-qubit states based in their three-qubit and reduced two-qubit entanglements. For pure states these criteria can be easily implemented, and the different types can be related with sets of equivalence…
We classify multipartite entangled states in the 2 x 2 x n (n >= 4) quantum system, for example the 4-qubit system distributed over 3 parties, under local filtering operations. We show that there exist nine essentially different classes of…
In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
Quantum entanglement detection and characterization are crucial for various quantum information processes. Most existing methods for entanglement detection rely heavily on a complete description of the quantum state, which requires numerous…
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture…
The monogamy of entanglement means that entanglement cannot be freely shared. In 2014, Oliveira et al. [ Oliveira et al., Phys. Rev. A. 89, 034303 (2014)] proposed a monogamy relation in the linear version and considered it in terms of…