Dynamic Programming on a Quantum Annealer: Solving the RBC Model

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all states and generating candidate global solutions in milliseconds, irrespective of problem size. Using existing quantum hardware, we achieve an order-of-magnitude speed-up in solving the real business cycle model over benchmarks in the literature. We also provide a detailed introduction to quantum annealing and discuss its potential use for more challenging economic problems.

READ FULL TEXT

page 32

page 34

research
04/28/2022

BILP-Q: Quantum Coalition Structure Generation

Quantum AI is an emerging field that uses quantum computing to solve typ...
research
04/07/2019

A Quantum Algorithm for Minimum Steiner Tree Problem

Minimum Steiner tree problem is a well-known NP-hard problem. For the mi...
research
04/03/2019

Solving tiling puzzles with quantum annealing

To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we ...
research
09/19/2022

Improving the Efficiency of Payments Systems Using Quantum Computing

High-value payment systems (HVPSs) are typically liquidity-intensive as ...
research
06/30/2020

Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks

In this paper we tackle the problem of dynamic portfolio optimization, i...
research
06/05/2019

Quantum Algorithms for Solving Dynamic Programming Problems

We present quantum algorithms for solving finite-horizon and infinite-ho...
research
02/23/2018

A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks

Wireless Multihop Networks (WMHNs) have to strike a trade-off among dive...

Please sign up or login with your details

Forgot password? Click here to reset