The paper “fixed-pointquantumcontinuoussearchalgorithm with optimal query complexity’’[1] presents another interesting application of quantumsearchalgorithms by addressing one of the long-standing challenges ...
详细信息
The paper “fixed-pointquantumcontinuoussearchalgorithm with optimal query complexity’’[1] presents another interesting application of quantumsearchalgorithms by addressing one of the long-standing challenges in quantum computing:how to efficiently perform search over continuous domains. While Grover’s algorithm has been a cornerstone in discrete quantumsearch with its well-known quadratic speedup [2], many real-world problems—ranging from high-dimensional optimization to spectral analysis of infinite dimensional operators—require searching over continuous, uncountably infinite solution spaces.
暂无评论