Quantum algorithms for string processing

DOI10.1007/978-3-030-87809-2_1OpenAlexW3110165119MaRDI QIDQ2091414

Nailya Salihova, Farid M. Ablayev, Marat Ablayev, Alexander V. Vasiliev, Kamil Khadiev

Publication date: 1 November 2022

Full work available at URL: https://arxiv.org/abs/2012.00372

Mathematics Subject Classification ID

Algorithms on strings (68W32) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Deterministic construction of QFAs based on the quantum fingerprinting technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum pattern matching fast on average
• String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
• Quantum Computation and Quantum Information
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
• UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
• Quantum Query Complexity of Some Graph Problems

This page was built for publication: Quantum algorithms for string processing