2 papers
math.OC2025
Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
Birte Ostermann, Taylor Garnowski, Fabian Henze +7
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental…
quant-ph2025
Solving quadratic binary optimization problems using quantum SDP methods: Non-asymptotic running time analysis
Fabian Henze, Viet Tran, Birte Ostermann +3
Quantum computers can solve semidefinite programs (SDPs) using resources that scale better than state-of-the-art classical methods as a function of the problem dimension. At the sa…