J 2000

Entangled webs: Tight bound for symmetric sharing of entanglement

KOASHI, M., Vladimír BŮŽEK and N. IMOTO

Basic information

Original name

Entangled webs: Tight bound for symmetric sharing of entanglement

Authors

KOASHI, M., Vladimír BŮŽEK and N. IMOTO

Edition

Physical Review A, USA, American Physical Society, 2000, 1050-2947

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10301 Atomic, molecular and chemical physics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Impact factor

Impact factor: 2.831

RIV identification code

RIV/00216224:14330/00:00002897

Organization unit

Faculty of Informatics

Keywords in English

STATE ENTANGLEMENT; BELL THEOREM; QUANTUM; CRYPTOGRAPHY

Tags

Změněno: 21/2/2001 12:32, prof. Dr. phil. Jakub Mácha, Ph.D.

Abstract

V originále

Quantum entanglement cannot be unlimitedly shared among an arbitrary number of qubits. The degree of bipartite entanglement decreases as the number of entangled pairs in an N-qubit system increases. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is 2/N. This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis stare \0 > and the others in the basis state \1 >.

Links

GA201/98/0369, research and development project
Name: Informatika jako třetí metodologie
Investor: Czech Science Foundation, Informatics as the third methodology
MSM 143300001, plan (intention)
Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů
Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing