Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items x1, . . . , xn and we would like