Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm
量子物理
2009-11-10 v2
摘要
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.
引用
@article{arxiv.quant-ph/0301007,
title = {Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm},
author = {V. Protopopescu and C. D'Helon and J. Barhen},
journal= {arXiv preprint arXiv:quant-ph/0301007},
year = {2009}
}
备注
14 pages, 0 figures