Quantum annealing for combinatorial optimization: a benchmarking study
Abstract Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did n...
Сохранить в:
| Главные авторы: | , , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Nature Portfolio
2025-05-01
|
| Серии: | npj Quantum Information |
| Online-ссылка: | https://doi.org/10.1038/s41534-025-01020-1 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|