Deterministic distributed dense coding with stabilizer states

TL;DR

This paper explores how stabilizer states can be used for deterministic distributed dense coding among multiple senders and one receiver, providing conditions, protocols, and a new perspective within the stabilizer formalism.

Contribution

It introduces a sufficient condition for stabilizer states to enable deterministic distributed dense coding and proposes a method to determine achievable alphabet sizes for arbitrary states and partitions.

Findings

Established a sufficient condition for stabilizer states to be useful in distributed dense coding.

Constructed a protocol for deterministic distributed dense coding using stabilizer states.

Unified previous results within a new stabilizer formalism framework.

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.