کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478598 | 1446115 | 2010 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Using modifications to Grover’s Search algorithm for quantum global optimization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We study the problem of finding a global optimal solution to discrete optimization problems using a heuristic based on quantum computing methods. (Knowledge of quantum computing ideas is not necessary to read this paper.) We focus on a successful quantum computing method introduced by Baritompa, Bulger, and Wood, that we refer to as the BBW algorithm, and develop two modifications. First, we modify the BBW algorithm to achieve a dramatic speedup that lets us extend the known BBW static schedule from 33 to 43 points, thereby increasing its applicability. We further modify it by converting it from a static method to a dynamic one. Experimental results show the value of this latter modification.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 207, Issue 2, 1 December 2010, Pages 620–632
Journal: European Journal of Operational Research - Volume 207, Issue 2, 1 December 2010, Pages 620–632
نویسندگان
Yipeng Liu, Gary J. Koehler,