Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
arXiv:0806.4289 · doi:10.1103/PhysRevA.79.052306
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.
arXiv comment10 pages, 1 figure;v2. discussions improved
References in corpus (20)
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Multi-party entanglement in graph states
- Experimental entanglement of six photons in graph states
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Quantum information can be negative
- Teleportation and Dense Coding with Genuine Multipartite Entanglement
- Graphical description of the action of local Clifford transformations on graph states
- Quantum teleportation of an arbitrary two qubit state and its relation to multipartite entanglement
- Repeat-Until-Success Quantum Computing
- Multipartite entanglement for entanglement teleportation
- Generalized Teleportation Protocol
- Codeword Stabilized Quantum Codes
- Scalable Generation of Graph-State Entanglement through Realistic Linear Optics
- The efficiencies of generating cluster states with weak non-linearities
- A scheme for tunable quantum phase gate and effective preparation of graph-state entanglement
- Perfect many-to-one teleportation with stabilizer states
- A genuine four-partite entangled state
- Deterministic distributed dense coding with stabilizer states