Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm

Details Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm

2003-01-03

arxiv.org/abs/quant-ph/0301007v2

J. Phys. A 36(24) L399, 2003

Physics

Quantum Physics

14 pages, 0 figures

Scientific paper

10.1088/0305-4470/36/24/104

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.

Affiliated with

Also associated with

No associations

Rating

Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289802