Abstract
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.
| Original language | English |
|---|---|
| Article number | 052306 |
| Journal | Physical Review A - Atomic, Molecular, and Optical Physics |
| Volume | 79 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2009 May 8 |
ASJC Scopus subject areas
- Atomic and Molecular Physics, and Optics
Fingerprint
Dive into the research topics of 'Deterministic dense coding and faithful teleportation with multipartite graph states'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS