Deterministic dense coding and faithful teleportation with multipartite graph states

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

doi:10.1103/PhysRevA.79.052306

Deterministic dense coding and faithful teleportation with multipartite graph states

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

^*此作品的通信作者

物理學系

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

4 引文斯高帕斯（Scopus）

摘要

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.

原文	英語
文章編號	052306
期刊	Physical Review A - Atomic, Molecular, and Optical Physics
卷	79
發行號	5
DOIs	https://doi.org/10.1103/PhysRevA.79.052306
出版狀態	已發佈 - 2009 5月 8

ASJC Scopus subject areas

原子與分子物理與光學

存取文件

10.1103/PhysRevA.79.052306

其它文件與鏈接

引用此

@article{8ae2ed6b96e64e098ce72366ddb28f6e,

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 = may,

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 - https://www.scopus.com/pages/publications/67650280604

UR - https://www.scopus.com/pages/publications/67650280604#tab=citedBy

U2 - 10.1103/PhysRevA.79.052306

DO - 10.1103/PhysRevA.79.052306

M3 - Article

AN - SCOPUS:67650280604

SN - 1050-2947

VL - 79

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

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

IS - 5

M1 - 052306

ER -

Deterministic dense coding and faithful teleportation with multipartite graph states

摘要

ASJC Scopus subject areas

存取文件

其它文件與鏈接

指紋

引用此