Question: Problem 5.2 Show that, assuming that Grover's algorithm is optimal for unstructured search (meaning that any quantum algorithm finding a preimage of f : {0,1}

Problem 5.2 Show that, assuming that Grover's algorithm is optimal for unstructured search (meaning that any quantum algorithm finding a preimage of f : {0,1}" {0,1} requires (VN) queries to f), any quantum algorithm that finds the minimum of a function with high probability must also make 12(N) queries. Problem 5.2 Show that, assuming that Grover's algorithm is optimal for unstructured search (meaning that any quantum algorithm finding a preimage of f : {0,1}" {0,1} requires (VN) queries to f), any quantum algorithm that finds the minimum of a function with high probability must also make 12(N) queries
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
