Gate complexity using Dynamic Programming

Details Gate complexity using Dynamic Programming Gate complexity using Dynamic Programming

2008-07-03

arxiv.org/abs/0807.0507v1

Phys. Rev. A 78, 052327 (2008)

Physics

Quantum Physics

Scientific paper

10.1103/PhysRevA.78.052327

The relationship between efficient quantum gate synthesis and control theory has been a topic of interest in the quantum control literature. Motivated by this work, we describe in the present article how the dynamic programming technique from optimal control may be used for the optimal synthesis of quantum circuits. We demonstrate simulation results on an example system on SU(2), to obtain plots related to the gate complexity and sample paths for different logic gates.

Affiliated with

Also associated with

No associations

Rating

Gate complexity using Dynamic Programming 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 Gate complexity using Dynamic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gate complexity using Dynamic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115365