One technique used when implementing these include one where an oracle function is used to partition a space into "good" and "bad" subspaces, known as amplitude amplification. Examples of these that are used to solve elemental distinctness problems and to find triangles in a graph utilize random walks that are defined by operators called coin and shift. The earliest ones were used to solve so-called (*) black box problems, while the most well-known of these reduces one problem to a period-finding problem and then uses a Fourier transform to find that period using Hadamard gates. In addition to one named for Deutsch and Josza, they include two well-known examples that are used to search an unsorted database and to al
One technique used when implementing these include one where an oracle function is used to partition a space into "good" and "bad" subspaces, known as amplitude amplification. Examples of these that are used to solve elemental distinctness problems and to find triangles in a graph utilize random walks that are defined by operators called coin and shift. The earliest ones were used to solve so-called (*) black box problems, while the most well-known of these reduces one problem to a period-finding problem and then uses a Fourier transform to find that period using Hadamard gates. In addition to one named for Deutsch and Josza, they include two well-known examples that are used to search an unsorted database and to allow for efficient factorization of large numbers, which can be used to break RSA encryption. For 10 points, name this type of algorithm, examples of which are named for Grover and Shor, which are performed on computers built out of qubits.
One technique used when implementing these include one where an oracle function is used to partition a space into "good" and "bad" subspaces, known as amplitude amplification.
{quantum algorithms} [“{algorithms}” is not {necessary} after it is {said}]