On the power of quantum fingerprinting
From MaRDI portal
Publication:3581289
DOI10.1145/780542.780554zbMath1192.81110OpenAlexW2010796327MaRDI QIDQ3581289
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780554
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
The communication complexity of the Hamming distance problem ⋮ The Communication Complexity of Non-signaling Distributions ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models ⋮ Equality alone does not simulate randomness ⋮ Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems
This page was built for publication: On the power of quantum fingerprinting
