TY - JOUR
T1 - Gate complexity using dynamic programming
AU - Sridharan, Srinivas
AU - Gu, Mile
AU - James, Matthew R.
PY - 2008/11/17
Y1 - 2008/11/17
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=56849092892&partnerID=8YFLogxK
U2 - 10.1103/PhysRevA.78.052327
DO - 10.1103/PhysRevA.78.052327
M3 - Article
SN - 1050-2947
VL - 78
JO - Physical Review A - Atomic, Molecular, and Optical Physics
JF - Physical Review A - Atomic, Molecular, and Optical Physics
IS - 5
M1 - 052327
ER -