Utilizing TWA simulations of QA and ITWA to find approximate solution of Max-Cut problems

Truncated Wigner Approximation (TWA) is a semiclassical approximation, which through Monte-Carlo sampling, takes lowest order quantum-fluctuations into account. Utilizing TWA, we are able to simulate Quantum Annealing (QA) for the Max-Cut Problem on fully arbitrary graphs with sizes exceeding 100 nodes, error-correction schemes (QAC) and different ramp schedules. Through parallel programming on GPUs, we achieved simulation run times in the range of seconds which allow rapid testing of different parameters. We also conceived a way to implement imaginary time evolution via TWA (iTWA) and showcase its performance in finding the groundstate of Max-Cut Problems on random and in general frustrated Ising type Hamiltonians on 3-regular-graphs.