Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
Quantum Physics
2015-07-22 v2 High Energy Physics - Theory
Abstract
We proposed novel 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 scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
Keywords
Cite
@article{arxiv.0806.4289,
title = {Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States},
author = {Ching-Yu Huang and I-Ching Yu and Feng-Li Lin and Li-Yi Hsu},
journal= {arXiv preprint arXiv:0806.4289},
year = {2015}
}
Comments
10 pages, 1 figure;v2. discussions improved