RealFeedApp Tight bound Θ_k(N^{1-2/k}) proven for even k≥4
Researchers established a tight bound of Θ(N^(1-2/k)) for even k and a lower bound of Ω(N^(1-2/(k-1))) for odd k. The study characterizes the randomized classical query complexity of cyclic Forrelation.
#quantum computing#complexity theory#cyclic forrelation#query complexity
