Solovay–Kitaev Approximations of Special Orthogonal Matrices

Abstract EN

The circuit-gate framework of quantum computing relies on the fact that an arbitrary quantum gate in the form of a unitary matrix of unit determinant can be approximated to a desired accuracy by a fairly short sequence of basic gates, of which the exact bounds are provided by the Solovay–Kitaev theorem.

In this work, we show that a version of this theorem is applicable to orthogonal matrices with unit determinant as well, indicating the possibility of using orthogonal matrices for efficient computation.

We further develop a version of the Solovay–Kitaev algorithm and discuss the computational experience.