Quick Navigation
Topics
Quantum Cryptography Security
The Garden Hose Complexity for the Equality Function
arXiv
Authors: Well Y. Chiu, Mario Szegedy, Chengu Wang, Yixin Xu
Year
2013
Paper ID
2280
Status
Preprint
Abstract Read
~2 min
Abstract Words
105
Citations
N/A
Abstract
The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protocols in the quantum setting. We focus on the garden hose complexity of the equality function, and improve on the bounds of O. Margalit and A. Matsliah[MM12] with the help of a new approach and of our handmade simulated annealing based solver. We have also found beautiful symmetries of the solutions that have lead us to develop the notion of garden hose permutation groups. Then, exploiting this new concept, we get even further, although several interesting open problems remain.
Why This Paper Matters
- This paper contributes to the Quantum Cryptography & Security research area in the Quantum Articles archive.
- It adds a 2013 reference point for readers tracking recent quantum research.
- The garden hose complexity is a new communication complexity introduced by H.
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.