Spin-s Dicke states and their preparation
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_ | 1866915121358438400 |
|---|---|
| author | Nepomechie, Rafael I. Ravanini, Francesco Raveh, David |
| author_facet | Nepomechie, Rafael I. Ravanini, Francesco Raveh, David |
| contents | We introduce the notion of $su(2)$ spin-$s$ Dicke states, which are higher-spin generalizations of usual (spin-1/2) Dicke states. These multi-qudit states can be expressed as superpositions of $su(2s+1)$ qudit Dicke states. They satisfy a recursion formula, which we use to formulate an efficient quantum circuit for their preparation, whose size scales as $sk(2sn-k)$, where $n$ is the number of qudits and $k$ is the number of times the total spin-lowering operator is applied to the highest-weight state. The algorithm is deterministic and does not require ancillary qudits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_03233 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spin-s Dicke states and their preparation Nepomechie, Rafael I. Ravanini, Francesco Raveh, David Quantum Physics We introduce the notion of $su(2)$ spin-$s$ Dicke states, which are higher-spin generalizations of usual (spin-1/2) Dicke states. These multi-qudit states can be expressed as superpositions of $su(2s+1)$ qudit Dicke states. They satisfy a recursion formula, which we use to formulate an efficient quantum circuit for their preparation, whose size scales as $sk(2sn-k)$, where $n$ is the number of qudits and $k$ is the number of times the total spin-lowering operator is applied to the highest-weight state. The algorithm is deterministic and does not require ancillary qudits. |
| title | Spin-s Dicke states and their preparation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2402.03233 |