Topics in matrix analysis
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Classical and Quantum Computation
Classical and Quantum Computation
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Quantum Information & Computation
Exact universality from any entangling gate without inverses
Quantum Information & Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Constructing arbitrary steane code single logical qubit fault-tolerant gates
Quantum Information & Computation
Proving expansion in three steps
ACM SIGACT News
Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle
Quantum Information & Computation
Quantum software framework: a tentative study
Frontiers of Computer Science: Selected Publications from Chinese Universities
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
Quantum Information & Computation
| Hi-index | 0.01 |
This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form ofan efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequenceof gates from a fixed and finite set. The algorithm can be used, for example, to compileShor's algorithm, which uses rotations of π/2k, into an efficient fault-tolerant form usingonly Hadamard, controlled-not, and π/8 gates. The algorithm runs in O(log2.71(1/ε))time, and produces as output a sequence of O(log3.97(1/ε)) quantum gates which isguaranteed to approximate the desired quantum gate to an accuracy within ε 0. Wealso explain how the algorithm can be generalized to apply to multi-qubit gates and togates from SU(d).