Corpus ID: 118063418

String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time

@article{Ramesh2000StringMI,
  title={String Matching in \$\{\tilde O\}(\sqrt\{n\}+\sqrt\{m\})\$ Quantum Time},
  author={H. Ramesh and V. Vinay},
  journal={arXiv: Quantum Physics},
  year={2000}
}
  • H. Ramesh, V. Vinay
  • Published 2000
  • Mathematics, Physics
  • arXiv: Quantum Physics
  • We show how to determine whether a given pattern p of length m occurs in a given text t of length n in ${\tilde O}(\sqrt{n}+\sqrt{m})$\footnote{${\tilde O}$ allows for logarithmic factors in m and $n/m$} time, with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called {\em Deterministic Sampling}. 
    2 Citations
    Efficient distributed quantum computing
    • 89
    • PDF
    Introduction to Recent Quantum Algorithms
    • 2

    References

    SHOWING 1-4 OF 4 REFERENCES
    A fast quantum mechanical algorithm for database search
    • 4,715
    • PDF
    Tight bounds on quantum searching
    • 939
    • PDF
    Deterministic Sampling - A New Technique for Fast Pattern Matching
    • U. Vishkin
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1991
    • 81
    • Highly Influential
    • PDF
    Quantum Counting
    • 334
    • PDF