2016
DOI: 10.1038/srep33957
|View full text |Cite
|
Sign up to set email alerts
|

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
17
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 61 publications
0
17
0
Order By: Relevance
“…Unfortunately, such model becomes more complicated, and hard to simulate. To handle it, we can refer to the potentially fast quantum computation on the D-Wave machine [146,147]. The D-Wave machine is designed to solve a specific problem of finding a ground state of the following Hamiltonian…”
Section: Simulated Annealing On the D-wave Machinementioning
confidence: 99%
See 2 more Smart Citations
“…Unfortunately, such model becomes more complicated, and hard to simulate. To handle it, we can refer to the potentially fast quantum computation on the D-Wave machine [146,147]. The D-Wave machine is designed to solve a specific problem of finding a ground state of the following Hamiltonian…”
Section: Simulated Annealing On the D-wave Machinementioning
confidence: 99%
“…Let us now discuss to some extend how the D-Wave machine works [146]. It starts with the ground state of the H 0 Hamiltonian given by…”
Section: Simulated Annealing On the D-wave Machinementioning
confidence: 99%
See 1 more Smart Citation
“…We assess the progress in quantum annealing technology by benchmarking both Advantage and D-Wave 2000Q with exact cover problems. The exact cover problem is an NP-complete problem [40] that has become a prominent application to study quantum annealing [41][42][43][44][45] and gate-based quantum computing [46][47][48][49][50]. In our case, the exact cover problems are derived from the tail assignment problem [51] (see [49] for more information) and represent simplified aircraft scheduling scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…This finite-temperature, open system model is expected to more accurately describe the dynamics underlying the QPU [8]. Nevertheless, several experimental tests of the D-Wave QPU have been carried out including applications of machine learning, binary classification, protein folding, graph analysis, and network analysis [9][10][11][12][13][14][15][16][17][18]. Demonstrations of enhanced performance using the D-Wave QPU have been found only for a few selected and highly contrived problem instances [19][20][21].…”
Section: Introductionmentioning
confidence: 99%