Eliminating knowledge of the optimal random block length

Determine whether the averaged-walk search algorithm can remove or reduce its requirement to know the product \(\pi(m)HT(m)\) when selecting the block-length parameter.

Background

The proved tradeoff requires choosing a block-length scale τ\tau satisfying τ≥π(m)HT(m)\tau\geq \pi(m)HT(m), with the recommended choice τ=⌈π(m)HT(m)⌉\tau=\lceil\pi(m)HT(m)\rceil. Thus, applying the algorithm as stated presupposes knowledge of the stationary probability of the marked state and its stationary-start hitting time.

The conclusion identifies removing or reducing this parameter-knowledge requirement as one of the paper’s main open directions.

References

The main open directions are to understand the right analogue for multiple marked states, remove or reduce the need to know \pi(m)HT(m), and determine whether the theorem is useful as a black-box classical component in quantum walk search constructions.

— Optimizing Both Checking and Update Costs in Random Walk Search  (2609.18833 - Apers et al., 16 Sep 2026) in Section 7, “Conclusion”