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 -