Year: 2023
Type: article
Abstract: We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy segment tree. The asymptotic complexity of the main operations for the tree data structures does not change compared to the case without noise. We apply the data structures in quantum algorithms for several problems on strings like the string-sorting problem and auto-complete problem. For both problems, we obtain quantum speed-up. Moreover, for the string-sorting problem, we show a quantum lower bound.
Source: Mathematics
DOI: 10.3390/math11224707
Authors: Kamil Khadiev, Nikita Savelyev, Mansur Ziatdinov, Denis Melnikov
Institutions: Kazan Federal University, Intel (Germany)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,336
Funder: Kazan Federal University
Award: G1709152956
OpenAlex ID: W4388823227