On the hardness of quadratic unconstrained binary optimization problems
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving man...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Frontiers Media S.A.
2022-08-01
|
| Σειρά: | Frontiers in Physics |
| Θέματα: | |
| Διαθέσιμο Online: | https://www.frontiersin.org/articles/10.3389/fphy.2022.956882/full |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|