Solving Set Cover with Pairs Problem using Quantum Annealing

Yudong Cao, Shuxian Jiang, Debbie Perouli, Sabre Kais

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Article number33957
JournalScientific Reports
Volume6
DOIs
Publication statusPublished - 27 Sep 2016

Fingerprint

Set Cover
Annealing
Ising
Biochemistry
Complete Bipartite Graph
Computational Biology
Graph in graph theory
Combinatorial Optimization Problem
Networking
Simulated Annealing
Ground State
NP-complete problem

ASJC Scopus subject areas

  • General

Cite this

Solving Set Cover with Pairs Problem using Quantum Annealing. / Cao, Yudong; Jiang, Shuxian; Perouli, Debbie; Kais, Sabre.

In: Scientific Reports, Vol. 6, 33957, 27.09.2016.

Research output: Contribution to journalArticle

Cao, Yudong ; Jiang, Shuxian ; Perouli, Debbie ; Kais, Sabre. / Solving Set Cover with Pairs Problem using Quantum Annealing. In: Scientific Reports. 2016 ; Vol. 6.
@article{c150bce0498d4ebcbd6df7846a65a65b,
title = "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{\"o}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.",
author = "Yudong Cao and Shuxian Jiang and Debbie Perouli and Sabre Kais",
year = "2016",
month = "9",
day = "27",
doi = "10.1038/srep33957",
language = "English",
volume = "6",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",

}

TY - JOUR

T1 - Solving Set Cover with Pairs Problem using Quantum Annealing

AU - Cao, Yudong

AU - Jiang, Shuxian

AU - Perouli, Debbie

AU - Kais, Sabre

PY - 2016/9/27

Y1 - 2016/9/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84989236031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989236031&partnerID=8YFLogxK

U2 - 10.1038/srep33957

DO - 10.1038/srep33957

M3 - Article

AN - SCOPUS:84989236031

VL - 6

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

M1 - 33957

ER -