Mainz 2026 – wissenschaftliches Programm

Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe

Q: Fachverband Quantenoptik und Photonik

Q 21: Quantum Computing and Simulation III

Q 21.6: Vortrag

Dienstag, 3. März 2026, 12:30–12:45, P 10

Truncated Wigner Approximation of Quantum annealing on large Graph instances — •Dennis Breu, Simon Ohler, and Michael Fleischhauer — Department of Physics and Research Center OPTIMAS, RPTU-University of Kaiserslautern-Landau, D-67663 Kaiserslautern, Germany

Solving NP-Hard problems like traveling salesman and Max-Cut are of great interest in industry, for example to optimise shipping routes and supply changes. Quantum Annealing (QA) algorithm is a contender to achieve quantum supremacy on near-term non fault-tolerant quantum computers for these kinds of problems. However, there is no mathematical proof for the quantum advantage and current experimental scales are too small to draw objective conclusions. Thus there is a need to better understand the behavior of QA on intermediate scales. To make larger system sizes computationally accessible we make use of the truncated Wigner approximation (TWA), a semiclassical approximation which, through Monte-Carlo sampling, takes lowest order quantum-fluctuations into account. With TWA it is possible to simulate several hundred spins and better quantify the scaling of the computational effort of QA with the system size than previous methods like ED. Preliminary results seem to indicate that the computational effort for QA on a quantum computer becomes exponential in the same cases where it does for state of the art algorithms on classical computers.

Keywords: Quantum annealing; Semiclassical simulations; Numerical calculations; Truncated Wigner approximation; Quanten computing