A quantum algorithm for string matching
Journal Article
·
· npj Quantum Information
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})$$$$ , 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.
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- SC0020312; SC0019040
- OSTI ID:
- 1765937
- Alternate ID(s):
- OSTI ID: 1852787
- Journal Information:
- npj Quantum Information, Journal Name: npj Quantum Information Journal Issue: 1 Vol. 7; ISSN 2056-6387
- Publisher:
- Nature Publishing GroupCopyright Statement
- Country of Publication:
- United Kingdom
- Language:
- English
Similar Records
The diphoton $$q_T$$ spectrum at N$$^3$$LL$$^\prime $$ + NNLO
PANDA as midrapidity detector for a future HESR Collider at FAIR
Ion trap long-range XY model for quantum state transfer and optimal spatial search
Journal Article
·
Thu Oct 14 00:00:00 EDT 2021
· European Physical Journal. C, Particles and Fields
·
OSTI ID:1825784
PANDA as midrapidity detector for a future HESR Collider at FAIR
Journal Article
·
Mon Jun 01 00:00:00 EDT 2020
· European Physical Journal. A
·
OSTI ID:1800792
Ion trap long-range XY model for quantum state transfer and optimal spatial search
Journal Article
·
Mon Jun 12 00:00:00 EDT 2023
· Quantum Science and Technology
·
OSTI ID:1984726