A Rydberg-atom approach to the integer factorization problem
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909237270020096 |
|---|---|
| author | Park, Juyoung Jeong, Seokho Kim, Minhyuk Kim, Kangheun Byun, Andrew Vignoli, Louis Henry, Louis-Paul Henriet, Loïc Ahn, Jaewook |
| author_facet | Park, Juyoung Jeong, Seokho Kim, Minhyuk Kim, Kangheun Byun, Andrew Vignoli, Louis Henry, Louis-Paul Henriet, Loïc Ahn, Jaewook |
| contents | The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to classical algorithms. Thus, it is crucial to develop quantum computing algorithms to address this problem. This study introduces a quantum approach that utilizes Rydberg atoms to tackle the factorization problem. Experimental demonstrations are conducted for the factorization of small composite numbers such as $6 = 2 \times 3$, $15 = 3 \times 5$, and $35 = 5 \times 7$. This approach involves employing Rydberg-atom graphs to algorithmically program binary multiplication tables, yielding many-body ground states that represent superpositions of factoring solutions. Subsequently, these states are probed using quantum adiabatic computing. Limitations of this method are discussed, specifically addressing the scalability of current Rydberg quantum computing for the intricate computational problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_08703 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Rydberg-atom approach to the integer factorization problem Park, Juyoung Jeong, Seokho Kim, Minhyuk Kim, Kangheun Byun, Andrew Vignoli, Louis Henry, Louis-Paul Henriet, Loïc Ahn, Jaewook Quantum Physics Atomic Physics The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to classical algorithms. Thus, it is crucial to develop quantum computing algorithms to address this problem. This study introduces a quantum approach that utilizes Rydberg atoms to tackle the factorization problem. Experimental demonstrations are conducted for the factorization of small composite numbers such as $6 = 2 \times 3$, $15 = 3 \times 5$, and $35 = 5 \times 7$. This approach involves employing Rydberg-atom graphs to algorithmically program binary multiplication tables, yielding many-body ground states that represent superpositions of factoring solutions. Subsequently, these states are probed using quantum adiabatic computing. Limitations of this method are discussed, specifically addressing the scalability of current Rydberg quantum computing for the intricate computational problem. |
| title | A Rydberg-atom approach to the integer factorization problem |
| topic | Quantum Physics Atomic Physics |
| url | https://arxiv.org/abs/2312.08703 |