A quantum algorithm for string matching

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:npj quantum information Ročník 7; číslo 1; s. 1 - 5
Hlavní autoři: Niroula, Pradeep, Nam, Yunseong
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Nature Publishing Group UK 16.02.2021
Nature Publishing Group
Nature Portfolio
Témata:
639/705/117
639/766/483/481
Algorithms
Classical and Quantum Gravitation
Image processing
Physics
Physics and Astronomy
Quantum Computing
Quantum Field Theories
Quantum Information Technology
Quantum Physics
Relativity Theory
Spintronics
String Theory
ISSN:2056-6387, 2056-6387
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
USDOE
DESC0019040; SC0020312
ISSN:2056-6387
2056-6387
DOI:10.1038/s41534-021-00369-3