4 citations · 4 across the 5 of their papers we have counts for
5 papers
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…
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…
Empirically Exploring the Space of Monostationarity in Dual Phosphorylation
May Cai, Matthias Himmelmann, Birte Ostermann
The dual phosphorylation network provides an essential component of intracellular signaling, affecting the expression of phenotypes and cell metabolism. For particular choices of k…
Revealing hidden physical nonclassicality with nonnegative polynomials
Ties-A. Ohst, Benjamin Yadin, Birte Ostermann +3
Understanding quantum phenomena which go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of nonnegative polynomials emerging around Hil…
A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller +1
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metri…