Separations in query complexity using cheat sheets

@inproceedings{Aaronson2016SeparationsIQ,
  title={Separations in query complexity using cheat sheets},
  author={S. Aaronson and Shalev Ben-David and Robin Kothari},
  booktitle={STOC 2016},
  year={2016}
}
  • S. Aaronson, Shalev Ben-David, Robin Kothari
  • Published in STOC 2016
  • Computer Science, Physics, Mathematics
  • We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function, refuting the widely believed conjecture that the best such separation could only be quadratic (from Grover's algorithm). We also present a total function with a power 4 separation between quantum query complexity and approximate polynomial degree, showing severe limitations on the power of the polynomial method. Finally, we exhibit a total function with a quadratic gap… CONTINUE READING
    Separations in Communication Complexity Using Cheat Sheets and Information Complexity
    • 24
    • PDF
    Sculpting Quantum Speedups
    • 9
    • PDF
    An Optimal Separation of Randomized and Quantum Query Complexity
    • 1
    • PDF
    Separations in Query Complexity Based on Pointer Functions
    • 16
    • PDF
    Low-Sensitivity Functions from Unambiguous Certificates
    • 16
    • PDF
    Optimal separation and strong direct sum for randomized query complexity
    • 4
    • PDF
    Understanding Quantum Algorithms via Query Complexity
    • 22
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES
    Quantum lower bounds by polynomials
    • 384
    • Highly Influential
    • PDF
    Quantum Query Complexity of State Conversion
    • 120
    • Highly Influential
    • PDF
    Deterministic Communication vs. Partition Number
    • 108
    • Highly Influential
    • PDF
    Separations in query complexity based on pointer functions
    • 42
    • Highly Influential
    Approximating the AND-OR tree. Theory of Computing
    • 2013