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...
שמור ב:
| Principais autores: | , , , , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Nature Portfolio
2025-05-01
|
| סדרה: | npj Quantum Information |
| גישה מקוונת: | https://doi.org/10.1038/s41534-025-01020-1 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|