Corpus ID: 3886897

Adversary lower bounds for the collision and the set equality problems

@article{Belovs2018AdversaryLB,
  title={Adversary lower bounds for the collision and the set equality problems},
  author={Aleksandrs Belovs and Ansis Rosmanis},
  journal={Quantum Information & Computation},
  year={2018},
  volume={18},
  pages={200-224}
}
  • Aleksandrs Belovs, Ansis Rosmanis
  • Published in
    Quantum Information…
    2018
  • Mathematics, Physics, Computer Science
  • We prove tight $\Omega(n^{1/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 development by Zhandry. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    On the Power of Non-adaptive Learning Graphs

    VIEW 7 EXCERPTS

    Quantum lower bounds for the collision and the element distinctness problems

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    A note on the quantum collision and set equality problems

    • Mark Zhandry
    • Mathematics, Computer Science, Physics
    • Quantum Information & Computation
    • 2013
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Negative weights make adversaries stronger

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Adversary Lower Bound for the Orthogonal Array Problem

    VIEW 1 EXCERPT

    A strong direct product theorem for quantum query complexity

    VIEW 1 EXCERPT

    Adversary Lower Bound for Element Distinctness

    VIEW 2 EXCERPTS

    Adversary lower bound for the k-sum problem

    VIEW 3 EXCERPTS

    How to Construct Quantum Random Functions

    • Mark Zhandry
    • Computer Science, Mathematics, Physics
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    VIEW 1 EXCERPT

    Learning-Graph-Based Quantum Algorithm for k-Distinctness

    • Aleksandrs Belovs
    • Mathematics, Computer Science, Physics
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    VIEW 1 EXCERPT