In the mathematical theory of computation, the Solovay–Kitaev theorem says, roughly, that if a set of single-qubit quantum gates generates a dense subset of SU(2) then that set is guaranteed to fill SU(2) quickly, which means good approximations to any desired gate can be created using fairly short sequences of gates from the generating set. It is one of the most important fundamental results in the field of quantum computation. Robert M. Solovay and Alexei Kitaev jointly came up with and proved the theorem.
|P ≟ NP||This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.|