A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM

DOI10.1142/S021974990800361XzbMath1192.81085OpenAlexW1996379879WikidataQ62562208 ScholiaQ62562208MaRDI QIDQ3534103

Luis Anotnio Brasil Kowada, Carille Lavor, Celina M. Herrera de Figueiredo, Renato Portugal

Publication date: 3 November 2008

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021974990800361x

zbMATH Keywords

quantum algorithmsminimum searching problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (5)

Non-Boolean quantum amplitude amplification and quantum mean estimation ⋮ Quantum algorithm design: techniques and applications ⋮ A new hybrid classical-quantum algorithm for continuous global optimization problems ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem ⋮ A quantum interior-point predictor–corrector algorithm for linear programming

Cites Work

• NP-complete decision problems for binary quadratics
• Unnamed Item

This page was built for publication: A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM