Quantum pattern matching Oracle construction

05/06/2020
by   Vikram Menon, et al.
0

We propose a couple of oracle construction methods for quantum pattern matching. We in turn show that one of the construct can be used with the Grover's search algorithm for exact and partial pattern matching, deterministically. The other one also points to the matched indices, but primarily provides a means to generate the Hamming distance between the pattern to be searched and all the possible sub strings in the input string, in a probabilistic way.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2020

Quantum string comparison method

We propose a quantum string comparison method whose main building blocks...
research
03/01/2022

Quantum jumbled pattern matching

Let S_1, S_2 ∈Σ^* strings, we say that S_1 jumble match S_2 if they are ...
research
06/19/2023

Efficient Parameterized Pattern Matching in Sublinear Space

The parameterized matching problem is a variant of string matching, whic...
research
11/22/2017

Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations

We aim to speed up approximate keyword matching by storing a lightweight...
research
05/07/2019

Order-Preserving Pattern Matching Indeterminate Strings

Given an indeterminate string pattern p and an indeterminate string text...
research
09/07/2022

Nonoverlapping (delta, gamma)-approximate pattern matching

Pattern matching can be used to calculate the support of patterns, and i...
research
09/03/2021

Developing Mathematical Oracle Functions for Grover Quantum Search Algorithm

This article highlights some of the key operating principles of Grover a...

Please sign up or login with your details

Forgot password? Click here to reset