# Multiparty quantum random access codes

**Authors:** Debashis Saha, Jakub J. Borkala

arXiv: 1905.05668 · 2020-02-28

## TL;DR

This paper introduces multiparty quantum random access codes (RACs) that enable multiple parties to encode and retrieve information more efficiently than classical methods, using shared entanglement or quantum channels.

## Contribution

The paper develops new multiparty quantum RAC protocols that outperform classical RACs in scenarios with shared entanglement or quantum communication.

## Key findings

- Quantum multiparty RACs outperform classical RACs in efficiency.
- Protocols utilize shared entanglement and quantum channels.
- Quantum RACs enable better information retrieval in distributed settings.

## Abstract

Random access code (RAC), a primitive for many information processing protocols, enables one party to encode n-bit string into one bit of message such that another party can retrieve partial information of that string. We introduce the multiparty version of RAC in which the n-bit string is distributed among many parties. For this task, we consider two distinct quantum communication scenarios: one allows shared quantum entanglement among the parties with classical communication, and the other allows communication through a quantum channel. We present several multiparty quantum RAC protocols that outclass its classical counterpart in both the aforementioned scenarios.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.05668/full.md

## Figures

9 figures with captions in the complete paper: https://tomesphere.com/paper/1905.05668/full.md

## References

37 references — full list in the complete paper: https://tomesphere.com/paper/1905.05668/full.md

---
Source: https://tomesphere.com/paper/1905.05668