Pages that link to "Item:Q2965510"
From MaRDI portal
The following pages link to An optimal quantum algorithm for the oracle identification problem (Q2965510):
Displaying 16 items.
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE (Q2027276) (← links)
- Quantum algorithms for string processing (Q2091414) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Learning bounds for quantum circuits in the agnostic setting (Q2685576) (← links)
- Robust Quantum Algorithms with ε-Biased Oracles (Q3591325) (← links)
- (Q4614114) (← links)
- STACS 2004 (Q5309692) (← links)
- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis (Q5375221) (← links)
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415) (← links)
- Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials (Q6181198) (← links)
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems (Q6536370) (← links)
