Post-selected Classical Query Complexity

14 May 2018 Cade Chris

We study classical query algorithms with post-selection, and find that they are closely connected to rational functions with nonnegative coefficients. We show that the post-selected classical query complexity of a Boolean function is equal to the minimal degree of a rational function with nonnegative coefficients that approximates it (up to a factor of two)... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • QUANTUM PHYSICS