Quick Navigation
Topics
Quantum Networks
Constant-round quantum advantage in communication complexity for total functions
arXiv
Authors: Atsuya Hasegawa, François Le Gall
Year
2026
Paper ID
76574
Status
Preprint
Abstract Read
~2 min
Abstract Words
38
Citations
N/A
Abstract
We show that there exists a total function for which there is a polynomial gap between the randomized and the constant-round quantum communication complexity. Previously, such a separation was known only for quantum protocols using polynomially many rounds.
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 show that there exists a total function for which there is a polynomial gap between the randomized and the constant-round quantum communication complexity.
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.