Quantum path parallelism: a circuit-based approach to text searching

DOI10.1007/978-981-97-2340-9_21MaRDI QIDQ6636089zbMATH OpenFDO

Authors Simone Faro, Arianna Pavone, C. Viola

Publication date 12 November 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 845841 (Why is no real title available?)
• Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
• Pattern Matching with Swaps
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
• Quantum pattern matching fast on average
• Quantum random access memory
• Quantum string matching unfolded and extended
• String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time

This page was built for publication: Quantum path parallelism: a circuit-based approach to text searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636089)