Solovay–Kitaev Approximations of Special Orthogonal Matrices

Anuradha Mahasinghe, Sachiththa Bandaranayake and Kaushika De Silva

Advances in Mathematical Physics, 2020, vol. 2020, issue 1

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2020/2530609

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlamp:v:2020:y:2020:i:1:n:2530609

Access Statistics for this article

More articles in Advances in Mathematical Physics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().