An optimal quantum algorithm for the oracle identification problem
From MaRDI portal
Publication:2965510
DOI10.4230/LIPICS.STACS.2014.482zbMATH Open1359.68090arXiv1311.7685MaRDI QIDQ2965510FDOQ2965510
Authors: Robin Kothari 
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1311.7685
Recommendations
Cited In (22)
- Optimal quantum sample complexity of learning algorithms
- Reconstructing strings from substrings with quantum queries
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Optimality proofs of quantum weight decision algorithms
- Classical and Quantum Algorithms for Assembling a Text from a Dictionary
- Oracles with costs
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
- Robust Quantum Algorithms with ε-Biased Oracles
- Single-query learning from abelian and non-abelian Hamming distance oracles
- Quantum algorithm for dynamic programming approach for DAGs and applications
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
- Quantum identification of Boolean oracles
- Quantum query complexity of almost all functions with fixed on-set size
- STACS 2004
- Quantum bounds for 2D-grid and Dyck language
- Learning bounds for quantum circuits in the agnostic setting
- Improved algorithms for quantum identification of Boolean oracles
- Improved Algorithms for Quantum Identification of Boolean Oracles
- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems
- Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials
- 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)
