Quantum Reinforcement Learning via Policy Iteration

• URL: http://arxiv.org/abs/2203.01889v1
• Date: Thu, 3 Mar 2022 18:08:17 GMT
• Title: Quantum Reinforcement Learning via Policy Iteration
• Authors: El Amine Cherrat and Iordanis Kerenidis and Anupam Prakash
• Abstract summary: We provide a general framework for performing quantum reinforcement learning via policy iteration. We validate our framework by designing and analyzing: emphquantum policy evaluation methods for infinite horizon discounted problems. We study the theoretical and experimental performance of our quantum algorithms on two environments from OpenAI's Gym.
• Score: 6.961253535504979
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing has shown the potential to substantially speed up machine learning applications, in particular for supervised and unsupervised learning. Reinforcement learning, on the other hand, has become essential for solving many decision making problems and policy iteration methods remain the foundation of such approaches. In this paper, we provide a general framework for performing quantum reinforcement learning via policy iteration. We validate our framework by designing and analyzing: \emph{quantum policy evaluation} methods for infinite horizon discounted problems by building quantum states that approximately encode the value function of a policy $\pi$; and \emph{quantum policy improvement} methods by post-processing measurement outcomes on these quantum states. Last, we study the theoretical and experimental performance of our quantum algorithms on two environments from OpenAI's Gym.

Related papers

• Robustness and Generalization in Quantum Reinforcement Learning via Lipschitz Regularization [2.8445375187526154]
  We propose a regularized version of a quantum policy gradient approach, named the RegQPG algorithm. We show that training with RegQPG improves the robustness and generalization of the resulting policies.
  arXiv  Detail & Related papers  (2024-10-28T15:20:35Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum-enhanced policy iteration on the example of a mountain car [0.0]
  We propose a quantum-enhanced policy iteration (QEPI) algorithm as widely used in the domain of reinforcement learning. The complexity of the algorithm is analyzed for dense and (typical) sparse cases. Numerical results on the example of a mountain car with the use of a quantum emulator verify the developed procedures and benchmark the QEPI performance.
  arXiv  Detail & Related papers  (2023-08-16T13:16:40Z)
• Quantum policy gradient algorithms [1.5293427903448025]
  We show that speed-ups in learning are possible when given quantum access to reinforcement learning environments. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies. We find that reinforcement learning policies derived from parametrized quantum circuits are well-behaved.
  arXiv  Detail & Related papers  (2022-12-19T09:45:58Z)
• Quantum Policy Iteration via Amplitude Estimation and Grover Search -- Towards Quantum Advantage for Reinforcement Learning [7.122914046030916]
  We show how to combine amplitude estimation and Grover search into a policy evaluation and improvement scheme. We derive a quantum policy iteration that repeatedly improves an initial policy using Grover search until the optimum is reached.
  arXiv  Detail & Related papers  (2022-06-09T19:23:10Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Variational quantum policies for reinforcement learning [0.0]
  Variational quantum circuits have recently gained popularity as quantum machine learning models. In this work, we investigate how to construct and train reinforcement learning policies based on variational quantum circuits.
  arXiv  Detail & Related papers  (2021-03-09T17:33:09Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.