SearcharxivSearch

arXiv subjects

Jaewook Ahn

Publications and source records attributed to Jaewook Ahn.

At least 19 recordsLinked to original sources

Shots-to-Approximate-Solution Scaling in Neutral-Atom Quantum Optimization

Whether neutral-atom quantum optimization protocols exhibit genuine concentration toward low-energy solution structure remains an open question. Here, we introduce a shots-to-approximate-solution metric, STS(r), where r denotes the approximation ratio, and evaluate it using postprocessed outputs modeled by a degeneracy-weighted shell distribution governed by a single effective parameter, $\beta$, that quantifies concentration toward near-optimal independent sets. To extract the genuine concentration effect in the quantum data, we apply identical postprocessing to both experimental bitstrings and randomly generated bitstrings with matched excitation density, thereby constructing an excitation-matched random baseline. Experiments on programmable Rydberg-atom arrays with system sizes up to 125 sites show that quantum annealing consistently exceeds the random baseline, demonstrating enhanced concentration toward low-energy solution structure beyond what can be attributed solely to excitation density. The results further reveal two distinct target-dependent regimes. For near-exact targets with $r \approx 1$, the required shot count grows exponentially with system size and is reduced at the same exponential level by quantum annealing within the shell-model description. By contrast, for relaxed targets, the shot cost becomes effectively constant, and the corresponding quantum enhancement diminishes, with the classical postprocessing heuristic alone reaching the target in order-unity attempts. Together, these results establish an operational method for quantifying quantum optimization performance and clarify the regimes under which quantum approaches can yield practical benefits.

quant-ph

Stability and instability for the fully parabolic Keller-Segel system around constant equilibrium

This paper studies the Cauchy problem for the fully parabolic Keller-Segel system. The main results show that there exists a critical threshold $A_{\rm crit}>0$ for steady states $(A,A)$ such that the steady states are nonlinearly stable when $A\le A_{\rm crit}$ and nonlinearly unstable when $A>A_{\rm crit}$. We discuss asymptotic convergence rates as well. In the subcritical case $A<A_{\rm crit}$, the rates correspond to those of the heat equation, and in the critical case $A=A_{\rm crit}$, the rates correspond to half those of the heat equation.

math.AP

Keller-Segel-Navier-Stokes systems involving general sensitivities with Signal-Dependent Power-Law Decay

This paper investigates a two-dimensional Keller--Segel--Navier--Stokes system with a tensor-valued chemotactic sensitivity $S(x,n,c)$. Under a signal-dependent power-decay condition $|S(x,n,c)| \le s_0 (s_1+c)^{-\gamma}$, we establish the global existence and uniform-in-time boundedness of classical solutions for both fluid-coupled ($\gamma > 1/2$) and fluid-free ($\gamma > 0$) systems. The proof relies on a sequence of localized energy estimates, including the $L^{2}_{\rm loc}$-smallness of the weighted gradient of the signal concentration, to overcome the mathematical difficulties arising from signal production and fluid transport. Furthermore, under specific structural assumptions on the sensitivity tensor, we prove that solutions of the fluid-free system converge exponentially to the spatially homogeneous steady state. To this end, we establish an interpolation inequality involving the H\"older norm, which is of independent interest and seems to have broad applications.

math.AP

Quantum-Enhanced Deterministic Inference of $k$-Independent Set Instances on Neutral Atom Arrays

Noisy quantum annealing experiments on Rydberg atom arrays produce measurement outcomes that deviate from ideal distributions, complicating performance evaluation. To enable a data-driven benchmarking methodology for quantum devices that accounts for both solution quality and the classical computational cost of inference from noisy measurements, we introduce deterministic error mitigation (DEM), a shot-level inference procedure informed by experimentally characterized noise. We demonstrate this approach using the decision version of the $k$-independent set problem. Within a Hamming-shell framework, the DEM candidate volume is governed by the binary entropy of the bit-flip error rate, yielding an entropy-controlled classical postprocessing cost. Using experimental measurement data, DEM reduces postprocessing overhead relative to classical inference baselines. Numerical simulations and experimental results from neutral atom devices validate the predicted scaling with system size and error rate. These scalings indicate that one hour of classical computation on an Intel i9 processor corresponds to neutral atom experiments with up to $N=250-450$ atoms at effective error rates, enabling a direct, cost-based comparison between noisy quantum experiments and classical algorithms.

quant-ph

Quantum-Enhanced Simulated Annealing Using Rydberg Atoms

Quantum-classical hybrid 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 quantum-classical hybrid 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 archieved in K. Kim et al., Scientific Data 11, 111 (2024). 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.

quant-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

Impact-parameter selective Rydberg atom collision by optical tweezers

