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

Descripción completa

Detalles Bibliográficos
Autores principales: Cao, Yudong, Jiang, Shuxian, Perouli, Debbie, Kais, Sabre
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2016
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5037405/
https://www.ncbi.nlm.nih.gov/pubmed/27670578
http://dx.doi.org/10.1038/srep33957

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5037405/
https://www.ncbi.nlm.nih.gov/pubmed/27670578
http://dx.doi.org/10.1038/srep33957

Ejemplares similares