Cargando…
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
Quantum annealing algorithms were introduced to solve combinatorial optimization problems by taking advantage of quantum fluctuations to escape local minima in complex energy landscapes typical of NP − hard problems. In this work, we propose using quantum annealing for the theory of cuts, a field of...
Autores principales: | Cruz-Santos, William, Venegas-Andraca, Salvador E., Lanzagorta, Marco |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6868218/ https://www.ncbi.nlm.nih.gov/pubmed/31748576 http://dx.doi.org/10.1038/s41598-019-53585-5 |
Ejemplares similares
-
A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers
por: Cruz-Santos, William, et al.
Publicado: (2018) -
Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances
por: Campos, Ernesto, et al.
Publicado: (2021) -
QUBO formulations for training machine learning models
por: Date, Prasanna, et al.
Publicado: (2021) -
Distance-based clustering using QUBO formulations
por: Matsumoto, Nasa, et al.
Publicado: (2022) -
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants
por: Carvalho, Iago A., et al.
Publicado: (2023)