تقرير
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
| العنوان: | NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems |
|---|---|
| المؤلفون: | Au-Yeung, Rhonda, Chancellor, Nicholas, Halffmann, Pascal |
| المصدر: | Front. Quantum. Sci. Technol., 23 February 2023, Quantum Engineering Volume 2 |
| سنة النشر: | 2022 |
| المجموعة: | Mathematics Quantum Physics |
| مصطلحات موضوعية: | Quantum Physics, Mathematics - Optimization and Control, 90C27, 68Q12, 81P68, 01A67 |
| الوصف: | In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor's algorithm through experiments to the era of noisy intermediate scale quantum devices (NISQ) for solving real-world problems. It is likely that quantum methods can efficiently solve certain (NP-)hard optimization problems where classical approaches fail. In our perspective, we examine the field of quantum optimization where we solve optimisation problems using quantum computers. We demonstrate this through a proper use case and discuss the current quality of quantum computers, their solver capabilities, and benchmarking difficulties. Although we show a proof-of-concept rather than a full benchmark, we use the results to emphasize the importance of using appropriate metrics when comparing quantum and classical methods. We conclude with discussion on some recent quantum optimization breakthroughs and the current status and future directions. Comment: 15 pages, 3 figure, submitted to Frontiers in Quantum Science and Technology, section Quantum Engineering |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.3389/frqst.2023.1128576 |
| URL الوصول: | http://arxiv.org/abs/2212.10990 |
| رقم الأكسشن: | edsarx.2212.10990 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.3389/frqst.2023.1128576 |
|---|