dorsal/arxiv
View SchemaConstant-time solution to the Global Optimization Problem using Bruschweiler's ensemble search algorithm
| Authors | V. Protopopescu, C. D'Helon, J. Barhen |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0301007 |
| URL | https://arxiv.org/abs/quant-ph/0301007 |
| DOI | 10.1088/0305-4470/36/24/104 |
| Journal | J. Phys. A 36(24) L399, 2003 |
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.
{
"annotation_id": "3d88a047-b48c-43e7-bbc0-0e3db2ba41f1",
"date_created": "2026-03-02T18:01:56.194000Z",
"date_modified": "2026-03-02T18:01:56.194000Z",
"file_hash": "7ef6ef4c8b89a8dd054a9f079bf0126e100f3feb8df7ab3b4788af66c1b606a0",
"private": false,
"record": {
"abstract": "A constant-time solution of the continuous Global Optimization Problem (GOP)\nis obtained by using an ensemble algorithm. We show that under certain\nassumptions, the solution can be guaranteed by mapping the GOP onto a discrete\nunsorted search problem, whereupon Bruschweiler\u0027s ensemble search algorithm is\napplied. For adequate sensitivities of the measurement technique, the query\ncomplexity of the ensemble search algorithm depends linearly on the size of the\nfunction\u0027s domain. Advantages and limitations of an eventual NMR implementation\nare discussed.",
"arxiv_id": "quant-ph/0301007",
"authors": [
"V. Protopopescu",
"C. D\u0027Helon",
"J. Barhen"
],
"categories": [
"quant-ph"
],
"doi": "10.1088/0305-4470/36/24/104",
"journal_ref": "J. Phys. A 36(24) L399, 2003",
"title": "Constant-time solution to the Global Optimization Problem using Bruschweiler\u0027s ensemble search algorithm",
"url": "https://arxiv.org/abs/quant-ph/0301007"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "b56ec079-5946-455e-99f5-8fcfff18a459",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}