Solving Set Cover with Pairs Problem using Quantum Annealing
<p dir="ltr">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 gr...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Published: |
2016
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|