7 citations · 9 across the 5 of their papers we have counts for
6 papers
Stochastic Neural Networks for Quantum Devices
Bodo Rosenhahn, Tobias J. Osborne, Christoph Hirche
This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing. Motivated by a classical perceptron, stocha…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…
One for All: Universal Quantum Conic Programming Framework for Hard-Constrained Combinatorial Optimization Problems
Lennart Binkowski, Tobias J. Osborne, Marvin Schwiering +2
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimisation problems, generalising the recently proposed Quantum Conic Progra…
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…