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...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Frontiers Media S.A.
2023-11-01
|
| Saila: | Frontiers in Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.frontiersin.org/articles/10.3389/fcomp.2023.1275948/full |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|