Skip navigation
Skip navigation

Gate complexity using dynamic programming

James, Matthew; Sridharan, Srinivas; Gu, Mile

Description

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

CollectionsANU Research Publications
Date published: 2008
Type: Journal article
URI: http://hdl.handle.net/1885/27382
Source: Physical Review A: Atomic, Molecular and Optical Physics
DOI: 10.1103/PhysRevA.78.052327

Download

File Description SizeFormat Image
01_James_Gate_complexity_using_dynamic_2008.pdf143.63 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator