Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement

Abstract

Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially small energy gaps of the system in the annealing process. Here a time-dependent reinforcement term is added to the Hamiltonian in order to give lower energies to the most probable states of the evolving system. In this study, we take a local entropy in the configuration space for the reinforcement and apply the algorithm to a number of easy and hard optimization problems. The reinforced algorithm performs better than the standard quantum annealing algorithm in the quantum search problem, where the optimal parameters behave very differently depending on the number of solutions. Moreover, the reinforcements can change the discontinuous phase transitions of the mean-field p-spin model ($p>2$) to a continuous transition. The algorithm's performance in the binary perceptron problem is also superior to that of the standard quantum annealing algorithm, which already works better than a classical simulated annealing algorithm.

28 pages, 12 figures

References in corpus (16)

• Adiabatic tracking of quantum many-body dynamics
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
• Efficient supervised learning in networks with binary synapses
• The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
• Efficient Quantum State Estimation by Continuous Weak Measurement and Dynamical Control
• On the path integral representation for quantum spin models and its application to the quantum cavity method and to Monte Carlo simulations
• Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet
• On quantum mean-field models and their quantum annealing
• Accuracy vs run time in adiabatic quantum search
• Shortcuts to adiabaticity for quantum annealing
• Quantum phase transitions in fully connected spin models: an entanglement perspective
• Quantum annealing with ultracold atoms in a multimode optical resonator
• Fixed-Point Adiabatic Quantum Search
• Optimization by a quantum reinforcement algorithm

Cited by in corpus (2)

• Quantum annealing sampling with a bias field
• Noise tolerance via reinforcement: Learning a reinforced quantum dynamics