Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
From MaRDI portal
Cites work
- Applying Grover's algorithm to AES: quantum resource estimates
- Calculus of variations and optimal control theory. A concise introduction
- Control theory from the geometric viewpoint.
- Deterministic quantum partial search for target states with proportion 1/16
- Group Theoretical Formulation of a Quantum Partial Search Algorithm
- scientific article; zbMATH DE number 3167340 (Why is no real title available?)
- scientific article; zbMATH DE number 3109695 (Why is no real title available?)
- Implementation of efficient quantum search algorithms on NISQ computers
- Implementing Grover oracles for quantum key search on AES and LowMC
- Optimization of partial search
- Ordinary differential equations.
- Quantum partial search for uneven distribution of multiple target items
- Quantum partial search of a database with several target items
- Quest for fast partial search algorithm
- Simple algorithm for partial quantum search
- Speeding up adiabatic passage with an optimal modified Roland–Cerf protocol
- Sure success partial search
This page was built for publication: Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322957)