|q⟩
Bad Qubits
Play
Quest
Questions
Learn
Playground
☕
← Question Bank
Multiple choice
An unstructured search over
N
=
2
6
=
64
N = 2^6 = 64
N
=
2
6
=
64
items has a single marked item. Using Grover's algorithm, the optimal number of oracle queries is
r
o
u
n
d
(
(
π
/
4
)
N
−
1
/
2
)
\mathrm{round}((\pi/4)\sqrt{N} - 1/2)
round
((
π
/4
)
N
−
1/2
)
. How many quantum oracle queries does this give for
N
=
64
N = 64
N
=
64
?
32
6
64
8
Check answer