Deterministic dense coding and faithful teleportation with multipartite graph states

Ching Yu Huang, I. Ching Yu, Feng Li Lin, Li Yi Hsu

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.

Original languageEnglish
Article number052306
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume79
Issue number5
DOIs
Publication statusPublished - 2009 May 8

Fingerprint

transmitters
coding
receivers
matrices

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Deterministic dense coding and faithful teleportation with multipartite graph states. / Huang, Ching Yu; Yu, I. Ching; Lin, Feng Li; Hsu, Li Yi.

In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 79, No. 5, 052306, 08.05.2009.

Research output: Contribution to journalArticle

@article{107d2846d9f44810b26e4f6253c699b5,
title = "Deterministic dense coding and faithful teleportation with multipartite graph states",
abstract = "We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.",
author = "Huang, {Ching Yu} and Yu, {I. Ching} and Lin, {Feng Li} and Hsu, {Li Yi}",
year = "2009",
month = "5",
day = "8",
doi = "10.1103/PhysRevA.79.052306",
language = "English",
volume = "79",
journal = "Physical Review A - Atomic, Molecular, and Optical Physics",
issn = "1050-2947",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Deterministic dense coding and faithful teleportation with multipartite graph states

AU - Huang, Ching Yu

AU - Yu, I. Ching

AU - Lin, Feng Li

AU - Hsu, Li Yi

PY - 2009/5/8

Y1 - 2009/5/8

N2 - We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.

AB - We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.

UR - http://www.scopus.com/inward/record.url?scp=67650280604&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650280604&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.79.052306

DO - 10.1103/PhysRevA.79.052306

M3 - Article

AN - SCOPUS:67650280604

VL - 79

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1050-2947

IS - 5

M1 - 052306

ER -