Please use this identifier to cite or link to this item:
|Title:||Reduced-complexity numerical method for optimal gate synthesis||Authors:||Sridharan, S.
|Issue Date:||20-Oct-2010||Citation:||Sridharan, S., Gu, M., James, M.R., McEneaney, W.M. (2010-10-20). Reduced-complexity numerical method for optimal gate synthesis. Physical Review A - Atomic, Molecular, and Optical Physics 82 (4) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevA.82.042319||Abstract:||Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate-design problem is equivalent to the solution of an associated optimal-control problem; the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality-free techniques) that determine the optimal control, thereby synthesizing the desired unitary gate. The application of this technique to quantum systems has a growth in complexity that depends on the cardinality of the control-set approximation rather than the much larger growth with respect to spatial dimensions in approaches based on gridding of the space, which is used in previous research. This technique is demonstrated by obtaining an approximate solution for the gate synthesis on SU(4)-a problem that is computationally intractable by grid-based approaches. © 2010 The American Physical Society.||Source Title:||Physical Review A - Atomic, Molecular, and Optical Physics||URI:||http://scholarbank.nus.edu.sg/handle/10635/126312||ISSN:||10502947||DOI:||10.1103/PhysRevA.82.042319|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 9, 2021
WEB OF SCIENCETM
checked on Oct 1, 2021
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.