57 citations · 102 across the 4 of their papers we have counts for
4 papers
Quantum algorithms for zero-sum games
Joran van Apeldoorn, András Gilyén
We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed…
Simon's problem for linear functions
Joran van Apeldoorn, Sander Gribling
Simon's problem asks the following: determine if a function is one-to-one or if there exists a unique such that $f(x) = f(x \…
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling +1
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracle…
Improvements in Quantum SDP-Solving with Applications
Joran van Apeldoorn, András Gilyén
Following the first paper on quantum algorithms for SDP-solving by Brandão and Svore in 2016, rapid developments has been made on quantum optimization algorithms. Recently Brandão…