Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2502.18838 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908404737376256 |
|---|---|
| author | Lötstedt, Erik Yamanouchi, Kaoru |
| author_facet | Lötstedt, Erik Yamanouchi, Kaoru |
| contents | We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 \le S \le 5/2$ using a trapped-ion quantum computer. The qudit mapping is tested by running simulations with a simple noise model. The Dicke mapping, in which the spin states are encoded as superpositions of multi-qubit states, is found to be the most efficient because of the small number of terms in the qubit Hamiltonian. We also investigate the $S$-dependence of the time step length $Δτ$ in the Suzuki-Trotter approximation and find that, in order to obtain the same accuracy for all $S$, $Δτ$ should be inversely proportional to $S$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_18838 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains Lötstedt, Erik Yamanouchi, Kaoru Quantum Physics We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit encoding schemes are assessed by conducting Hamiltonian simulation for $1/2 \le S \le 5/2$ using a trapped-ion quantum computer. The qudit mapping is tested by running simulations with a simple noise model. The Dicke mapping, in which the spin states are encoded as superpositions of multi-qubit states, is found to be the most efficient because of the small number of terms in the qubit Hamiltonian. We also investigate the $S$-dependence of the time step length $Δτ$ in the Suzuki-Trotter approximation and find that, in order to obtain the same accuracy for all $S$, $Δτ$ should be inversely proportional to $S$. |
| title | Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2502.18838 |