Quantum algorithm for learning secret strings and its experimental demonstration
From MaRDI portal
Publication:2111665
DOI10.1016/J.PHYSA.2022.128372OpenAlexW4310725862MaRDI QIDQ2111665FDOQ2111665
Lvzhou Li, Shihao Zhang, Yong-Zhen Xu
Publication date: 17 January 2023
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11221
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum algorithms revisited
- Quantum Complexity Theory
- Title not available (Why is that?)
- Rapid solution of problems by quantum computation
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Algorithms on Strings
- Title not available (Why is that?)
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Parallel detection of all palindromes in a string
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum pattern matching fast on average
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- Efficient quantum circuits for diagonal unitaries without ancillas
- Quantum counterfeit coin problems
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- The query complexity of a permutation-based variant of mastermind
- Reconstructing Strings from Substrings with Quantum Queries
- Asymptotically optimal circuits for arbitrary \(n\)-qubit diagonal computations
- Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Information Theory of DNA Shotgun Sequencing
Cited In (1)
This page was built for publication: Quantum algorithm for learning secret strings and its experimental demonstration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111665)
