5 citations · 5 across the 3 of their papers we have counts for
1 paper · 2 filters
Daowen Qiu, Le Luo, Ligang Xiao
Let Boolean function f:{0,1}n⟶{0,1} where ∣{x∈{0,1}n∣f(x)=1}∣=a≥1. To search for an x∈{0,1}n with f(x)=1, by Grover's algorithm we can…