Quantum-enhanced policy iteration on the example of a mountain car

• URL: http://arxiv.org/abs/2308.08348v1
• Date: Wed, 16 Aug 2023 13:16:40 GMT
• Title: Quantum-enhanced policy iteration on the example of a mountain car
• Authors: Egor E. Nuzhin, Dmitry Yudin
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Advances in the experimental demonstration of quantum processors have provoked a surge of interest to the idea of practical implementation of quantum computing over last years. It is expected that the use of quantum algorithms will significantly speed up the solution to certain problems in numerical optimization and machine learning. In this paper, we propose a quantum-enhanced policy iteration (QEPI) algorithm as widely used in the domain of reinforcement learning and validate it with the focus on the mountain car problem. In practice, we elaborate on the soft version of the value iteration algorithm, which is beneficial for policy interpretation, and discuss the stochastic discretization technique in the context of continuous state reinforcement learning problems for the purposes of QEPI. 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.

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 Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Computing Techniques for Multi-Knapsack Problems [1.0136953995598361]
  We investigate some of the most prominent and state-of-the-art quantum algorithms using different quantum software and hardware tools. We consider several gate-based quantum algorithms, such as QAOA and VQE, and present an exhaustive study of the solutions and the estimation of runtimes.
  arXiv  Detail & Related papers  (2023-01-13T20:21:24Z)
• Quantum Policy Gradient Algorithm with Optimized Action Decoding [1.3946033794136758]
  We introduce a novel quality measure that enables us to optimize the classical post-processing required for action selection. With this technique, we successfully execute a full training routine on a 5-qubit hardware device.
  arXiv  Detail & Related papers  (2022-12-13T15:42: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)
• Parametrized Complexity of Quantum Inspired Algorithms [0.0]
  Two promising areas of quantum algorithms are quantum machine learning and quantum optimization. Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms.
  arXiv  Detail & Related papers  (2021-12-22T06:19:36Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An optimal quantum sampling regression algorithm for variational eigensolving in the low qubit number regime [0.0]
  We introduce Quantum Sampling Regression (QSR), an alternative hybrid quantum-classical algorithm. We analyze some of its use cases based on time complexity in the low qubit number regime. We demonstrate the efficacy of our algorithm for a benchmark problem.
  arXiv  Detail & Related papers  (2020-12-04T00:01:15Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.