Programming higher-order interactions of Rydberg atoms
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909371291664384 |
|---|---|
| author | Byun, Andrew Jeong, Seokho Ahn, Jaewook |
| author_facet | Byun, Andrew Jeong, Seokho Ahn, Jaewook |
| contents | Higher-order interactions in spin-based Hamiltonians are crucial in addressing numerous fundamentally significant physical problems. In this work, Rydberg-atom graph gadgets are introduced to effectively program $K$-th order interactions within a Rydberg atom system. This approach facilitates the determination of the ground states of an Ising-type Hamiltonian, encoded to solve higher-order unconstrained optimization problems. A favorable scaling behavior, $O(N^K)$, is expected in terms of the number of atoms required for $N$-vertex hypergraph optimization problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_02026 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Programming higher-order interactions of Rydberg atoms Byun, Andrew Jeong, Seokho Ahn, Jaewook Quantum Physics Atomic Physics Higher-order interactions in spin-based Hamiltonians are crucial in addressing numerous fundamentally significant physical problems. In this work, Rydberg-atom graph gadgets are introduced to effectively program $K$-th order interactions within a Rydberg atom system. This approach facilitates the determination of the ground states of an Ising-type Hamiltonian, encoded to solve higher-order unconstrained optimization problems. A favorable scaling behavior, $O(N^K)$, is expected in terms of the number of atoms required for $N$-vertex hypergraph optimization problems. |
| title | Programming higher-order interactions of Rydberg atoms |
| topic | Quantum Physics Atomic Physics |
| url | https://arxiv.org/abs/2407.02026 |