Deterministic distributed dense coding with stabilizer states

Abstract

We consider the possibility of using stabilizer states to perform deterministic dense coding among multiple senders and a single receiver. In the model we studied, the utilized stabilizer state is partitioned into several subsystems and then each subsystem is held by a distinct party. We present a sufficient condition for a stabilizer state to be useful for deterministic distributed dense coding with respect to a given partition plan. The corresponding protocol is also constructed. Furthermore, we propose a method to partially solve a more general problem of finding the set of achievable alphabet sizes for an arbitrary stabilizer state with respect to an arbitrary partition plan. Finally, our work provides a new perspective from the stabilizer formalism to view the standard dense coding protocol and also unifies several previous results in a single framework.

10 pages, no figure

References in corpus (10)

• Perfect Teleportation and Superdense Coding With W-States
• Entanglement Detection in the Stabilizer Formalism
• Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States
• Classical spin models and the quantum stabilizer formalism
• Deterministic and Unambiguous Dense Coding
• Deterministic dense coding and entanglement entropy
• Multipartite unlockable bound entanglement in the stabilizer formalism
• Optimal dense coding with arbitrary pure entangled states
• Probabilistic Dense Coding Using a Non-symmetric Multipartite Quantum Channel
• Boundary effect of deterministic dense coding

Cited by in corpus (4)

• Deterministic Quantum Dense Coding Networks
• Genuine Multiparty Quantum Entanglement Suppresses Multiport Classical Information Transmission
• Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States
• Model-Checking Linear-Time Properties of Quantum Systems