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

Robustness checks, such as adding controls or sample splits, are a standard feature of reduced-form empirical research. Because of computational costs of reestimating alternative models, they are much less common in structural re- search using simulation-based methods. We propose a simple...