Mainz 2026 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
Q: Fachverband Quantenoptik und Photonik
Q 67: Poster – Quantum Information
Q 67.16: Poster
Thursday, March 5, 2026, 17:00–19:00, Philo 2. OG
Utilizing TWA simulations as quantum inspired approximative solve for max-cut problems — •Dennis Breu1, Tom Schlegel1, Alexey Bochkarev2, Simon Ohler1, Michael Fleischhauer1, and Maximilian Kiefer-Emmanouilidis3 — 1Department of Physics and Research Center OPTIMAS, RPTU-University of Kaiserslautern-Landau, D-67663 Kaiserslautern, Germany — 2Department of Mathematics, RPTU Kaiserslautern-Landau — 3DFKI Kaiserslautern and RPTU Kaiserslautern-Landau
There is still a big need to find classical algorithms to efficiently approximately solve NP-Hard problems, since near-term quantum computers are not up for the task yet. For the Max-Cut, a prototypical NP-Hard problem, we propose a method that models a Quantum Annealing (QA) protocol on a classical computer using the truncated Wigner approximation (TWA), achieving a runtime virtually competitive with existing solvers. The TWA is a semiclassical approximation that is able to take lowest order quantum-fluctuations into account. In the TWA simulation of Quantum Annealing quantum fluctuations are included through Monte-Carlo sampling of the initial state. The time evolution of these initial states is however described by ODEs only, which can easily be vectorized and accelerated through the use of GPUs. Moreover, our numerical experiments suggest that the number of trajectories required to model close-to-adiabatic schedules is relatively low. This fact, along with massive parallelization ability, allows us to outperform quantum computers available to us and get close to state of the art classical algorithms in terms of speed and accuracy.
Keywords: Numerical simulations; Semiclassical simulations; NP-Hard problems; Truncated Wigner approximation