SearcharxivSearch

arXiv subjects

Kangheun Kim

Publications and source records attributed to Kangheun Kim.

8 recordsLinked to original sources

High performance imaging of $^{171}$Yb atom in shallow clock-magic tweezer by alternating dual-tone narrowline cooling

We demonstrate imaging $^{171}$Yb single atoms in clock-magic tweezers of 759.4 nm wavelength, with above 99.9% fidelity and survival. We use alternating dual-tone narrowline imaging for more efficient three-dimensional cooling in tweezers, allowing several-millisecond imaging in 200 $\mu$K trap depth, which is half of typical depth used for imaging in clock-magic tweezers. Accordingly, even without repumping, imaging survival is still close to 99.9% with the high fidelity, which can enable high performance nondestructive qubit measurements based on metastable shelving. Moreover, our simulation predicts that more optimal configuration could further reduce the trap depth, as improving the imaging performance. This imaging capability in shallow traps opens high performance imaging for more general trap wavelength, and lays the foundation for large scale systems over 1,000 qubits, and highly repeatable tweezer clocks.

physics.atom-ph

Blinking optical tweezers for atom rearrangements

We propose and experimentally demonstrate an energy-efficient approach for holding and rearranging an N x M atom array using only N optical tweezers. This is achieved through the sequential release and recapture of M single atoms by a single optical tweezer. By employing a stroboscopic harmonic potential, the phase-space quadrature of the atom's probability distribution can be maintained under this "blinking" potential, provided the trap frequency meets the appropriate conditions. Proof-of-principle experiments confirm that a blinking tweezer can trap M atoms while requiring only 1 / M of the power per atom, and it can even facilitate rearrangement, demonstrated with arrays of up to M = 9 atoms. This method offers a scalable and reconfigurable platform for optical tweezer arrays, crucial for the preparation and manipulation of large-scale qubit systems.

quant-ph

A Rydberg-atom approach to 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 $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.

quant-ph

Quantum Computing Dataset of Maximum Independent Set Problem on King's Lattice of over Hundred Rydberg Atoms

Finding the maximum independent set (MIS) of a large-size graph is a nondeterministic polynomial-time (NP)-complete problem not efficiently solvable with classical computations. Here, we present a set of quantum adiabatic computing data of Rydberg-atom experiments performed to solve the MIS problem of up to 141 atoms randomly arranged on the King's lattice. A total of 582,916 events of Rydberg-atom measurements are collected for experimental MIS solutions of 733,853 different graphs. We provide the raw image data along with the entire binary determinations of the measured many-body ground states and the classified graph data, to offer bench-mark testing and advanced data-driven analyses for validation of the performance and system improvements of the Rydberg-atom approach.

quant-ph

Rydberg-atom graphs for quadratic unconstrained binary optimization problems

There is a growing interest in harnessing the potential of the Rydberg-atom system to address complex combinatorial optimization challenges. Here we present an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg-atom graphs. The Rydberg-atom graphs are configurations of neutral atoms organized into mathematical graphs, facilitated by programmable optical tweezers, and designed to exhibit many-body ground states that correspond to the maximum independent set (MIS) of their respective graphs. We have developed four elementary Rydberg-atom subgraph components, not only to eliminate the need of local control but also to be robust against interatomic distance errors, while serving as the building blocks sufficient for formulating generic QUBO graphs. To validate the feasibility of our approach, we have conducted a series of Rydberg-atom experiments selected to demonstrate proof-of-concept operations of these building blocks. These experiments illustrate how these components can be used to programmatically encode the QUBO problems to Rydberg-atom graphs and, by measuring their many-body ground states, how their QUBO solutions are determined subsequently.

quant-ph

Realization of an extremely anisotropic Heisenberg magnet in Rydberg atom arrays

Strong mutual interactions correlate elementary excitations of quantum matter and plays a key role in a range of emergent phenomena, from binding and condensation to quantum thermalization and many-body localization. Here, we employ a Rydberg quantum simulator to experimentally demonstrate strongly correlated spin transport in anisotropic Heisenberg magnets, where the magnon-magnon interaction can be tuned two orders of magnitude larger than the magnon hopping strength. In our approach, the motion of magnons is controlled by an induced spin-exchange interaction through Rydberg dressing, which enables coherent transport of a single Rydberg excitation across a chain of ground-state atoms. As the most prominent signature of a giant anisotropy, we show that nearby Rydberg excitations form distinct types of magnon bound states, where a tightly bound pair exhibits frozen dynamics in a fragmented Hilbert space, while a loosely bound pair propagates and establishes correlations beyond a single lattice site. Our scheme complements studies using resonant dipole-dipole interactions between Rydberg states, and opens the door to exploring quantum thermodynamics with ultrastrong interactions and kinetic constraints.

quant-ph

Quantum tomography of Rydberg atom graphs by configurable ancillas

Tomographic reconstruction of the many-body quantum state of a scalable qubit system is of paramount importance in quantum computing technologies. However, conventional approaches which use tomographically orthogonal base measurements require precise and individual qubit controls which are often experimentally daunting. Here, we propose, as a quantum-mechanically robust alternative, to use configurable ancillas of which the continuously-tunable interactions can generate independent base measurements tomographically sufficient for the quantum state reconstruction of the system of interest. Experimental tests are performed for Rydberg atom arrays in $N$-body $W$ states, of which the results demonstrate reliable high-fidelity full quantum state reconstruction of the proposed method.

quant-ph

Rydberg Quantum Wires for Maximum Independent Set Problems with Nonplanar and High-Degree Graphs

One prominent application of near-term quantum computing devices is to solve combinatorial optimization such as non-deterministic polynomial-time hard (NP-hard) problems. Here we present experiments with Rydberg atoms to solve one of the NP-hard problems, the maximum independent set (MIS) of graphs. We introduce the Rydberg quantum wire scheme with auxiliary atoms to engineer long-ranged networks of qubit atoms. Three-dimensional (3D) Rydberg-atom arrays are constructed, overcoming the intrinsic limitations of two-dimensional arrays. We demonstrate Kuratowski subgraphs and a six-degree graph, which are the essentials of non-planar and high-degree graphs. Their MIS solutions are obtained by realizing a programmable quantum simulator with the quantum-wired 3D arrays. Our construction provides a way to engineer many-body entanglement, taking a step toward quantum advantages in combinatorial optimization.

quant-ph