Quantum path parallelism: a circuit-based approach to text searching
From MaRDI portal
Publication:6636089
DOI10.1007/978-981-97-2340-9_21MaRDI QIDQ6636089FDOQ6636089
Authors: Simone Faro, Arianna Pavone, C. Viola 
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern Matching with Swaps
- Quantum random access memory
- Title not available (Why is that?)
- Quantum pattern matching fast on average
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Quantum string matching unfolded and extended
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)
