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...

We show that the standard Value Function Iteration (VFI) algorithm has difficulties approximating models with jump discontinuities in policy functions. We find that VFI fails to accurately identify the location and size of jump discontinuities while other methods - such as the Endogenous Grid...