no code implementations • 21 Jun 2022 • David Von Dollen, Sheir Yarkoni, Daniel Weimer, Florian Neukart, Thomas Bäck
We benchmark these quantum-enhanced algorithms against classical algorithms over various black-box objective functions, including the OneMax function, and functions from the IOHProfiler library for black-box optimization.
2 code implementations • 12 May 2022 • Andrea Skolik, Michele Cattelan, Sheir Yarkoni, Thomas Bäck, Vedran Dunjko
When training a parametrized quantum circuit in this setting to solve a specific problem, the choice of ansatz is one of the most important factors that determines the trainability and performance of the algorithm.
no code implementations • 19 Jun 2020 • Sheir Yarkoni, Andrii Kleshchonok, Yury Dzerin, Florian Neukart, Marc Hilbert
We accomplish this by discretizing the TS and converting the reconstruction to a set cover problem, allowing us to perform a one-versus-all method of reconstruction.
1 code implementation • 4 Aug 2017 • Florian Neukart, Gabriele Compostella, Christian Seidel, David Von Dollen, Sheir Yarkoni, Bob Parney
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems.
Quantum Physics Data Structures and Algorithms