Quantum logic gate synthesis as a Markov Decision Process

We investigate the feasibility of the assumption that a variety of tasks in quantum programming could be modeled as Markov Decision Processes by exploring its consequences for two of the simplest tasks in quantum programming: state preparation and gate compilation.