Quantum algorithm for learning secret strings and its experimental demonstration
From MaRDI portal
Publication:2111665
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A fast string searching algorithm
- Algorithms on Strings
- Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Asymptotically optimal circuits for arbitrary \(n\)-qubit diagonal computations
- Efficient quantum circuits for diagonal unitaries without ancillas
- Fast Pattern Matching in Strings
- Information Theory of DNA Shotgun Sequencing
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Parallel detection of all palindromes in a string
- Quantum Complexity Theory
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum algorithms revisited
- Quantum counterfeit coin problems
- Quantum pattern matching fast on average
- Rapid solution of problems by quantum computation
- Reconstructing strings from substrings with quantum queries
- String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
- The query complexity of a permutation-based variant of mastermind
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)