Cold collisions between two Rydberg rubidium atoms ($^{87}$Rb) are investigated by controlling the impact parameter and collision energy. Optical tweezers are employed to hold one atom stationary while propelling the other to a constant velocity. After the tweezers are deactivated, both atoms are excited to a Rydberg state by a $\pi$-pulse. After a collision, a second $\pi$-pulse is applied. If the stationary atom does not experience a significant momentum transfer and is de-excited to its ground state, it can be recaptured when reactivating the tweezer. The impact parameter dependent collision probability is extracted from the atom loss from the tweezer and used to evaluate the collisional cross section between Rydberg atoms. Quantum and classical simulations of elastic two-body collisions show good agreement with the present experimental data and provide insights into the critical parameter regime where quantum effects become important.

physics.atom-ph

Fast and reliable atom transport by optical tweezers

Movable single atoms have drawn significant attention for their potentials 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 control. 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.

quant-ph

Global boundedness and blow-up in a repulsive chemotaxis-consumption system in higher dimensions

This paper investigates the repulsive chemotaxis-consumption model \begin{align*} \partial_t u &= \nabla \cdot (D(u) \nabla u) + \nabla \cdot (u \nabla v), \\ 0 &= Δv - uv \end{align*} in an $n$-dimensional ball, $n \ge 3$, where the diffusion coefficient $D$ is an appropriate extension of the function $0\leξ\mapsto(1+ξ)^{m-1}$ for some $m>0$. Under the boundary conditions \begin{equation*} ν\cdot (D(u) \nabla u + u \nabla v) = 0 \quad\text{ and }\quad v = M>0,\end{equation*} we first demonstrate that for $m > 1$, or $m = 1$ with $0 < M < 2/(n-2)$, the system admits globally defined classical solutions that are uniformly bounded in time for any choice of sufficiently smooth radial initial data. This result is further extended to the case $0<m<1$ when $M$ is chosen to be sufficiently small, depending on the initial conditions. In contrast, it is shown that for $0 < m < \frac{2}{n}$, the system exhibits blow-up behavior for sufficiently large $M$.

math.AP

Programming higher-order interactions of Rydberg atoms

Higher-order interactions in spin-based Hamiltonians are crucial in addressing numerous fundamentally significant physical problems. In this work, Rydberg-atom graph gadgets are introduced to effectively program $K$-th order interactions within a Rydberg atom system. This approach facilitates the determination of the ground states of an Ising-type Hamiltonian, encoded to solve higher-order unconstrained optimization problems. A favorable scaling behavior, $O(N^K)$, is expected in terms of the number of atoms required for $N$-vertex hypergraph optimization problems.

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

Exploring the impact of graph locality for the resolution of MIS with neutral atom devices

In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By representing a graph with an ensemble of neutral atoms one can leverage Rydberg dynamics to naturally encode the constraints and the solution to MIS. However, the classes of graphs that can be directly mapped ``vertex-to-atom" on standard devices with 2D capabilities are currently limited to Unit-Disk graphs. In this setting, the inherent spatial locality of the graphs can be leveraged by classical polynomial-time approximation schemes (PTAS) that guarantee an $ε$-approximate solution. In this work, we build upon recent progress made for using 3D arrangements of atoms to embed more complex classes of graphs. We report experimental and theoretical results which represent important steps towards tackling combinatorial tasks on quantum computers for which no classical efficient $\varepsilon$-approximation scheme exists.

quant-ph

Regular solutions of chemotaxis-consumption systems involving tensor-valued sensitivities and Robin type boundary conditions

This paper deals with a parabolic-elliptic chemotaxis-consumption system with tensor-valued sensitivity $S(x,n,c)$ under no-flux boundary conditions for $n$ and Robin-type boundary conditions for $c$. The global existence of bounded classical solutions is established in dimension two under general assumptions on tensor-valued sensitivity $S$. One of main steps is to show that $\nabla c(\cdot,t)$ becomes tiny in $L^{2}(B_{r}(x)\cap Ω)$ for every $x\in\overlineΩ$ and $t$ when $r$ is sufficiently small, which seems to be of independent interest. On the other hand, in the case of scalar-valued sensitivity $S=χ(x,n,c)\mathbb{I}$, there exists a bounded classical solution globally in time for two and higher dimensions provided the domain is a ball with radius $R$ and all given data are radial. The result of the radial case covers scalar-valued sensitivity $χ$ that can be singular at $c=0$.

math.AP

Two-qubit atomic gates: Spatio-temporal control of Rydberg interaction

By controlling the temporal and spatial features of light, we propose a novel protocol to prepare two-qubit entangling gates on atoms trapped at close distance, which could potentially speed up the operation of the gate from the sub-micro to the nanosecond scale. The protocol is robust to variations in the pulse areas and the position of the atoms, by virtue of the coherent properties of a dark state, which is used to drive the population through Rydberg states. From the time-domain perspective, the protocol generalizes the one proposed by Jaksch and coworkers [Jaksch et al., Phys. Rev. Lett. 85, 2208 (2000)], with three pulses that operate symmetrically in time, but with different pulse areas. From the spatial-domain perspective, it uses structured light. We analyze the map of the gate fidelity, which forms rotated and distorted lattices in the solution space. Finally, we study the effect of an additional qubit to the gate performance and propose generalizations that operate with multi-pulse sequences.

quant-ph