|q⟩
Bad Qubits
Play
Quest
Questions
Learn
Playground
☕
← Question Bank
Multiple choice
Resource estimate for Grover search on
n
=
8
n=8
n
=
8
qubits (
N
=
2
8
=
256
N=2^8=256
N
=
2
8
=
256
items). The optimal iteration count is
k
=
⌊
(
π
/
4
)
N
⌋
k=\lfloor(\pi/4)\sqrt{N}\rfloor
k
=
⌊(
π
/4
)
N
⌋
. Each Grover iterate uses 5 Toffoli gates and each Toffoli costs 7 T-gates. What is the total T-gate count
k
⋅
5
⋅
7
k \cdot 5 \cdot 7
k
⋅
5
⋅
7
?
455 (rounding up to
k
=
13
k=13
k
=
13
instead of flooring)
35 (T-gates per single iterate)
84 (only one iterate's T-gates)
420
Check answer