Quantum computing with Rydberg atom graphs

Kim, Minhyuk; Ahn, Jaewook; Song, Yunheung; Moon, Jongchul; Jeong, Heejeong

doi:10.1007/s40042-023-00774-1

J. Korean Phys. Soc.

2023

DOI: 10.1007/s40042-023-00774-1

|View full text |Cite

Quantum computing with Rydberg atom graphs

Minhyuk Kim

Jaewook Ahn

Yunheung Song

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 102 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Rydberg-atom experiment for the integer factorization problem

Park,

Jeong,

Kim

et al. 2024

Phys. Rev. Research

View full text Add to dashboard Cite

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×3, 15=3×5, and 35=5×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. Published by the American Physical Society 2024

show abstract

Rydberg-atom experiment for the integer factorization problem

Park,

Jeong,

Kim

et al. 2024

Phys. Rev. Research

View full text Add to dashboard Cite

show abstract

A Novel Design of Quantum Multiplexer and its Identity Rules-Based Optimization for the Spin-Torque-Based n-Qubit Architecture

Kulkarni,

Gayathri,

Ranjan Das

et al. 2024

IEEE Trans. Magn.

View full text Add to dashboard Cite

Graph algorithms with neutral atom quantum processors

Dalyac,

Leclerc,

Vignoli

et al. 2024

Eur. Phys. J. A

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Quantum computing with Rydberg atom graphs

Cited by 4 publications

References 102 publications

Rydberg-atom experiment for the integer factorization problem

Rydberg-atom experiment for the integer factorization problem

A Novel Design of Quantum Multiplexer and its Identity Rules-Based Optimization for the Spin-Torque-Based n-Qubit Architecture

Graph algorithms with neutral atom quantum processors

Contact Info

Product

Resources

About