No TL;DR found
We use reinforcement learning techniques to optimize the Quantum Approximate Optimization Algorithm when applied to the MaxCut problem. We explore Q-learning based techniques both for continuous and discrete action environments with regular and irregular graphs.