Quantum algorithm for search of longest segment of elements satisfying a predicate
Abstract:
In the framework of this work, we consider the problem of finding the longest segment of elements satisfying some predicate. For a task search for the longest segment that satisfies the predicate exists quantum algorithm with running time O(√n log n), where n - the length of the input set.
