Related papers: Calculating Concentratable Entanglement in Graph S…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
Graph states are a fundamental entanglement resource for multipartite quantum applications which are in general challenging to transform efficiently. While fusion operations for merging entangled states are well-developed, no direct…
A new method is developed to derive an algebraic equations for the geometric measure of entanglement of three qubit pure states. The equations are derived explicitly and solved in cases of most interest. These equations allow oneself to…
In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the…
Because of the difficulty in getting the analytic formula of relative entropy of entanglement, it becomes troublesome to study the monogamy relations of relative entropy of entanglement for three-qubit pure states. However, we find that all…
We present two method for optimal entanglement concentration from pure entangled states by local actions only. However a prior knowledge of the Schmidt coefficients is required. The first method is optimally efficient only when a finite…
This paper will address the question of the distillation of entanglement from a finite number of multi-partite mixed states. It is shown that if one can distill a pure entangled state from n copies of a mixed state $\sigma _{ABC...}$ there…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
Topological quantum error correcting codes have emerged as leading candidates towards the goal of achieving large-scale fault-tolerant quantum computers. However, quantifying entanglement in these systems of large size in the presence of…
We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are…
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…
In the context of measurement-based quantum computation a way of maintaining the coherence of a graph state is to measure its stabilizer operators. Aside from performing quantum error correction, it is possible to exploit the information…
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The…
We present a physical scheme for entanglement concentration of unknown atomic entangled states via cavity decay. In the scheme, the atomic state is used as stationary qubit and photonic state as flying qubit, and a close maximally entangled…
Quantifying entanglement is an important issue in quantum information theory. Here we consider the entanglement measures through the trace norm in terms of two methods, the modified measure and the extended measure for bipartite states. We…
We reduce the necessary and sufficient biseparable conditions of the four qubit cluster diagonal state to concise forms. Only 4 out of the 15 parameters are proved to be relevant in specifying the genuine entanglement of the state. Using…
We start by studying the subgroup structures underlying stabilizer circuits and we use our results to propose a new normal form for stabilizer circuits. This normal form is computed by induction using simple conjugation rules in the…
A complete analysis of entangled bipartite qutrit pure states is carried out based on a simple entanglement measure. An analysis of all possible extremally entangled pure bipartite qutrit states is shown to reduce, with the help of SLOCC…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit…