Work

A quantum algorithm for string matching

Year: 2021

Type: article

Abstract: Algorithms that search for a pattern within a larger data-set appear ubiquitously in text and image processing. Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of length M inside a longer text of length N . Our algorithm has a time complexity of $$\tilde{O}(\sqrt{N})$$ O ̃ ( N ) , while the space complexity remains modest at O ( N + M ). We report the quantum gate counts relevant for both pre-fault-tolerant and fault-tolerant regimes.

Source: npj Quantum Information

DOI: 10.1038/s41534-021-00369-3

Authors: Pradeep Niroula, Yunseong Nam

Institutions: Joint Center for Quantum Information and Computer Science, Joint Quantum Institute, University of Maryland, College Park, IonQ (United States)

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $3,790

Funders: U.S. Department of Energy, Advanced Scientific Computing Research