Gate complexity using dynamic programming
Srinivas Sridharan, Mile Gu, M. R. James · Physical Review A · 2008
The relationship between efficient quantum gate synthesis and control theory has been a topic of recent interest in the quantum computing literature. Motivated by this work, we describe how the dynamic programming technique from optimal control may be used in principle to determine gate complexity and for the optimal synthesis of quantum circuits. We illustrate the dynamic programming methodology using a simple example on the Lie group SU(2).