181 citations · 332 across the 25 of their papers we have counts for
4 papers · 1 filter
Challenges and Opportunities in Quantum Optimization
Amira Abbas, Andris Ambainis, Brandon Augustino +43
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum a…
Quantum speedups for linear programming via interior point methods
Simon Apers, Sander Gribling
We describe a quantum algorithm based on an interior point method for solving a linear program with inequality constraints on variables. The algorithm explicitly returns a…
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
Sander Gribling, Sven Polak, Lucas Slot
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible r…
Basic quantum subroutines: finding multiple marked elements and summing numbers
Joran van Apeldoorn, Sander Gribling, Harold Nieuwboer
We show how to find all marked elements in a list of size using the optimal number of quantum queries and only a polylogarithmic overhead in the gate comple…