Entangled graphs

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

PLESCH Martin BŮŽEK Vladimír

Year of publication 2002
Type Article in Periodical
Magazine / Source Quantum Information and Computing
MU Faculty or unit

Faculty of Informatics

Citation
Field Theoretical physics
Keywords quantum entanglement; multi-partite systems
Description 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 {\em entangled graph} such that each qubit of a multi-partite system is associated with a vertex while a bi-partite entanglement between two specific qubits is represented by an edge. We prove that any entangled graph can be associated with a {\em 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).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.