Search NASA⌕ Search

DOE OSTI · 1852787

A quantum algorithm for string matching

Also available from

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 $\tildeO$($\sqrt{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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Niroula, Pradeep, Nam, Yunseong (ORCID:0000000227423447). 2021-02-16. A quantum algorithm for string matching. https://doi.org/10.1038/s41534-021-00369-3. https://searchnasa.com/record/osti%3A1852787/a-quantum-algorithm-for-string-matching

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related reports