Deep recurrent networks predicting the gap evolution in adiabatic quantum computing

Abstract

One of the main challenges in quantum physics is predicting efficiently the dynamics of observables in many-body problems out of equilibrium. A particular example occurs in adiabatic quantum computing, where finding the structure of the instantaneous gap of the Hamiltonian is crucial in order to optimize the speed of the computation. Inspired by this challenge, in this work we explore the potential of deep learning for discovering a mapping from the parameters that fully identify a problem Hamiltonian to the full evolution of the gap during an adiabatic sweep applying different network architectures. Through this example, we find that a limiting factor for the learnability of the dynamics is the size of the input, that is, how the number of parameters needed to identify the Hamiltonian scales with the system size. We demonstrate that a long short-term memory network succeeds in predicting the gap when the parameter space scales linearly with system size. Remarkably, we show that once this architecture is combined with a convolutional neural network to deal with the spatial structure of the model, the gap evolution can even be predicted for system sizes larger than the ones seen by the neural network during training. This provides a significant speedup in comparison with the existing exact and approximate algorithms in calculating the gap

    Similar works