Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

Details Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

2008-06-26

arxiv.org/abs/0806.4289v2

Physics

Quantum Physics

10 pages, 1 figure;v2. discussions improved

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246285