Entangled graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F02%3A00007546" target="_blank" >RIV/00216224:14330/02:00007546 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Entangled graphs

Original language 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 abi-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).

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BE - Theoretical physics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F98%2F0369" target="_blank" >GA201/98/0369: Informatics as the third methodology</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Quantum Information and Computing

ISSN

1533-7146

e-ISSN

—

Volume of the periodical

2

Issue of the periodical within the volume

Special

Country of publishing house

US - UNITED STATES

Number of pages

10

Pages from-to

530-539

UT code for WoS article

—

EID of the result in the Scopus database

—