Calculating Concentratable Entanglement in Graph States

Abstract

We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of graph states, with examples including a single qubit within any graph state, states proposed for use in quantum repeaters and states that maximise and minimise the overall Concentratable Entanglement.

9 pages, 4 figures

References in corpus (6)

• Multi-party entanglement in graph states
• Deterministic Generation of a Cluster State of Entangled Photons
• Quantum secret sharing with qudit graph states
• Quantum Error Correcting Codes Using Qudit Graph States
• Encoding Hypergraphs into Quantum States
• Optimal preparation of graph states