logo

Video encyclopedia

Solovay–Kitaev theorem

1:00:02

The Solovay-Kitaev theorem and Golden Gates- Peter Sarnak - June 10 2015

37:41

Advances in Quantum Algorithms & Devices: Exact synthesis for qubit unitaries

0:34

Solovay–Kitaev theorem | Wikipedia audio article

1:22:07

Topological quantum phases - Alexei Kitaev

16:23

Alexei Kitaev: 2015 Breakthrough Prize Fundamental Physics Symposium

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.
    Explore contextually related video stories in a new eye-catching way. Try Combster now!
    • Proof idea