-
Book Overview & Buying
-
Table Of Contents
A Practical Guide to Quantum Computing
By :
We now have a general picture of what Grover’s algorithm is capable of doing, but, before we can discuss all of its details, we should fix some notation and make our hypotheses and conditions clear.
In the search problem that we will be working with through this section, we will consider an n -bit Boolean function f(x) = f(x1, … ,xn), and we will assume that f(x) = 0 for all possible inputs x except for a single n -bit marked string, s , for which f(s) = 1. Our goal is to find that n -bit string s . Later in this section, we will see what can be done if the number of marked strings (strings that make f return 1) is any fixed number k , but, for now, we will keep things simple and assume that only one input verifies this condition.
This framework might not seem too powerful at first, but it can actually encode any search problem. Assume, for example, that you have an unsorted database with a billion entries laid out in an array-like form, where...