Using modifications to Grover's search algorithm for quantum global optimization
From MaRDI portal
Publication:992656
DOI10.1016/j.ejor.2010.05.039zbMath1205.90231OpenAlexW1972826039MaRDI QIDQ992656
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.039
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Quantum computation (81P68)
Related Items (3)
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm ⋮ A hybrid method for quantum global optimization ⋮ A new hybrid classical-quantum algorithm for continuous global optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- Pure adaptive search in Monte Carlo optimization
- Pure adaptive search in global optimization
- Implementing pure adaptive search with Grover's quantum algorithm
- Average performance of greedy heuristics for the integer knapsack problem.
- Unbounded knapsack problem: Dynamic programming revisited
- Pure adaptive search for finite global optimization
- Stopping and restarting strategy for stochastic sequential search in global optimization
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Sensitivity analysis of a greedy heuristic for knapsack problems
- A hard knapsack problem
- Hard Knapsack Problems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Grover's Quantum Algorithm Applied to Global Optimization
- On uniform covering, adaptive random search and raspberries
This page was built for publication: Using modifications to Grover's search algorithm for quantum global optimization
