K-spin Hamiltonian for quantum-resolvable Markov decision processes
- URL: http://arxiv.org/abs/2004.06040v1
- Date: Mon, 13 Apr 2020 16:15:25 GMT
- Title: K-spin Hamiltonian for quantum-resolvable Markov decision processes
- Authors: Eric B. Jones, Peter Graf, Eliot Kapit and Wesley Jones
- Abstract summary: We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process.
This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using quantum algorithms.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Markov decision process is the mathematical formalization underlying the
modern field of reinforcement learning when transition and reward functions are
unknown. We derive a pseudo-Boolean cost function that is equivalent to a
K-spin Hamiltonian representation of the discrete, finite, discounted Markov
decision process with infinite horizon. This K-spin Hamiltonian furnishes a
starting point from which to solve for an optimal policy using heuristic
quantum algorithms such as adiabatic quantum annealing and the quantum
approximate optimization algorithm on near-term quantum hardware. In proving
that the variational minimization of our Hamiltonian is equivalent to the
Bellman optimality condition we establish an interesting analogy with classical
field theory. Along with proof-of-concept calculations to corroborate our
formulation by simulated and quantum annealing against classical Q-Learning, we
analyze the scaling of physical resources required to solve our Hamiltonian on
quantum hardware.
Related papers
- Optimizing random local Hamiltonians by dissipation [44.99833362998488]
We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum.
Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
arXiv Detail & Related papers (2024-11-04T20:21:16Z) - Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage.
We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection.
Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
arXiv Detail & Related papers (2024-07-05T12:06:40Z) - Truncation technique for variational quantum eigensolver for Molecular
Hamiltonians [0.0]
variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices.
We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian.
This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
arXiv Detail & Related papers (2024-02-02T18:45:12Z) - Variational Coherent Quantum Annealing [0.0]
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer.
We introduce auxiliary Hamiltonians that vanish at the beginning and end of the evolution to increase the energy gap during the process.
We achieve a substantial reduction in the ground-state error with just six variational parameters and a duration within the device coherence times.
arXiv Detail & Related papers (2023-10-03T17:53:03Z) - Variational quantum algorithms for local Hamiltonian problems [0.0]
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer.
We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state.
arXiv Detail & Related papers (2022-08-23T22:32:56Z) - Quantum algorithms for Schrieffer-Wolff transformation [4.237239130164727]
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems.
It describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of unperturbed Hamiltonian.
This unitary transformation can be realized by quantum circuits.
arXiv Detail & Related papers (2022-01-31T15:27:57Z) - 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) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - A Hybrid Quantum-Classical Hamiltonian Learning Algorithm [6.90132007891849]
Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators.
We propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator of the Hamiltonian.
arXiv Detail & Related papers (2021-03-01T15:15:58Z) - Momentum Q-learning with Finite-Sample Convergence Guarantee [49.38471009162477]
This paper analyzes a class of momentum-based Q-learning algorithms with finite-sample guarantee.
We establish the convergence guarantee for MomentumQ with linear function approximations and Markovian sampling.
We demonstrate through various experiments that the proposed MomentumQ outperforms other momentum-based Q-learning algorithms.
arXiv Detail & Related papers (2020-07-30T12:27:03Z)
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.