Nalaganje...
Solving Set Cover with Pairs Problem using Quantum Annealing
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that plays an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solut...
Shranjeno v:
| izdano v: | Sci Rep |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Nature Publishing Group
2016
|
| Teme: | |
| Online dostop: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5037405/ https://ncbi.nlm.nih.gov/pubmed/27670578 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep33957 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|