Constant-time solution to the global optimization problem using Br schweiler s ensemble search algorithm

DOI10.1088/0305-4470/36/24/104MaRDI QIDQ4450150zbMATH OpenOpenAlexFDO

Authors C. D'Helon, V. Protopopescu, J. Barhen

Publication date 15 February 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0301007

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Abstract: A constant-time solution of the continuous Global Optimization Problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Bruschweiler's ensemble search algorithm is applied. For adequate sensitivities of the measurement technique, the query complexity of the ensemble search algorithm depends linearly on the size of the function's domain. Advantages and limitations of an eventual NMR implementation are discussed.

Recommendations

• Constant-time solution to database searching by NMR ensemble computing
• scientific article; zbMATH DE number 2221958
• Solving a class of continuous global optimization problems using quantum algorithms
• Grover's Quantum Algorithm Applied to Global Optimization
• Combining a local search and Grover's algorithm in black-box global optimization

Cited in

(1)

• Quantum factorization algorithm by NMR ensemble computers

This page was built for publication: Constant-time solution to the global optimization problem using Br schweiler s ensemble search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450150)