Searcharxiv⌕ Search

arXiv subjects

Xin-Yi Huang

Publications and source records attributed to Xin-Yi Huang.

2 recordsLinked to original sources

High-flux cold lithium-6 and rubidium-87 atoms from compact two-dimensional magneto-optical traps

We report a compact setup with in-series two-dimensional magneto-optical traps (2D MOTs) that provides high-flux cold lithium and rubidium atoms. Thanks to the efficient short-distance Zeeman slowing, the maximum 3D MOT loading rate of lithium atoms reaches a record value of $6.6\times 10^{9}$ atoms/s at a moderate lithium-oven temperature of 372 degrees Celsius, which is 44 times higher than that without the Zeeman slowing light. The flux of rubidium is also as high as $2.3\times10^9$ atoms/s with the rubidium oven held at room temperature. Meanwhile, the entire vacuum-chamber system, including an ultra-high-vacuum science cell, is within a small volume of $55\times65\times70~\mathrm{cm}^3$. Our work represents a substantial improvement over traditional bulky and complex dual-species cold-atom setups. It provides a good starting point for the fast production of a double-degenerate lithium-rubidium atomic mixture and large samples of ultracold lithium-rubidium ground-state molecules.

physics.atom-ph↗

Quantum Algorithm for Anomaly Detection of Sequences

Anomaly detection of sequences is a hot topic in data mining. Anomaly Detection using Piecewise Aggregate approximation in the Amplitude Domain (called ADPAAD) is one of the widely used methods in anomaly detection of sequences. The core step in the classical algorithm for performing ADPAAD is to construct an approximate representation of the subsequence, where the elements of each subsequence are divided into several subsections according to the amplitude domain and then the average of the subsections is computed. It is computationally expensive when processing large-scale sequences. In this paper, we propose a quantum algorithm for ADPAAD, which can divide the subsequence elements and compute the average in parallel. Our quantum algorithm can achieve polynomial speedups on the number of subsequences and the length of subsequences over its classical counterpart.

quant-ph↗