Quantum Pattern Matching Fast on Average

The d -dimensional pattern matching problem is to find an occurrence of a pattern of length m × ⋯ × m within a text of length n × ⋯ × n , with n ≥ m . This task models various problems in text and image processing, among other application areas. This work describes a quantum algorithm which solves t...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 77; no. 1; pp. 16 - 39
Main Author:	Montanaro, Ashley
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2017 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Image processing Mathematics of Computing Pattern matching Theory of Computation Quantum algorithms Average-case complexity Pattern matching Quantum query complexity
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!