Quantum version of self-balanced binary search tree with strings as keys and applications

Kamil Khadiev; Syumbel Enikeeva

doi:10.1117/12.2624619

30 January 2022 Quantum version of self-balanced binary search tree with strings as keys and applications

Kamil Khadiev, Syumbel Enikeeva

Proceedings Volume 12157, International Conference on Micro- and Nano-Electronics 2021; 1215725 (2022) https://doi.org/10.1117/12.2624619
Event: International Conference on Micro- and Nano-Electronics 2021, 2021, Zvenigorod, Russian Federation

Abstract

In this paper, we present the data structure that implements the Self-Balanced Binary Search Tree with strings as keys and quantum comparing procedure. We cannot use the standard Self-Balanced Binary Search because of an error probability for the quantum comparing procedure. We can solve the issue using the standard success probability boosting technique. The presented data structure is more effective (in terms of running time) than using boosting technique. We apply the data structure for the Most Frequently String problem. So, we obtain a quantum algorithm for the problem that is faster than the existing quantum algorithm, and the best classical algorithm in the case of a significant part of the input strings (we mean O(n)) has a length that is at least ω((log n)²). Here n means the number of strings in a collection.

Citation Download Citation

Kamil Khadiev and Syumbel Enikeeva "Quantum version of self-balanced binary search tree with strings as keys and applications", Proc. SPIE 12157, International Conference on Micro- and Nano-Electronics 2021, 1215725 (30 January 2022); https://doi.org/10.1117/12.2624619

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available