Gate complexity using dynamic programming
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).
|Collections||ANU Research Publications|
|Source:||Physical Review A: Atomic, Molecular and Optical Physics|
|01_James_Gate_complexity_using_dynamic_2008.pdf||143.63 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.