A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
From MaRDI portal
(Redirected from Publication:3534103)
Recommendations
Cites work
Cited in
(14)- Quantum algorithm design: techniques and applications
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- A low failure rate quantum algorithm for searching maximum or minimum
- Quantum algorithm for protein folding and its computational complexity
- On quantum algorithm for binary search and its computational complexity
- scientific article; zbMATH DE number 5320369 (Why is no real title available?)
- QUANTUM ALGORITHMS FOR OPTIMIZATION USING ASYMPTOTIC QUANTUM SEARCH
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- A quantum algorithm of the computation of core in rough set
- A quantum interior-point predictor–corrector algorithm for linear programming
- A quantum search algorithm of two-dimensional convex hull
- Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
- Non-Boolean quantum amplitude amplification and quantum mean estimation
- Quantum cooperative search algorithm for 3-sat
This page was built for publication: A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534103)