An optimal quantum algorithm for the oracle identification problem
From MaRDI portal
Publication:2965510
Recommendations
Cited in
(22)- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
- Oracles with costs
- Reconstructing strings from substrings with quantum queries
- Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials
- Quantum identification of Boolean oracles
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
- Optimal quantum sample complexity of learning algorithms
- Improved algorithms for quantum identification of Boolean oracles
- Learning bounds for quantum circuits in the agnostic setting
- Optimality proofs of quantum weight decision algorithms
- Quantum algorithm for dynamic programming approach for DAGs and applications
- Quantum query complexity of almost all functions with fixed on-set size
- Single-query learning from abelian and non-abelian Hamming distance oracles
- Improved Algorithms for Quantum Identification of Boolean Oracles
- STACS 2004
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
- Classical and Quantum Algorithms for Assembling a Text from a Dictionary
- Quantum bounds for 2D-grid and Dyck language
- Robust Quantum Algorithms with ε-Biased Oracles
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum algorithms for string processing
This page was built for publication: An optimal quantum algorithm for the oracle identification problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965510)
