arXiv subjects

E. Oh

Publications and source records attributed to E. Oh.

10 recordsLinked to original sources

arXiv2026

Atom--photon Entanglement with a Single Trapped Cesium Atom

We demonstrate atom--photon entanglement using a single cesium atom trapped in an optical tweezer. Entanglement is generated by resonant excitation and subsequent spontaneous decay, which entangles the atomic Zeeman state with photon polarization. The photon is collected with a high numerical aperture objective (NA = 0.55) and coupled into a single-mode fiber, enabling atom photon measurements and measurement of the Bell-state fidelity. We obtain raw entanglement fidelity of ${\mathcal F} = 0.942(16)$ and inferred fidelity of ${\mathcal F}_{\rm inf} = 0.962(26)$ after correcting independently characterized atom measurement errors. Compared with related free-space experiments using $^{87}$Rb, the multilevel structure of the relevant excited state in $^{133}$Cs requires the use of a single short excitation pulse in each entanglement attempt in order to suppress unwanted re-excitation. These results establish a free-space Cs atom--photon interface and provide a step toward dual-species Rb--Cs quantum networking.

quant-ph↗

arXiv2026

Efficient and compact quantum network node based on a parabolic mirror on an optical chip

We demonstrate a neutral atom networking node that combines high photon collection efficiency with high atom photon entanglement fidelity in a compact, fiber integrated platform. A parabolic mirror is used both to form the trap and to collect fluorescence from a single rubidium atom, intrinsically mode matching $\sigma$ polarized emitted photons to the fiber and rendering the system largely insensitive to small imperfections or drifts. The core optics consist of millimeter scale components that are pre aligned, rigidly bonded on a monolithic in-vacuum assembly, and interfaced entirely via optical fibers. With this design, we measure an overall photon collection and detection efficiency of $5\%$, from which we infer an overall collection efficiency of $9\%$ after the single--mode fiber coupling. We generate atom photon entangled states with a raw Bell state fidelity of 0.93 and an inferred fidelity of 0.98 after correcting for atom readout errors. The same node design has been realized in two independent setups with comparable performance and is compatible with adding high NA objective lenses to create and control atomic arrays at each node. Our results establish a robust, cavity free neutral atom interface that operates near the limit set by the collection optics numerical aperture and provides a practical building block for scalable quantum network nodes and repeaters.

quant-ph↗

arXiv2022

Multi-scale architecture for fast optical addressing and control of large scale qubit arrays

We present a technique for rapid site-selective control of the quantum state of particles in a large array using a combination of a fast deflector (e.g. an acousto-optic deflector) and a relatively slow spatial light modulator. The use of spatial light modulators for site-selective quantum state manipulation has been limited due to slow transition times preventing rapid, consecutive quantum gates. By partitioning the spatial light modulator into multiple segments, and using a fast deflector to transition between them, it is possible to substantially reduce the average time increment between scanner transitions by increasing the number of gates that can be performed for a single spatial light modulator full frame setting. We analyze the performance of this device in two different configurations: in configuration 1, each segment of the spatial light modulator addresses the full qubit array; in configuration 2, each segment of the spatial light modulator addresses a sub-array and an additional fast deflector positions that sub-array with respect to the full qubit array. With these hybrid scanners we calculate qubit addressing rates that are tens to hundreds of times faster than using an SLM alone.

quant-ph↗

arXiv2022

An architecture for quantum networking of neutral atom processors

Development of a network for remote entanglement of quantum processors is an outstanding challenge in quantum information science. We propose and analyze a two-species architecture for remote entanglement of neutral atom quantum computers based on integration of optically trapped atomic qubit arrays with fast optics for photon collection. One of the atomic species is used for atom-photon entanglement, and the other species provides local processing. We compare the achievable rates of remote entanglement generation for two optical approaches: free space photon collection with a lens and a near-concentric, long working distance resonant cavity. Laser cooling and trapping within the cavity removes the need for mechanical transport of atoms from a source region, which allows for a fast repetition rate. Using optimized values of the cavity finesse, remote entanglement generation rates $> 10^3~\rm s^{-1}$ are predicted for experimentally feasible parameters.

quant-ph↗

arXiv2006

Synchronization transition of heterogeneously coupled oscillators on scale-free networks

We investigate the synchronization transition of the modified Kuramoto model where the oscillators form a scale-free network with degree exponent $\lambda$. An oscillator of degree $k_i$ is coupled to its neighboring oscillators with asymmetric and degree-dependent coupling in the form of $\couplingcoeff k_i^{\eta-1}$. By invoking the mean-field approach, we determine the synchronization transition point $J_c$, which is zero (finite) when $\eta > \lambda-2$ ($\eta < \lambda-2$). We find eight different synchronization transition behaviors depending on the values of $\eta$ and $\lambda$, and derive the critical exponents associated with the order parameter and the finite-size scaling in each case. The synchronization transition is also studied from the perspective of cluster formation of synchronized vertices. The cluster-size distribution and the largest cluster size as a function of the system size are derived for each case using the generating function technique. Our analytic results are confirmed by numerical simulations.

