Mathematics – Optimization and Control
Scientific paper
2010-11-28
Phys. Rev. A 82, 042319 (2010)
Mathematics
Optimization and Control
8 pages, 4 figures
Scientific paper
10.1103/PhysRevA.82.042319
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, used in previous literature. 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.
Gu Mile
James Matthew R.
McEneaney William M.
Sridharan Srinivas
No associations
LandOfFree
A reduced complexity numerical method for optimal gate synthesis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A reduced complexity numerical method for optimal gate synthesis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A reduced complexity numerical method for optimal gate synthesis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-321296