Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910675765297152 |
|---|---|
| author | Hindlycke, Christoffer Larsson, Jan-Åke |
| author_facet | Hindlycke, Christoffer Larsson, Jan-Åke |
| contents | We propose a direct (non-recursive) algorithm for applying a rotation $R_{θ^\ast}$, $ε$-close to a desired rotation $R_θ$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly applying a fixed rotation, but immediately applies $R_{θ^\ast}$. It succeeds with probability strictly greater than $1/2$, has an expected number of repetitions strictly less than 2, expected Toffoli count logarithmic in $\tfrac{1}ε$, and expected gate depth also logarithmic in $\tfrac{1}ε$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_05618 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth Hindlycke, Christoffer Larsson, Jan-Åke Quantum Physics We propose a direct (non-recursive) algorithm for applying a rotation $R_{θ^\ast}$, $ε$-close to a desired rotation $R_θ$, to a single qubit using the Clifford+Toffoli gate set. Our algorithm does not rely on repeatedly applying a fixed rotation, but immediately applies $R_{θ^\ast}$. It succeeds with probability strictly greater than $1/2$, has an expected number of repetitions strictly less than 2, expected Toffoli count logarithmic in $\tfrac{1}ε$, and expected gate depth also logarithmic in $\tfrac{1}ε$. |
| title | Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2404.05618 |