Gate complexity using dynamic programming

Srinivas Sridharan; Mile Gu; Matthew R. James

doi:10.1103/PhysRevA.78.052327

Gate complexity using dynamic programming

Srinivas Sridharan^*, Mile Gu, Matthew R. James

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

Abstract

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).

Original language	English
Article number	052327
Journal	Physical Review A - Atomic, Molecular, and Optical Physics
Volume	78
Issue number	5
DOIs	https://doi.org/10.1103/PhysRevA.78.052327
Publication status	Published - 17 Nov 2008

Access to Document

10.1103/PhysRevA.78.052327

Cite this

@article{ddd2774973fd4d5790d4ec1a28848aef,

title = "Gate complexity using dynamic programming",

abstract = "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).",

author = "Srinivas Sridharan and Mile Gu and James, \{Matthew R.\}",

year = "2008",

month = nov,

day = "17",

doi = "10.1103/PhysRevA.78.052327",

language = "English",

volume = "78",

journal = "Physical Review A - Atomic, Molecular, and Optical Physics",

issn = "1050-2947",

publisher = "American Physical Society",

number = "5",

}

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 - https://www.scopus.com/pages/publications/56849092892

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 -

Gate complexity using dynamic programming

Abstract

Access to Document

Other files and links

Fingerprint

Cite this