Entangled graphs
We study how bi-partite quantum entanglement (measured in terms of a concurrence) can be shared in multi-qubit systems. We introduce a concept of the entangled graph such that each qubit of a multi-partite system is associated with a vertex while a bipartite entanglement between two specific qubits is represented by an edge. We prove that any entangled graph can be associated with a pure state of a multi-qubit system. We also derive bounds on the concurrence for some weighted entangled graphs (the weight corresponds to the value of concurrence associated with the given edge).
entanglement