7 citations · 9 across the 5 of their papers we have counts for
3 papers · 2 filters
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…
A quantum algorithm for solving 0-1 Knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +3
Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Q…
From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
Lennart Binkowski, Gereon Koßmann, Tobias J. Osborne +2
Optimisation via parameterised quantum circuits is the prevalent technique of near-term quantum algorithms. However, the omnipresent phenomenon of barren plateaus - parameter regio…