Affordable Access

deepdyve-link
Publisher Website

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

Authors
  • Protopopescu, V.
  • D'Helon, C.
  • Barhen, J.
Type
Published Article
Publication Date
Jun 26, 2003
Submission Date
Jan 03, 2003
Identifiers
DOI: 10.1088/0305-4470/36/24/104
arXiv ID: quant-ph/0301007
Source
arXiv
License
Unknown
External links

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.

Report this publication

Statistics

Seen <100 times