Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
classification
🪐 quant-ph
hep-th
keywords
graphcodingdensedeterministicfaithfulmultipartiteproposedstates
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.