Quantum string matching unfolded and extended

DOI10.1007/978-3-031-38100-3_9MaRDI QIDQ6148114

Arianna Pavone, Simone Faro, Domenico Cantone

Publication date: 11 January 2024

Published in: Reversible Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Quantum pattern matching fast on average
• String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
• Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity
• Quantum Circuits with Unbounded Fan-out
• Pattern Matching with Swaps for Short Patterns in Linear Time
• Fast Pattern Matching in Strings
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum lower bounds by polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum string matching unfolded and extended