There are total Boolean functions whose bounded-error randomized query complexity cannot obey any universal bound of the form O((1+Q(f))^α) with α<4, where Q is bounded-error quantum query complexity.
There are total Boolean functions whose bounded-error randomized query complexity cannot obey any universal bound of the form O((1+Q(f))^α) with α<4, where Q is bounded-error quantum query complexity.
There are total Boolean functions whose bounded-error randomized query complexity cannot obey any universal bound of the form O((1+Q(f))^α) with α<4, where Q is bounded-error quantum query complexity.
If correct, makes the quartic exponent of the general randomized-versus-quantum query upper bound optimal.
Is the quartic randomized-versus-quantum query bound optimal for total functions?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
