String matching in Õ(sqrt(n)+sqrt(m)) quantum time
暂无分享,去创建一个
We show how to determine whether a given pattern p of length m occurs in a given text t of length n in O(√n+√m) time (where O allows for logarithmic factors in m and n/m) with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling.
[1] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[2] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[3] Gilles Brassard,et al. Quantum Counting , 1998, ICALP.
[4] Uzi Vishkin,et al. Deterministic sampling—a new technique for fast pattern matching , 1990, STOC '90.
[5] Christoph Dürr,et al. A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.