Unknown

Dataset Information

0

Solving Set Cover with Pairs Problem using Quantum Annealing.


ABSTRACT: 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 solution of SCP instances. We numerically simulate the time-dependent Schrödinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction on the D-wave type restricted Ising Hamiltonian based on Chimera graphs. Our embedding on the Chimera graph preserves the structure of the original SCP instance and in particular, the embedding for general complete bipartite graphs and logical disjunctions may be of broader use than that the specific problem we deal with.

SUBMITTER: Cao Y 

PROVIDER: S-EPMC5037405 | BioStudies | 2016-01-01

REPOSITORIES: biostudies

Similar Datasets

2020-01-01 | S-EPMC7033176 | BioStudies
2015-01-01 | S-EPMC4459189 | BioStudies
2019-01-01 | S-EPMC6534389 | BioStudies
2016-01-01 | S-EPMC5034318 | BioStudies
1000-01-01 | S-EPMC4103701 | BioStudies
2020-01-01 | S-EPMC7224393 | BioStudies
2018-01-01 | S-EPMC5740224 | BioStudies
2020-01-01 | S-EPMC7568302 | BioStudies
2017-01-01 | S-EPMC5472748 | BioStudies
2016-01-01 | S-EPMC5566114 | BioStudies