Related papers: Bipartite entanglement in AJL's algorithm for thre…
This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our…
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…
Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…
We introduce a protocol to classify three-qubit pure states into different entanglement classes and implement it on an NMR quantum processor. The protocol is designed in such a way that the experiments performed to classify the states can…
We investigate some properties of multipartite entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing the concurrence between two specific qubits of a hypergraph state by using…
One of the key manifestations of quantum mechanics is the phenomenon of quantum entanglement. While the entanglement of bipartite systems is already well understood, our knowledge of entanglement in multipartite systems is still limited.…
This work establishes a direct operational connection between the entanglement structures of specific three-qubit states (i.e. multipartite entanglement) and their corresponding topological links. We investigate the symmetric $\wwbar$ state…
We formulate an entanglement criterion using Peres-Horodecki positive partial transpose operations combined with the Schr\"odinger-Robertson uncertainty relation. We show that any pure entangled bipartite and tripartite state can be…
A classification of multipartite entanglement in qubit systems is introduced for pure and mixed states. The classification is based on the robustness of the said entanglement against partial trace operation. Then we use current machine…
We give an explicit tight lower bound for the entanglement of formation for arbitrary bipartite mixed states by using the convex hull construction of a certain function. This is achieved by revealing a novel connection among the…
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
Entanglement is a key property of quantum states that acts as a resource for a wide range of tasks in quantum computing. Entanglement detection is a key conceptual and practical challenge. Without adaptive or joint measurements,…
Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…
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…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
We construct an important missing piece in the entanglement theory of pure three-qubit states, which is a polynomial measure of W-entanglement, working in parallel to the three-tangle, which is a polynomial measure of GHZ-entanglement, and…
Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence…
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…
Multipartite entanglement has been shown to be of particular relevance for a better understanding and exploitation of the dynamics and flow of entanglement in multiparty systems. This calls for analysis aimed at identifying the appropriate…