Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Abstract Quantum Bridge Analytics relates generally to methods and systems for hybrid
classical-quantum computing, and more particularly is devoted to developing tools for …
classical-quantum computing, and more particularly is devoted to developing tools for …
[HTML][HTML] Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Abstract Quantum Bridge Analytics relates generally to methods and systems for hybrid
classical-quantum computing, and more particularly is devoted to developing tools for …
classical-quantum computing, and more particularly is devoted to developing tools for …
Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite
different from that of classical computers in terms of speed and methods of operations. This …
different from that of classical computers in terms of speed and methods of operations. This …
A QUBO model for the traveling salesman problem with time windows
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a
quadratic unconstrained binary optimization (QUBO) problem. The time windows impose …
quadratic unconstrained binary optimization (QUBO) problem. The time windows impose …
Digital annealer for quadratic unconstrained binary optimization: A comparative performance analysis
O Şeker, N Tanoumand, M Bodur - Applied Soft Computing, 2022 - Elsevier
Digital Annealer (DA) is a computer architecture designed for tackling combinatorial
optimization problems formulated as quadratic unconstrained binary optimization (QUBO) …
optimization problems formulated as quadratic unconstrained binary optimization (QUBO) …
Population annealing with topological defect driven nonlocal updates for spin systems with quenched disorder
D Cirauqui, MÁ García-March, JRM Saavedra… - Physical Review B, 2024 - APS
Population annealing, one of the currently state-of-the-art algorithms for solving spin-glass
systems, sometimes finds hard disorder instances for which its equilibration quality at each …
systems, sometimes finds hard disorder instances for which its equilibration quality at each …
[PDF][PDF] Quantum computing for process systems optimization and data analytics
A Ajagekar - 2020 - ecommons.cornell.edu
Quantum computing (QC) is the next frontier in computation and has attracted a lot of
attention from the scientific community in recent years. With the ever-increasing complexity …
attention from the scientific community in recent years. With the ever-increasing complexity …
[PDF][PDF] On modeling local search with special-purpose combinatorial optimization hardware
X Liu, H Ushijima-Mwesigwa… - arXiv preprint arXiv …, 2019 - optimization-online.org
As we approach the physical limits predicted by Moore's law, a variety of specialized
hardware is emerging to tackle specialized tasks in different domains. Within combinatorial …
hardware is emerging to tackle specialized tasks in different domains. Within combinatorial …
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems
RN Liang, EAJ Anacleto, CN Meneses - Journal of Heuristics, 2022 - Springer
The quadratic unconstrained binary optimization (QUBO) problem belongs to the NP-hard
complexity class of problems and has been the subject of intense research since the 1960s …
complexity class of problems and has been the subject of intense research since the 1960s …
The Houdayer Algorithm: Overview, Extensions, and Applications
The study of spin systems with disorder and frustration is known to be a computationally
hard task. Standard heuristics developed for optimizing and sampling from general Ising …
hard task. Standard heuristics developed for optimizing and sampling from general Ising …