Efficient Entanglement Measure for Graph States

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 entanglement quantity in the multi-qubit graph states.Comment: 10 pages, 4 table

Photonic multipartite entanglement conversion using nonlocal operations

We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations and classical communication, but most importantly does not require full access to the states. It is based on a flexible linear optical conversion gate that uses photons, which are ideally suited for distributed quantum computation and quantum communication in extended networks. In order to show the basic working principles of the gate, we focus on converting a four-qubit entangled cluster state to other locally inequivalent four-qubit states, such as the GHZ and symmetric Dicke state. We also show how the gate can be incorporated into extended graph state networks, and can be used to generate variable entanglement and quantum correlations without entanglement but nonvanishing quantum discord.Comment: 10 pages, 6 figures, correction of reference list, add Journal ref. and DO

Compact set of invariants characterizing graph states of up to eight qubits

The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if n > 6. On the other hand, the set of invariants proposed by van den Nest, Dehaene, and De Moor (VDD) [Phys. Rev. A 72, 014307 (2005)] distinguishes between inequivalent classes, but contains too many invariants (more than 2 10^{36} for n=7) to be practical. Here we solve the problem of deciding which entanglement class a graph state of n < 9 qubits belongs to by calculating some of the state's intrinsic properties. We show that four invariants related to those proposed by VDD are enough for distinguishing between all inequivalent classes with n < 9 qubits.Comment: REVTeX4, 9 pages, 1 figur

Entangled graphs: Bipartite entanglement in multi-qubit systems

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite system is associated with a point (vertex) while a bi-partite entanglement between two specific qubits is represented by a connection (edge) between these points. We prove that any such entangled structure can be associated with a pure state of a multi-qubit system. Moreover, we show that a pure state corresponding to a given entangled structure is a superposition of vectors from a subspace of the $2^N$-dimensional Hilbert space, whose dimension grows linearly with the number of entangled pairs.Comment: 6 revtex pages, 2 figures, to appear in Phys. Rev.

Experimental demonstration of a hyper-entangled ten-qubit Schr\"odinger cat state

Coherent manipulation of an increasing number of qubits for the generation of entangled states has been an important goal and benchmark in the emerging field of quantum information science. The multiparticle entangled states serve as physical resources for measurement-based quantum computing and high-precision quantum metrology. However, their experimental preparation has proved extremely challenging. To date, entangled states up to six, eight atoms, or six photonic qubits have been demonstrated. Here, by exploiting both the photons' polarization and momentum degrees of freedom, we report the creation of hyper-entangled six-, eight-, and ten-qubit Schr\"odinger cat states. We characterize the cat states by evaluating their fidelities and detecting the presence of genuine multi-partite entanglement. Small modifications of the experimental setup will allow the generation of various graph states up to ten qubits. Our method provides a shortcut to expand the effective Hilbert space, opening up interesting applications such as quantum-enhanced super-resolving phase measurement, graph-state generation for anyonic simulation and topological error correction, and novel tests of nonlocality with hyper-entanglement.Comment: 11 pages, 5 figures, comments welcom