Published on Tue Jun 13 2017

Optimization by a quantum reinforcement algorithm

A. Ramezanpour

A reinforcement algorithm solves a classical optimization problem by introducing a feedback to the system which slowly changes the energy landscape. This feedback converges the algorithm to an optimal solution in the configuration space.

0
0
0
Abstract

A reinforcement algorithm solves a classical optimization problem by introducing a feedback to the system which slowly changes the energy landscape and converges the algorithm to an optimal solution in the configuration space. Here, we use this strategy to concentrate (localize) preferentially the wave function of a quantum particle, which explores the configuration space of the problem, on an optimal configuration. We examine the method by solving numerically the equations governing the evolution of the system, which are similar to the nonlinear Schr\"odinger equations, for small problem sizes. In particular, we observe that reinforcement increases the minimal energy gap of the system in a quantum annealing algorithm. Our numerical simulations and the latter observation show that such kind of quantum feedbacks might be helpful in solving a computationally hard optimization problem by a quantum reinforcement algorithm.

Wed Aug 21 2019
Machine Learning
Automated quantum programming via reinforcement learning for combinatorial optimization
We develop a general method for incentive-based programming of hybrid quantum computing systems using reinforcement learning. We apply this to solve combinatorial optimization problems on both simulated and real gate-based quantum computers. We observe generalization to problems outside of the training set.
0
0
0
Thu Dec 06 2018
Machine Learning
Enhancing the efficiency of quantum annealing via reinforcement: A path-integral Monte Carlo simulation of the quantum reinforcement algorithm
The standard quantum annealing algorithm tries to approach the ground state of a classical system by slowly decreasing the hopping rates of a quantum random walk. In a quantum reinforcement algorithm, the annealed works instead by increasing gradually the strength of the on-site energies.
0
0
0
Wed Mar 14 2018
Artificial Intelligence
Measurement-based adaptation protocol with quantum reinforcement learning
Machine learning employs dynamical algorithms that mimic the human capacity to learn. Adaptability is an essential aspect of any task efficiently in a changing environment. Here, we propose an algorithm based on successive measurements to adapt one quantum state to areference unknown state.
0
0
0
Tue Feb 11 2020
Artificial Intelligence
Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization
0
0
0
Tue Feb 04 2020
Machine Learning
Policy Gradient based Quantum Approximate Optimization Algorithm
The quantum approximate optimization algorithm (QAOA) has received much interest recently. QAOA can also be viewed as a variational ansatz for quantum control. We show that, in noisy setups, it is capable of outperforming state-of-the-art optimization algorithms.
0
0
0
Sat Aug 01 2020
Artificial Intelligence
Ergodic Annealing
Simulated Annealing is the crowning glory of Markov Chain Monte Carlo Methods. It is used for the solution of NP-hard optimization problems in which the cost function is known.
0
0
0