Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
From MaRDI portal
Abstract: The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales merely poly-logarithmically with accuracy. As a consequence, the choice of gate set is typically unimportant in quantum computing. However, the Solovay-Kitaev algorithm requires the gate set to be inverse-closed. It has been a longstanding open question if efficient algorithmic compilation is possible without this condition. In this work, we provide the first inverse-free Solovay-Kitaev algorithm, which makes no assumption on the structure within a gate set beyond universality, answering this problem in the affirmative, and providing an efficient compilation algorithm in the absence of inverses for both and . The algorithm works by showing that approximate gate implementations of the generalized Pauli group can self-correct their errors.
This page was built for publication: Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6384760)
