Qutrit-Based Orthogonal Approximations with Inverse-Free Quantum Gate Sets
The efficient compiling of arbitrary single-qubit gates into a sequence of gates from a finite gate set is of fundamental importance in quantum computation. The exact bounds of this compilation are given by the Solovay–Kitaev theorem, which serves as a powerful tool in compiling quantum algorithms t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Computer Sciences & Mathematics Forum |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2813-0324/7/1/12 |