|
Title:
|
A QUANTUM ALGORITHM FOR STRING MATCHING |
|
Author(s):
|
Evangelos Tzanis |
|
ISBN:
|
972-99353-6-X |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2005 |
|
Edition:
|
2 |
|
Keywords:
|
Quantum Computing, String matching algorithms. |
|
Type:
|
Short Paper |
|
First Page:
|
374 |
|
Last Page:
|
377 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
In this paper we study an extension of the work of Dürr and Hoyer in which we find the leftmost 1-bit of one binary string in()Ontime, (where n is string's length). Using this result we deal with the problem: given a text t of length n and a pattern p of length m, find the left most occurrence of p in t. We relate our contribution with the work of [1]. In the second part of our paper we discuss an extension of Shor's algorithm. |
|
|
|
|
|
|
