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.
|期刊||Physical Review A - Atomic, Molecular, and Optical Physics|
|出版狀態||已發佈 - 2009 5月 8|
ASJC Scopus subject areas