S Hirama, M Ohzeki - Journal of the Physical Society of Japan, 2023 - journals.jps.jp
We propose an efficient algorithm that combines column generation and quantum annealing to solve binary quadratic problems. Binary quadratic problems are difficult to solve because …
This paper presents a hybrid classical-quantum approach to solve mixed-integer linear programming (MILP) using neutral-atom quantum computations. We apply Benders …
H Kanai, M Yamashita, K Tanahashi… - arXiv preprint arXiv …, 2024 - arxiv.org
Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in …
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms …
KM Zick - arXiv preprint arXiv:2311.09275, 2023 - arxiv.org
Sparse Ising problems can be found in application areas such as logistics, condensed matter physics and training of deep Boltzmann networks, but can be very difficult to tackle …
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for …
M Dukalski, M Möller - EAGE Seventh High Performance Computing …, 2023 - earthdoc.org
In this work we closely examine the overlap between (1) the computationally challenging problems in geophysical applications in the upstream business and (2) the capabilities of …
Este informe tiene por objetivo principal ofrecer a los profesionales de las matemáticas tanto un punto de entrada al mundo de la computación cuántica como un resumen del estado del …