Deterministic dense coding and faithful teleportation with multipartite graph states

Journal Article · Fri May 15 00:00:00 EDT 2009 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.79.052306· OSTI ID:21300814

Huang, C -Y; Yu, I-C; Lin, F -L ^[1]; Hsu, L -Y ^[2]

---

1. Department of Physics, National Taiwan Normal University, Taipei 116, Taiwan (China)
2. Department of Physics, Chung Yuan Christian University, Chung-li 32023, Taiwan (China)

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.

• OSTI ID: 21300814
• Journal Information: Physical Review. A, Vol. 79, Issue 5; Other Information: DOI: 10.1103/PhysRevA.79.052306; (c) 2009 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGEBRA
GRAPH THEORY
MATRICES
QUANTUM TELEPORTATION