Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

TL;DR

This paper introduces new schemes for deterministic dense coding and faithful teleportation using multipartite graph states, establishing conditions for their viability based on graph properties.

Contribution

It proposes novel schemes for quantum communication with multipartite graph states and identifies the necessary and sufficient graph conditions for their implementation.

Findings

Schemes enable deterministic dense coding and teleportation with multipartite graph states.

The viability condition requires the reduced adjacency matrix to be invertible.

Provides a theoretical foundation for designing quantum communication protocols using graph states.

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.