The Solovay-Kitaev algorithm

Details The Solovay-Kitaev algorithm The Solovay-Kitaev algorithm

2005-05-06

arxiv.org/abs/quant-ph/0505030v2

Physics

Quantum Physics

15 pages, accepted to Quantum Information and Computation as Review Article

Scientific paper

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of $\pi / 2^k$, into an efficient fault-tolerant form using only Hadamard, controlled-{\sc not}, and $\pi / 8$ gates. The algorithm runs in $O(\log^{2.71}(1/\epsilon))$ time, and produces as output a sequence of $O(\log^{3.97}(1/\epsilon))$ quantum gates which is guaranteed to approximate the desired quantum gate to an accuracy within $\epsilon > 0$. We also explain how the algorithm can be generalized to apply to multi-qubit gates and to gates from $SU(d)$.

Affiliated with

Also associated with

No associations

Rating

The Solovay-Kitaev algorithm 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 The Solovay-Kitaev algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Solovay-Kitaev algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693912