|q⟩
Bad Qubits
Play
Quest
Questions
Learn
Playground
☕
← Question Bank
True / False
For the Deutsch problem (deciding whether a one-bit function
f
:
{
0
,
1
}
→
{
0
,
1
}
f:\{0,1\}\to\{0,1\}
f
:
{
0
,
1
}
→
{
0
,
1
}
is constant or balanced), a classical algorithm needs two oracle queries in the worst case because a single query never determines the class.
True
False
Check answer