An Oracle Design for Grover’s Quantum Search Algorithm for Solving the Exact String Matching Problem

Aborot, Jeffrey

doi:10.1142/9789813279674_0003

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is based on the First One search algorithm [26,49,55,56,35] that is a modification of Grover's search algorithm [30,22]. The procedure in different forms was discussed in several papers [18,38,9,42,35,48,51]. The main property of the subroutine is presented in the following lemma.…”

Section: The Text Assembling Problemmentioning

confidence: 99%

Preparing to Olympiads in Informatics in Tatarstan Republic, Russia. The Experience of Kazan Federal University

HADIEV¹,

KHADIEV²

2016

IOI

View full text Add to dashboard Cite

In the paper we describe the part of the history of Olympiads in informatics in the Tatarstan Republic, Russia which connected with the Kazan Federal University. It began in the 80s of XX century and now there are several centres of Olympiads in informatics in Tatarstan and one of them is the Kazan Federal University. In the second part of the paper we describe the current approach to organize the lessons on informatics. The main idea is a seamless transition from "lessons 1.0"(teacher prepares all materials for students) to "lessons 2.0"(students prepare all materials for students), like the transition from Web 1.0 to Web 2.0.

show abstract

Section: The Text Assembling Problemmentioning

confidence: 99%

Preparing to Olympiads in Informatics in Tatarstan Republic, Russia. The Experience of Kazan Federal University

HADIEV¹,

KHADIEV²

2016

IOI

View full text Add to dashboard Cite

show abstract

“…We call s a completion of t if t is a prefix of s. Assume that L is the total sum of all lengths of strings from all queries. We solve the problem using quantum string comparing algorithm [35][36][37][38][39] and noisy Red-Black tree. The running time of the quantum algorithm is O( √ nL log n).…”

Section: Introductionmentioning

confidence: 99%

Noisy Tree Data Structures and Quantum Applications

Khadiev,

Savelyev,

Ziatdinov

et al. 2023

Mathematics

View full text Add to dashboard Cite

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.

show abstract

Quantum Algorithm for Searching of Two Sets Intersection

Khadiev,

Krendeleva

2023

Russ Microelectron

View full text Add to dashboard Cite

An Oracle Design for Grover’s Quantum Search Algorithm for Solving the Exact String Matching Problem

Cited by 3 publications

References 0 publications

Preparing to Olympiads in Informatics in Tatarstan Republic, Russia. The Experience of Kazan Federal University

Preparing to Olympiads in Informatics in Tatarstan Republic, Russia. The Experience of Kazan Federal University

Noisy Tree Data Structures and Quantum Applications

Quantum Algorithm for Searching of Two Sets Intersection

Contact Info

Product

Resources

About