Quick Navigation
Topics
Quantum Networks
On the quantum communication complexity of total functions
arXiv
Authors: Dmytro Gavinsky
Year
2026
Paper ID
76651
Status
Preprint
Abstract Read
~2 min
Abstract Words
23
Citations
N/A
Abstract
We present a total function with a polylogarithmic two-message quantum protocol, whereas every randomised protocol, even with arbitrarily many rounds, requires polynomial communication.
Why This Paper Matters
- This paper contributes to the Quantum Networks research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- We present a total function with a polylogarithmic two-message quantum protocol, whereas every randomised protocol, even with arbitrarily many rounds, requires polynomial...
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.