cond-mat.stat-mech↗

arXiv2006

Fractality in complex networks: critical and supercritical skeletons

Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original algorithm introduced by Song et al. [Nature (London) 433, 392 (2005)]; this algorithm enables effective computation and easy implementation. Fractal networks are viewed as comprising a skeleton and shortcuts. The skeleton, embedded underneath the original network, is a special type of spanning tree based on the edge betweenness centrality; it provides a scaffold for the fractality of the network. When the skeleton is regarded as a branching tree, it exhibits a plateau in the mean branching number as a function of the distance from a root. Based on these observations, we construct a fractal network model by combining a random branching tree and local shortcuts. The scaffold branching tree can be either critical or supercritical, depending on the small-worldness of a given network. For the network constructed from the critical (supercritical) branching tree, the average number of vertices within a given box grows with the lateral size of the box according to a power-law (an exponential) form in the cluster-growing method. The distribution of box masses, i.e., the number of vertices within each box, follows a power law P_m(M) sim M^{-eta}. The exponent eta depends on the box lateral size ell_B. For small values of ell_B, eta is equal to the degree exponent gamma of a given scale-free network, whereas eta approaches the exponent tau=gamma/(gamma-1) as ell_B increases, which is the exponent of the cluster-size distribution of the random branching tree. We also study the perimeter of a given box as a function of the box mass.

cond-mat.stat-mech↗

arXiv2006

Network analysis of online bidding activity

With the advent of digital media, people are increasingly resorting to online channels for commercial transactions. Online auction is a prototypical example. In such online transactions, the pattern of bidding activity is more complex than traditional online transactions; this is because the number of bidders participating in a given transaction is not bounded and the bidders can also easily respond to the bidding instantaneously. By using the recently developed network theory, we study the interaction patterns between bidders (items) who (that) are connected when they bid for the same item (if the item is bid by the same bidder). The resulting network is analyzed by using the hierarchical clustering algorithm, which is used for clustering analysis for expression data from DNA microarrays. A dendrogram is constructed for the item subcategories; this dendrogram is compared with a traditional classification scheme. The implication of the difference between the two is discussed.

physics.soc-ph↗

arXiv2005

Modular synchronization in complex networks

We study the synchronization transition (ST) of a modified Kuramoto model on two different types of modular complex networks. It is found that the ST depends on the type of inter-modular connections. For the network with decentralized (centralized) inter-modular connections, the ST occurs at finite coupling constant (behaves abnormally). Such distinct features are found in the yeast protein interaction network and the Internet, respectively. Moreover, by applying the finite-size scaling analysis to an artificial network with decentralized inter-modular connections, we obtain the exponent associated with the order parameter of the ST to be $β\approx 1$ different from $β_{\rm MF} \approx 1/2$ obtained from the scale-free network with the same degree distribution but the absence of modular structure, corresponding to the mean field value.

cond-mat.stat-mech↗

arXiv2003

Ultrafast spectroscopy of propagating coherent acoustic phonons in GaN/InGaN heterostructures

We show that large amplitude, coherent acoustic phonon wavepackets can be generated and detected in In$_x$Ga$_{1-x}$N/GaN epilayers and heterostructures in femtosecond pump-probe differential reflectivity experiments. The amplitude of the coherent phonon increases with increasing Indium fraction $x$ and unlike other coherent phonon oscillations, both \textit{amplitude} and \textit{period} are strong functions of the laser probe energy. The amplitude of the oscillation is substantially and almost instantaneously reduced when the wavepacket reaches a GaN-sapphire interface below the surface indicating that the phonon wavepackets are useful for imaging below the surface. A theoretical model is proposed which fits the experiments well and helps to deduce the strength of the phonon wavepackets. Our model shows that localized coherent phonon wavepackets are generated by the femtosecond pump laser in the epilayer near the surface. The wavepackets then propagate through a GaN layer changing the local index of refraction, primarily through the Franz-Keldysh effect, and as a result, modulate the reflectivity of the probe beam. Our model correctly predicts the experimental dependence on probe-wavelength as well as epilayer thickness.

cond-mat.mes-hall↗

arXiv2002

Betweenness centrality correlation in social networks

Scale-free (SF) networks exhibiting a power-law degree distribution can be grouped into the assortative, dissortative and neutral networks according to the behavior of the degree-degree correlation coefficient. Here we investigate the betweenness centrality (BC) correlation for each type of SF networks. While the BC-BC correlation coefficients behave similarly to the degree-degree correlation coefficients for the dissortative and neutral networks, the BC correlation is nontrivial for the assortative ones found mainly in social networks. The mean BC of neighbors of a vertex with BC $g_i$ is almost independent of $g_i$, implying that each person is surrounded by almost the same influential environments of people no matter how influential the person is.

cond-mat.stat-mech↗