Implementing pure adaptive search with Grover's quantum algorithm
From MaRDI portal
Recommendations
Cites work
- Hesitant adaptive search for global optimisation
- Hesitant adaptive search: The distribution of the number of iterations to convergence
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Improving hit-and-run for global optimization
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pure adaptive search for finite global optimization
- Pure adaptive search in global optimization
- Pure adaptive search in Monte Carlo optimization
Cited in
(12)- Trajectory optimization using quantum computing
- Evolutionary algorithms for quantum computers
- The robust constant and its applications in random global search for unconstrained global optimization
- A hybrid method for quantum global optimization
- Grover's Quantum Algorithm Applied to Global Optimization
- Quantum search algorithm for binary constant weight codes
- Conservation laws in quantum database search
- Scalable implementation of multi-qubit quantum grover search with atomic ensembles by adiabatic passage
- Backtracking adaptive search: distribution of number of iterations to convergence
- Combining a local search and Grover's algorithm in black-box global optimization
- Using modifications to Grover's search algorithm for quantum global optimization
- Generating functions and the performance of backtracking adaptive search
This page was built for publication: Implementing pure adaptive search with Grover's quantum algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411475)