From f137240df969d8c817ba0f47bb84754074079572 Mon Sep 17 00:00:00 2001 From: Joey Carter Date: Wed, 6 Nov 2024 09:36:37 -0500 Subject: [PATCH] Editorial change --- .../tutorial_qjit_compile_grovers_algorithm_with_catalyst.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/demonstrations/tutorial_qjit_compile_grovers_algorithm_with_catalyst.py b/demonstrations/tutorial_qjit_compile_grovers_algorithm_with_catalyst.py index 31ca880405..fbdff18ba8 100644 --- a/demonstrations/tutorial_qjit_compile_grovers_algorithm_with_catalyst.py +++ b/demonstrations/tutorial_qjit_compile_grovers_algorithm_with_catalyst.py @@ -14,7 +14,7 @@ # performing :math:`O(\sqrt{N})` queries on the database, whereas a classical search algorithm would # require :math:`O(N)` queries to perform the same task. # -# More formally, the problem is defined as a search for a string of bits in a list containing +# More formally, the *unstructured search problem* is defined as a search for a string of bits in a list containing # :math:`N` items given an *oracle access function* :math:`f(x).` This function is defined such that # :math:`f(x) = 1` if :math:`x` is the bitstring we are looking for (the *solution*), and # :math:`f(x) = 0` otherwise. The generalized form of Grover's algorithm accepts :math:`M`