Adversary lower bounds for the collision and the set equality problems

• المؤلفون الرئيسيون: Belovs, Aleksandrs, Rosmanis, Ansis
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Science::Physics; Quantum Physics; Set Equality
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/137663

We prove tight Ω(n1/3) lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method. Thus, we reprove the result by Aaronson and Shi, as well as a more recent...