|q⟩
Bad Qubits
Play
Quest
Questions
Learn
Playground
☕
← Question Bank
Multiple choice
Grover search over
N
=
16
N = 16
N
=
16
items with
M
=
1
M = 1
M
=
1
solution. The optimal iteration count is
⌊
(
π
/
4
)
N
/
M
⌋
\lfloor (\pi/4)\sqrt{N/M} \rfloor
⌊(
π
/4
)
N
/
M
⌋
. How many iterations?
🔬 try it before you answer
2
12
3
4
Check answer