The Garden Hose Complexity for the Equality Function
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.
Unable to display preview. Download preview PDF.
- [BFS11]Buhrman, H., Fehr, S., Schaffner, C.: Position-Based Quantum Cryptography. ERCIM News 2011(85), 16–17 (2011)Google Scholar
- [BFSS13]Buhrman, H., Fehr, S., Schaffner, C., Speelman, F.: The garden-hose model. In: ITCS, pp. 145–158 (2013)Google Scholar
- [MM12]Margalit, O., Matsliah, A.: Mage - the CDCL SAT solver developed and used by IBM for formal verification. Personal Communication (2012), http://ibm.co/P7qNpC
- [PM]Pfeiffer, G., Merkwitz, T.: GAP Data Library “Tables of Marks”, http://www.gap-system.org/Datalib/tom.html