Quantum algorithms for learning hidden strings with applications to matroid problems
From MaRDI portal
Publication:6199225
DOI10.1016/j.tcs.2023.114255arXiv2211.10667MaRDI QIDQ6199225
Shihao Zhang, Lvzhou Li, Xiaowei Huang
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.10667
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum pattern matching fast on average
- Quantum counterfeit coin problems
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- Enumerating bases of self-dual matroids
- On the problem of approximating the number of bases of a matroid
- Reverse search for enumeration
- Matroids with nine elements
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Reconstructing Strings from Substrings with Quantum Queries
- Some Problems on Approximate Counting in Graphs and Matroids
- A fast string searching algorithm
- Rapid solution of problems by quantum computation
- Fast Pattern Matching in Strings
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Fastest Pattern Matching in Strings
- Quantum Complexity Theory
- On the Abstract Properties of Linear Dependence
- Information Theory of DNA Shotgun Sequencing
- Enumerating Spanning and Connected Subsets in Graphs and Matroids
- On the Complexity of Some Enumeration Problems for Matroids
- Matroids and the greedy algorithm
This page was built for publication: Quantum algorithms for learning hidden strings with applications to matroid problems
