67 citations · 131 across the 26 of their papers we have counts for
36 papers
Robust subspace designs and the power of a unique small quantum witness
Simon Apers, Roman Edenhofer, Benjamin Mathieu-Bloise +1
The concept of subspace designs was introduced by Guruswami and Xing (STOC'13), and explicit constructions were given by Guruswami and Kopparty (FOCS'13). These are families of sub…
Improved quantum volume estimation with transducers and amortized quantum walks
Arjan Cornelissen, Simon Apers, Sander Gribling
The volume estimation problem is a classic task in computational geometry. The development of randomized algorithms for this problem spurred the development of many influential alg…
Log-concavity and tunneling: adiabatic quantum optimization for convex functions (with a spike)
Arthur Braida, Elie Bermot, Simon Apers
Quantum tunneling is expected to provide a computational speedup in quantum computing, a phenomenon that Adiabatic Quantum Optimization (AQO) aims to leverage. While some academic…
Elfs, transducers and quantum walks
Simon Apers, Jérémie Roland, Yuxin Zhang
Electric flow sampling (elfs) is a new tool in the quantum walk toolbox and a useful primitive for solving search, sampling and optimization problems on graphs. We refine this tool…
Randomized and quantum approximate matrix multiplication
Simon Apers, Arjan Cornelissen, Samson Wang
The complexity of matrix multiplication is a central topic in computer science. While the focus has traditionally been on exact algorithms, a long line of literature also considers…
Self-concordant Schrödinger operators: spectral gaps and optimization without condition numbers
Sander Gribling, Simon Apers, Harold Nieuwboer +1
Spectral gaps play a fundamental role in many areas of mathematics, computer science, and physics. In quantum mechanics, the spectral gap of Schrödinger operators has a long histor…