컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0194 |
|---|---|
| 분류(Section) | Focus Session |
| 분과(Session) | (FS-02) Quantum Computation and Information Security (FS-02) |
| 발표시간(Time) | 20th-C-10:00 -- 10:30 |
| 영문제목 (Title(Eng.)) |
A Rydberg-atom approach to the combinatorial optimization problems |
| 저자(Author(s)) |
Jaewook Ahn1 KAIST1 |
| 초록본문(Abstract) | There's a growing interest in harnessing the potential of programmable quantum many-body systems (also known as quantum computers) to challenge combinatorial optimization problems. In Rydberg atom systems, the hyper-dimensional couplings of atomic qubits are utilized to represent mathematical graphs, and their interactions, driven by Rydberg-state excitation, correspond to the intrinsic Hamiltonian for the maximum independent set (MIS) problems of the respective graphs [1]. In the context of computational complexity, MIS belongs to the class of NP-complete, suggesting that all NP class problems are to be in principle programmable in Rydberg-atom systems. In this presentation, we review our latest attempts to experimentally encode the NP problems using Rydberg atoms, which encompass the 3-Satisfiability (3-SAT) problem, the quadratic unconstrained binary optimization (QUBO) problem, and the integer factorization problem [2-4], primarily focusing on small-scale validations and elementary building blocks. We will also address the limitations of this approach, particularly addressing the scalability of the current methodology and the associated physical requirements. [1] M. Kim et al., “Rydberg Quantum Wires for Maximum Independent Set Problems," Nature Physics 18, 755 (2022). [2] S. Jeong et al., "Quantum programming of the satisfiability problem with Rydberg atom graphs," PR Research 5, 043037 (2023). [3] A. Byun, “Rydberg-atom graphs for quadratic unconstrained binary optimization problems,” arxiv 2309.14847 (2023) [3] J. Park et al., “A Rydberg-atom approach to the integer factorization problem,” arxiv 2312.08703 (2023). |
| 분류기호 (MSC number(s)) |
68Q09, 81P68 |
| 키워드(Keyword(s)) | 양자컴퓨팅, 리드버그 원자, 최대독립집합문제 |
| 강연 형태 (Language of Session (Talk)) |
Korean |