Controlling bi-partite entanglement in multi-qubit systems

Abstract

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in order to analyze pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

20 pages, 3 figures, accepted in J. Phys. A

References in corpus (10)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Separability of Mixed States: Necessary and Sufficient Conditions
• Quantum secret sharing
• Entanglement of a Pair of Quantum Bits
• Distributed Entanglement
• Entangled Rings
• Classification of multipartite entangled states by multidimensional determinants
• Entangled webs: Tight bound for symmetric sharing of entanglement
• Entanglement molecules
• Entangled graphs: Bipartite entanglement in multi-qubit systems

Cited by in corpus (4)

• Entangled graphs: A classification of four-qubit entanglement
• Maximizing nearest neighbour entanglement in finitely correlated qubit--chains
• On Multiparticle Entanglement via Resonant Interaction between Light and atomic Ensembles
• Modeling Tripartite Entanglement in Quantum Protocols using Evolving Entangled Hypergraphs