Seokho Jeong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Seokho Jeong has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jaewook Ahn
KAIST
5 shared publications - Andrew Byun
KAIST
2 shared publications - Juyoung Park
Department of Physics KAIST 34141 Daejeon Republic of Korea
2 shared publications - Kangheun Kim
Department of Physics, KAIST, Daejeon 34141, Republic of Korea
2 shared publications - Minhyuk Kim
Department of physics, Korea university, Seoul 02841, Republic of Korea
2 shared publications Andrew Byun
KAIST
1 shared publication
Latest Publications
- Open Access
- 7 September 2026
- Published by IOP Publishing in Journal of Physics B: Atomic, Molecular and Optical Physics
- Vol. 59 (17) , 175501
Enhanced maximum independent set preparation with Rydberg atoms guided by the spectral gap
Adiabatic quantum computation with Rydberg atoms provides a natural route for solving combinatorial optimization problems such as the maximum independent set (MIS). However, its performance is fundamentally limited by the reduction of the spectral gap with increasing system size and connectivity, which induces population leakage from the ground state during finite-time evolution. Here we introduce the Adjusted Detuning for Ground-Energy Leakage Blockade (ADGLB), a spectral-gap-guided schedule engineering method that modifies the laser detuning profile to suppress leakage without introducing additional Hamiltonian terms or iterative optimization loops. We benchmark ADGLB on QuEra’s Aquila neutral-atom quantum processor using a quasi-one-dimensional chain of N = 10 atoms, and the MIS preparation probability increases substantially compared with the standard adiabatic schedule. Furthermore, we show that the schedule optimized for smaller instances can be directly applied to larger two-dimensional triangular lattices with N = 25 and N = 37 . With a small heuristic offset, the method also remains effective for instances with higher hardness parameters. These findings demonstrate that spectral-gap-guided schedule engineering offers a scalable and hardware-efficient strategy for enhancing adiabatic quantum optimization on neutral-atom platforms.
- 7 September 2026
- Published by IOP Publishing in Journal of Physics B: Atomic, Molecular and Optical Physics
- Vol. 59 (17) , 175501
Open AccessEnhanced maximum independent set preparation with Rydberg atoms guided by the spectral gap
Adiabatic quantum computation with Rydberg atoms provides a natural route for solving combinatorial optimization problems such as the maximum independent set (MIS). However, its performance is fundamentally limited by the reduction of the spectral gap with increasing system size and connectivity, which induces population leakage from the ground state during finite-time evolution. Here we introduce the Adjusted Detuning for Ground-Energy Leakage Blockade (ADGLB), a spectral-gap-guided schedule engineering method that modifies the laser detuning profile to suppress leakage without introducing additional Hamiltonian terms or iterative optimization loops. We benchmark ADGLB on QuEra’s Aquila neutral-atom quantum processor using a quasi-one-dimensional chain of N = 10 atoms, and the MIS preparation probability increases substantially compared with the standard adiabatic schedule. Furthermore, we show that the schedule optimized for smaller instances can be directly applied to larger two-dimensional triangular lattices with N = 25 and N = 37 . With a small heuristic offset, the method also remains effective for instances with higher hardness parameters. These findings demonstrate that spectral-gap-guided schedule engineering offers a scalable and hardware-efficient strategy for enhancing adiabatic quantum optimization on neutral-atom platforms.
- 28 July 2025
- Published by Wiley in Advanced Quantum Technologies
- Vol. 8 (12)
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Hybrid quantum‐classical algorithms offer a promising strategy for tackling computationally challenging problems, such as the maximum independent set (MIS) problem that plays a crucial role in areas like network design and data analysis. This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over standalone simulated annealing (SA), a classical heuristic optimization method. The performance of QESA is evaluated based on the approximation ratio and the Hamming distance, relative to the graph size. The analysis shows that QESA outperforms standalone SA by leveraging a warm‐start input derived from two types of Rydberg atomic array experimental data: quench evolution (QE) (implemented on the QuEra Aquila machine) and adiabatic quantum computing (AQC) (using the experimental dataset archived in K. Kim et al., Scientific Data 2024 , 11, 111). Based on these results, an estimate is provided for the maximum graph size that can be handled within a one‐day computational time limit on a standard personal computer. These findings suggest that QESA has the potential to offer a computational advantage over classical methods for solving complex optimization problems efficiently.
- 28 July 2025
- Published by Wiley in Advanced Quantum Technologies
- Vol. 8 (12)
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Hybrid quantum‐classical algorithms offer a promising strategy for tackling computationally challenging problems, such as the maximum independent set (MIS) problem that plays a crucial role in areas like network design and data analysis. This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over standalone simulated annealing (SA), a classical heuristic optimization method. The performance of QESA is evaluated based on the approximation ratio and the Hamming distance, relative to the graph size. The analysis shows that QESA outperforms standalone SA by leveraging a warm‐start input derived from two types of Rydberg atomic array experimental data: quench evolution (QE) (implemented on the QuEra Aquila machine) and adiabatic quantum computing (AQC) (using the experimental dataset archived in K. Kim et al., Scientific Data 2024 , 11, 111). Based on these results, an estimate is provided for the maximum graph size that can be handled within a one‐day computational time limit on a standard personal computer. These findings suggest that QESA has the potential to offer a computational advantage over classical methods for solving complex optimization problems efficiently.
- 30 January 2025
- Published by Optica Publishing Group in Optica Quantum
- Vol. 3 (1)
Fast and reliable atom transport by optical tweezers
Movable single atoms have drawn significant attention for their potential as flying quantum memory in non-local, dynamic quantum computing architectures. However, when dynamic optical tweezers are employed to control atoms opto-mechanically, conventional methods such as adiabatic controls and constant jerk controls are either inherently slow or induce mechanical heating, leading to atom loss over long distances or at high speeds. To address these challenges, we explore the method known as shortcuts to adiabaticity (STA) as an efficient alternative for fast and reliable atom transport. We present a series of proof-of-concept experiments demonstrating that STA-based optical tweezer trajectories can achieve both rapid and reliable single-atom transport. These experiments include moving atoms between two locations, adjusting speeds en route, and navigating curved trajectories. Our results indicate that atoms can be transported with a constant acceleration on average over distances that is only limited by trap lifetime, while effectively suppressing vibrational heating. This makes STA methods particularly well-suited for long-distance atom transport, potentially spanning distances over centimeter scales, such as between quantum information devices.
- 30 January 2025
- Published by Optica Publishing Group in Optica Quantum
- Vol. 3 (1)
Fast and reliable atom transport by optical tweezers
Movable single atoms have drawn significant attention for their potential as flying quantum memory in non-local, dynamic quantum computing architectures. However, when dynamic optical tweezers are employed to control atoms opto-mechanically, conventional methods such as adiabatic controls and constant jerk controls are either inherently slow or induce mechanical heating, leading to atom loss over long distances or at high speeds. To address these challenges, we explore the method known as shortcuts to adiabaticity (STA) as an efficient alternative for fast and reliable atom transport. We present a series of proof-of-concept experiments demonstrating that STA-based optical tweezer trajectories can achieve both rapid and reliable single-atom transport. These experiments include moving atoms between two locations, adjusting speeds en route, and navigating curved trajectories. Our results indicate that atoms can be transported with a constant acceleration on average over distances that is only limited by trap lifetime, while effectively suppressing vibrational heating. This makes STA methods particularly well-suited for long-distance atom transport, potentially spanning distances over centimeter scales, such as between quantum information devices.
- 11 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Programming higher-order interactions of Rydberg atoms
- 11 October 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (4)
Programming higher-order interactions of Rydberg atoms
- Open Access
- 4 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023241
Rydberg-atom experiment for the integer factorization problem
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 , , and . 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.- 4 June 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (2) , 023241
Open AccessRydberg-atom experiment for the integer factorization problem
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 , , and . 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. - Open Access
- 12 October 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (4) , 043037
Quantum programming of the satisfiability problem with Rydberg atom graphs
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the 3-SAT problem, the prototypical NP-complete problem which allows general programming of all NP problems. We use Rydberg atom graphs, each of which consists of Rydberg atom dimers and trimers coupled with quantum wires in the Rydberg blockade interaction regime, to formulate general Boolean expressions, and obtain their many-body ground states to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.
- 12 October 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (4) , 043037
Open AccessQuantum programming of the satisfiability problem with Rydberg atom graphs
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the 3-SAT problem, the prototypical NP-complete problem which allows general programming of all NP problems. We use Rydberg atom graphs, each of which consists of Rydberg atom dimers and trimers coupled with quantum wires in the Rydberg blockade interaction regime, to formulate general Boolean expressions, and obtain their many-body ground states to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.