Optimization of partial search
From MaRDI portal
Recommendations
- Optimal Search
- Quest for fast partial search algorithm
- Optimization by pattern search
- scientific article; zbMATH DE number 3943543
- Optimal probabilistic search
- scientific article; zbMATH DE number 4100947
- Approximate parametric searching
- scientific article; zbMATH DE number 18751
- Optimization via rejection-free partial neighbor search
Cited in
(22)- A review on quantum search algorithms
- Fast quantum search algorithm for databases of arbitrary size and its implementation in a cavity QED system
- Quantum partial search for uneven distribution of multiple target items
- Quantum partial search algorithm with smaller oracles for multiple target items
- Sure success partial search
- Quantum partial search of a database with several target items
- Simple algorithm for partial quantum search
- Implementation of efficient quantum search algorithms on NISQ computers
- The Relation Between Complete and Incomplete Search
- A spin iteration quantum search algorithm
- Workflow of the Grover algorithm simulation incorporating CUDA and GPGPU
- HIERARCHICAL QUANTUM SEARCH
- Hierarchical quantum search
- Hierarchical quantum search
- Optimality proofs of quantum weight decision algorithms
- Quantum search algorithms
- Chebyshev functions of half-integer order
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Performance analysis of the hardware-efficient quantum search algorithm
- Deterministic quantum partial search for target states with proportion 1/16
- Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm
- Quest for fast partial search algorithm
This page was built for publication: Optimization of partial search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374184)
