Quantum Logic Gate Synthesis as a Markov Decision Process

• Published in: arXiv.org 2022-07
• Main Authors: M Sohaib Alam, Berthusen, Noah F, Orth, Peter P
• Format: Article
• Language: English
• Subjects: Inventory management; Iterative methods; Learning; Logic circuits; Markov analysis; Markov processes; Qubits (quantum computing)
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1912.12002

Reinforcement learning has witnessed recent applications to a variety of tasks in quantum programming. The underlying assumption is that those tasks could be modeled as Markov Decision Processes (MDPs). Here, we investigate the feasibility of this assumption by exploring its consequences for two fundamental tasks in quantum programming: state preparation and gate compilation. By forming discrete MDPs, focusing exclusively on the single-qubit case (both with and without noise), we solve for the optimal policy exactly through policy iteration. We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state, or compile a gate, up to some target accuracy. As an example, we find sequences of \(H\) and \(T\) gates with length as small as \(11\) producing \(\sim 99\%\) fidelity for states of the form \((HT)^{n} |0\rangle\) with values as large as \(n=10^{10}\). In the presence of gate noise, we demonstrate how the optimal policy adapts to the effects of noisy gates in order to achieve a higher state fidelity. Our work shows that one can meaningfully impose a discrete, stochastic and Markovian nature to a continuous, deterministic and non-Markovian quantum evolution, and provides theoretical insight into why reinforcement learning may be successfully used to find optimally short gate sequences in quantum programming.