Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
Edoardo Alessandroni, Sergi Ramos-Calderer, Michel Krispin +5
Quadratic unconstrained binary optimization (QUBO) provides problem formulations for various computational problems that can be solved with dedicated QUBO solvers, which can be bas…
quant-ph2025
A comprehensive benchmark of an Ising machine on the Max-Cut problem
Salwa Shaglel, Markus Kirsch, Marten Winkler +4
QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of…
quant-ph2023
Transformation-Dependent Performance-Enhancement of Digital Annealer for 3-SAT
Christian Münch, Fritz Schinkel, Sebastian Zielinski +1
Quadratic Unconstrained Binary Optimization (QUBO) problems are NP-hard problems and many real-world problems can be formulated as QUBO. Currently there are no algorithms known tha…