Posiform planting: generating QUBO instances for benchmarking
We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unkno...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Frontiers Media S.A.
2023-11-01
|
| Σειρά: | Frontiers in Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://www.frontiersin.org/articles/10.3389/fcomp.2023.1275948/full |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|