Qudit Gate Decomposition Dependence for Lattice Gauge Theories
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929553962696704 |
|---|---|
| author | Kürkçüoglu, Doga Murat Lamm, Henry Maestri, Andrea |
| author_facet | Kürkçüoglu, Doga Murat Lamm, Henry Maestri, Andrea |
| contents | In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(θ,ϕ)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & $R_p(θ)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_16414 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Qudit Gate Decomposition Dependence for Lattice Gauge Theories Kürkçüoglu, Doga Murat Lamm, Henry Maestri, Andrea Quantum Physics High Energy Physics - Lattice In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(θ,ϕ)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD & $R_p(θ)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model. |
| title | Qudit Gate Decomposition Dependence for Lattice Gauge Theories |
| topic | Quantum Physics High Energy Physics - Lattice |
| url | https://arxiv.org/abs/2410.16414 |