Efficient decomposition of quantum gates

Details Efficient decomposition of quantum gates Efficient decomposition of quantum gates

2003-12-30

arxiv.org/abs/quant-ph/0312218v3

Phys. Rev. Lett. 92 177902 (2004)

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

10.1103/PhysRevLett.92.177902

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is $O(4^n)$ which coincides with the theoretical lower bound.

Affiliated with

Also associated with

No associations

Rating

Efficient decomposition of quantum gates 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 Efficient decomposition of quantum gates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient decomposition of quantum gates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600307