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
|Published - 2009 May 8
ASJC Scopus subject areas
- Atomic and Molecular Physics, and Optics