Quick Navigation
Topics
Quantum Foundations
Randomness compression in communication networks
arXiv
Authors: Yukari Uchibori, Alice Zheng, Anurag Anshu, Jamie Sikora
Year
2026
Paper ID
30875
Status
Preprint
Abstract Read
~2 min
Abstract Words
87
Citations
N/A
Abstract
Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it. We develop a novel upper bound for approximating distributions generated by arbitrary networks and showcase instances where it significantly outperforms the best-known upper bounds for the exact case. This demonstrates that one can have substantial savings in resources if small perturbations are acceptable. We derive our bound using Hoeffding's inequality and apply it to various commonly-used communication networks such as the Bell scenario and triangle scenario.
Why This Paper Matters
- This paper contributes to the Quantum Foundations research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.