Search

In this work, we propose and demonstrate experimentally a compact technique for the generation of cylindrical vector beams, based on a Michelson interferometer and a $\pi$-astigmatic mode converter, capable of inverting the topological charge of higher-order Laguerre-Gauss beams. Compared to previously demonstrated methods, this is relatively easy to align, and very compact. In addition, it generalises the concept of astigmatic mode conversion, commonly associated with scalar beams, to vector beams with non-homogeneous polarisation distribution. We anticipate that many of the applications based on Michelson interferometers will benefit from the unique properties of vector beams., Comment: 5 pages, 4 figures

Klein's paradox refers to the transmission of a relativistic particle through a high potential barrier. Although it has a simple resolution in terms of particle-to-antiparticle tunneling (Klein tunneling), debates on its physical meaning seem lasting partially due to the lack of direct experimental verification. In this article, we point out that honeycomb-type photonic crystals (PhCs) provide an ideal platform to investigate the nature of Klein tunneling, where the effective Dirac mass can be tuned in a relatively easy way from a positive value (trivial PhC) to a negative value (topological PhC) via a zero-mass case (PhC graphene). Especially, we show that analysis of the transmission between domains with opposite Dirac masses -- a case hardly be treated within the scheme available so far -- sheds new light on the understanding of the Klein tunneling., Comment: 18 pages, 6 figures

Electronic band structures in hydrogenated graphene are theoretically investigated by means of first-principle calculations and an effective tight-binding model. It is shown that regularly designed hydrogenation to graphene gives rise to a large band gap about 1 eV. Remarkably, by changing the spatial pattern of the hydrogenation, topologically distinct states can be realized, where the topological nontriviality is detected by $C_2$ parity indices in bulk and confirmed by the existence of gapless edge/interface states as protected by the mirror and sublattice symmetries. The analysis of the wave functions reveals that the helical edge states in hydrogenated graphene with the appropriate design carry pseudospin currents that are reminiscent of the quantum spin Hall effect. Our work shows the potential of hydrogenated graphene in pseudospin-based device applications., Comment: 9 pages, 5 figures

This paper explores the challenges in evaluating machine learning (ML) models for continuous health monitoring using wearable devices beyond conventional metrics. We state the complexities posed by real-world variability, disease dynamics, user-specific characteristics, and the prevalence of false notifications, necessitating novel evaluation strategies. Drawing insights from large-scale heart studies, the paper offers a comprehensive guideline for robust ML model evaluation on continuous health monitoring.

A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and debugging, query explanation, IoT analytics, multi-layer network routing, etc. In this paper, we study the smallest witness problem (SWP) for the class of conjunctive queries (CQs) without self-joins. We first establish the dichotomy that SWP for a CQ can be computed in polynomial time if and only if it has {\em head-cluster property}, unless $\texttt{P} = \texttt{NP}$. We next turn to the approximated version by relaxing the size of a witness from being minimum. We surprisingly find that the {\em head-domination} property - that has been identified for the deletion propagation problem \cite{kimelfeld2012maximizing} - can also precisely capture the hardness of the approximated smallest witness problem. In polynomial time, SWP for any CQ with head-domination property can be approximated within a constant factor, while SWP for any CQ without such a property cannot be approximated within a logarithmic factor, unless $\texttt{P} = \texttt{NP}$. We further explore efficient approximation algorithms for CQs without head-domination property: (1) we show a trivial algorithm which achieves a polynomially large approximation ratio for general CQs; (2) for any CQ with only one non-output attribute, such as star CQs, we show a greedy algorithm with a logarithmic approximation ratio; (3) for line CQs, which contain at least two non-output attributes, we relate SWP problem to the directed steiner forest problem, whose algorithms can be applied to line CQs directly. Meanwhile, we establish a much higher lower bound, exponentially larger than the logarithmic lower bound obtained above. It remains open to close the gap between the lower and upper bound of the approximated SWP for CQs without head-domination property.

We investigate interference between topological interfacial modes in a semiconductor photonic crystal platform with Dirac frequency dispersions, which can be exploited for interferometry switch. It is showcased that, in a two-in/two-out structure with four topological waveguides, geometric phases of the two-component spinor wavefunctions of topological photonic modes accumulate at turning points of waveguides, which govern the interferences and split the electromagnetic energy into two output ports with relative power ratio tunable by the relative phase of inputs. We unveil that this brand-new photonic phenomenon is intimately related to the spin-momentum locking property of quantum spin Hall effect, and results from the symphonic contributions of three phase variables: the spinor phase and geometric phase upon design, and the global phase controlled from outside. The present findings open the door for manipulating topological interfacial modes, thus exposing a new facet of topological physics. The topology-driven interference can be incorporated into other devices which is expected to leave far-reaching impacts to advanced photonics, optomechanics and phononics applications., Comment: 25 pages, 4 figures

Grasping algorithms have evolved from planar depth grasping to utilizing point cloud information, allowing for application in a wider range of scenarios. However, data-driven grasps based on models trained on basic open-source datasets may not perform well on novel objects, which are often required in different scenarios, necessitating fine-tuning using new objects. The data driving these algorithms essentially corresponds to the closing region of the hand in 6D pose, and due to the uniqueness of 6D pose, synthetic annotation or real-machine annotation methods are typically employed. Acquiring large amounts of data with real-machine annotation is challenging, making synthetic annotation a common practice. However, obtaining annotated 6D pose data using conventional methods is extremely time-consuming. Therefore, we propose a method to quickly acquire data for novel objects, enabling more efficient fine-tuning. Our method primarily samples grasp orientations to generate and annotate grasps. Experimental results demonstrate that our fine-tuning process for a new object is 400 \% faster than other methods. Furthermore, we propose an optimized grasp annotation framework that accounts for the effects of the gripper closing, making the annotations more reasonable. Upon acceptance of this paper, we will release our algorithm as open-source.

We unveil that the holey graphyne (HGY), a two-dimensional carbon allotrope where benzene rings are connected by two $-$C$\equiv$C$-$ bonds fabricated recently in a bottom-up way, exhibits topological electronic states. Using first-principles calculations and Wannier tight-binding modeling, we discover a higher-order topological invariant associated with $C_2$ symmetry of the material, and show that the resultant corner modes appear in nanoflakes matching to the structure of precursor reported previously, which are ready for direct experimental observations. In addition, we find that a band inversion between emergent $g$-like and $h$-like orbitals gives rise to a nontrivial topology characterized by $\mathbb{Z}_2$ invariant protected by an energy gap as large as 0.52 eV, manifesting helical edge states mimicking those in the prominent quantum spin Hall effect, which can be accessed experimentally after hydrogenation in HGY. We hope these findings trigger interests towards exploring the topological electronic states in HGY and related future electronics applications., Comment: 19+20 pages, 4+7 figures

Atrial fibrillation (AF) is a prevalent cardiac arrhythmia associated with significant health ramifications, including an elevated susceptibility to ischemic stroke, heart disease, and heightened mortality. Photoplethysmography (PPG) has emerged as a promising technology for continuous AF monitoring for its cost-effectiveness and widespread integration into wearable devices. Our team previously conducted an exhaustive review on PPG-based AF detection before June 2019. However, since then, more advanced technologies have emerged in this field. This paper offers a comprehensive review of the latest advancements in PPG-based AF detection, utilizing digital health and artificial intelligence (AI) solutions, within the timeframe spanning from July 2019 to December 2022. Through extensive exploration of scientific databases, we have identified 59 pertinent studies. Our comprehensive review encompasses an in-depth assessment of the statistical methodologies, traditional machine learning techniques, and deep learning approaches employed in these studies. In addition, we address the challenges encountered in the domain of PPG-based AF detection. Furthermore, we maintain a dedicated website to curate the latest research in this area, with regular updates on a regular basis.

Atrial fibrillation (AF) is the most common type of cardiac arrhythmia. It is associated with an increased risk of stroke, heart failure, and other cardiovascular complications, but can be clinically silent. Passive AF monitoring with wearables may help reduce adverse clinical outcomes related to AF. Detecting AF in noisy wearable data poses a significant challenge, leading to the emergence of various deep learning techniques. Previous deep learning models learn from a single modality, either electrocardiogram (ECG) or photoplethysmography (PPG) signals. However, deep learning models often struggle to learn generalizable features and rely on features that are more susceptible to corruption from noise, leading to sub-optimal performances in certain scenarios, especially with low-quality signals. Given the increasing availability of ECG and PPG signal pairs from wearables and bedside monitors, we propose a new approach, SiamAF, leveraging a novel Siamese network architecture and joint learning loss function to learn shared information from both ECG and PPG signals. At inference time, the proposed model is able to predict AF from either PPG or ECG and outperforms baseline methods on three external test sets. It learns medically relevant features as a result of our novel architecture design. The proposed model also achieves comparable performance to traditional learning regimes while requiring much fewer training labels, providing a potential approach to reduce future reliance on manual labeling.

Symmetric informationally complete measurements are both important building blocks in many quantum information protocols and the seminal example of a generalised, non-orthogonal, quantum measurement. In higher-dimensional systems, these measurements become both increasingly interesting and increasingly complex to implement. Here, we demonstrate an integrated quantum photonic platform to realize such a measurement on three-level quantum systems. The device operates at the high fidelities necessary for verifying a genuine many-outcome quantum measurement, performing near-optimal quantum state discrimination, and beating the projective limit in quantum random number generation. Moreover, it is programmable and can readily implement other quantum measurements at similarly high quality. Our work paves the way for the implementation of sophisticated higher-dimensional quantum measurements that go beyond the traditional orthogonal projections., Comment: 21 pages,13 figures

Storage-based joins are still commonly used today because the memory budget does not always scale with the data size. One of the many join algorithms developed that has been widely deployed and proven to be efficient is the Hybrid Hash Join (HHJ), which is designed to exploit any available memory to maximize the data that is joined directly in memory. However, HHJ cannot fully exploit detailed knowledge of the join attribute correlation distribution. In this paper, we show that given a correlation skew in the join attributes, HHJ partitions data in a suboptimal way. To do that, we derive the optimal partitioning using a new cost-based analysis of partitioning-based joins that is tailored for primary key - foreign key (PK-FK) joins, one of the most common join types. This optimal partitioning strategy has a high memory cost, thus, we further derive an approximate algorithm that has tunable memory cost and leads to near-optimal results. Our algorithm, termed NOCAP (Near-Optimal Correlation-Aware Partitioning) join, outperforms the state-of-the-art for skewed correlations by up to $30\%$, and the textbook Grace Hash Join by up to $4\times$. Further, for a limited memory budget, NOCAP outperforms HHJ by up to $10\%$, even for uniform correlation. Overall, NOCAP dominates state-of-the-art algorithms and mimics the best algorithm for a memory budget varying from below $\sqrt{\|\text{relation}\|}$ to more than $\|\text{relation}\|$.

Electrons and positrons produced in dark matter annihilation can generate secondary emission through synchrotron and IC processes, and such secondary emission provides a possible means to detect DM particles with masses beyond the detector's energy band. The secondary emission of heavy dark matter (HDM) particles in the TeV-PeV mass range lies within the Fermi-LAT energy band. In this paper, we utilize the Fermi-LAT observations of dwarf spheroidal (dSph) galaxies to search for annihilation signals of HDM particles. We consider the propagation of $e^+/e^-$ produced by DM annihilation within the dSphs, derive the electron spectrum of the equilibrium state by solving the propagation equation, and then compute the gamma-ray signals produced by the $e^+/e^-$ population through the IC and synchrotron processes. Considering the spatial diffusion of electrons, the dSphs are modeled as extended sources in the analysis of Fermi-LAT data according to the expected spatial intensity distribution of the gamma rays. We do not detect any significant HDM signal. By assuming a magnetic field strength of $B=1\,{\rm \mu G}$ and a diffusion coefficient of $D_0 = 3\times10^{28}\,{\rm cm^{2}s^{-1}}$ of the dSphs, we place limits on the annihilation cross section for HDM particles. Our results are weaker than the previous limits given by the VERITAS and IceCube observations of dSphs, but extend the existing limits to higher DM masses. As a complement, we also search for the prompt $\gamma$-rays produced by DM annihilation and give limits on the cross section in the 10-$10^5$ GeV mass range. Consequently, in this paper we obtain the upper limits on the DM annihilation cross section for a very wide mass range from 10 GeV to 100 PeV in a unified framework of the Fermi-LAT data analysis., Comment: 11 pages, 9 figures; add the KN effect for IC and model the secondary emission around dSphs as extended

Distributed quantum computing provides a viable approach towards scalable quantum computation, which relies on nonlocal quantum gates to connect distant quantum nodes, to overcome the limitation of a single device. However, such an approach has only been realized within single nodes or between nodes separated by a few tens of meters, preventing the target of harnessing computing resources in large-scale quantum networks. Here, we demonstrate distributed quantum computing between two nodes spatially separated by 7.0 km, using stationary qubits based on multiplexed quantum memories, flying qubits at telecom wavelengths, and active feedforward control based on field-deployed fiber. Specifically, we illustrate quantum parallelism by implementing Deutsch-Jozsa algorithm and quantum phase estimation algorithm between the two remote nodes. These results represent the first demonstration of distributed quantum computing over metropolitan-scale distances and lay the foundation for the construction of large-scale quantum computing networks relying on existing fiber channels., Comment: 6 pages, 3 figures

The range and speed of a moving object can be ascertained using the sensing technique known as light detection and ranging (LiDAR). It has recently been suggested that quantum LiDAR, which uses entangled states of light, can enhance the capabilities of LiDAR. Entangled pulsed light is used in prior quantum LiDAR approaches to assess both range and velocity at the same time using the pulses' time of flight and Doppler shift. The entangled pulsed light generation and detection, which are crucial for pulsed quantum LiDAR, are often inefficient. Here, we study a quantum LiDAR that operates on a frequency-modulated continuous wave (FMCW), as opposed to pulses. We first outline the design of the quantum FMCW LiDAR using entangled frequency-modulated photons in a Mach-Zehnder interferometer, and we demonstrate how it can increase accuracy and resolution for range and velocity measurements by $\sqrt{n}$ and $n$, respectively, with $n$ entangled photons. We also demonstrate that quantum FMCW LiDAR may perform simultaneous measurements of the range and velocity without the need for quantum pulsed compression, which is necessary in pulsed quantum LiDAR. Since the generation of entangled photons is the only inefficient nonlinear optical process needed, the quantum FMCW LiDAR is better suited for practical implementations. Additionally, most measurements in the quantum FMCW LiDAR can be carried out electronically by down-converting optical signal to microwave region.

Smart watches and other wearable devices are equipped with photoplethysmography (PPG) sensors for monitoring heart rate and other aspects of cardiovascular health. However, PPG signals collected from such devices are susceptible to corruption from noise and motion artifacts, which cause errors in heart rate estimation. Typical denoising approaches filter or reconstruct the signal in ways that eliminate much of the morphological information, even from the clean parts of the signal that would be useful to preserve. In this work, we develop an algorithm for denoising PPG signals that reconstructs the corrupted parts of the signal, while preserving the clean parts of the PPG signal. Our novel framework relies on self-supervised training, where we leverage a large database of clean PPG signals to train a denoising autoencoder. As we show, our reconstructed signals provide better estimates of heart rate from PPG signals than the leading heart rate estimation methods. Further experiments show significant improvement in Heart Rate Variability (HRV) estimation from PPG signals using our algorithm. We conclude that our algorithm denoises PPG signals in a way that can improve downstream analysis of many different health metrics from wearable devices., Comment: 13 pages, 6 figures

Background: Rapid, reliable, and accurate interpretation of medical signals is crucial for high-stakes clinical decision-making. The advent of deep learning allowed for an explosion of new models that offered unprecedented performance in medical time series processing but at a cost: deep learning models are often compute-intensive and lack interpretability. Methods: We propose Sparse Mixture of Learned Kernels (SMoLK), an interpretable architecture for medical time series processing. The method learns a set of lightweight flexible kernels to construct a single-layer neural network, providing not only interpretability, but also efficiency and robustness. We introduce novel parameter reduction techniques to further reduce the size of our network. We demonstrate the power of our architecture on two important tasks: photoplethysmography (PPG) artifact detection and atrial fibrillation detection from single-lead electrocardiograms (ECGs). Our approach has performance similar to the state-of-the-art deep neural networks with several orders of magnitude fewer parameters, allowing for deep neural network level performance with extremely low-power wearable devices. Results: Our interpretable method achieves greater than 99% of the performance of the state-of-the-art methods on the PPG artifact detection task, and even outperforms the state-of-the-art on a challenging out-of-distribution test set, while using dramatically fewer parameters (2% of the parameters of Segade, and about half of the parameters of Tiny-PPG). On single lead atrial fibrillation detection, our method matches the performance of a 1D-residual convolutional network, at less than 1% the parameter count, while exhibiting considerably better performance in the low-data regime, even when compared to a parameter-matched control deep network., Comment: 26 pages, 9 figures

The rapid development of online recruitment services has encouraged the utilization of recommender systems to streamline the job seeking process. Predominantly, current job recommendations deploy either collaborative filtering or person-job matching strategies. However, these models tend to operate as "black-box" systems and lack the capacity to offer explainable guidance to job seekers. Moreover, conventional matching-based recommendation methods are limited to retrieving and ranking existing jobs in the database, restricting their potential as comprehensive career AI advisors. To this end, here we present GIRL (GeneratIve job Recommendation based on Large language models), a novel approach inspired by recent advancements in the field of Large Language Models (LLMs). We initially employ a Supervised Fine-Tuning (SFT) strategy to instruct the LLM-based generator in crafting suitable Job Descriptions (JDs) based on the Curriculum Vitae (CV) of a job seeker. Moreover, we propose to train a model which can evaluate the matching degree between CVs and JDs as a reward model, and we use Proximal Policy Optimization (PPO)-based Reinforcement Learning (RL) method to further fine-tine the generator. This aligns the generator with recruiter feedback, tailoring the output to better meet employer preferences. In particular, GIRL serves as a job seeker-centric generative model, providing job suggestions without the need of a candidate set. This capability also enhances the performance of existing job recommendation models by supplementing job seeking features with generated content. With extensive experiments on a large-scale real-world dataset, we demonstrate the substantial effectiveness of our approach. We believe that GIRL introduces a paradigm-shifting approach to job recommendation systems, fostering a more personalized and comprehensive job-seeking experience.

We study synthetic data release for answering multiple linear queries over a set of database tables in a differentially private way. Two special cases have been considered in the literature: how to release a synthetic dataset for answering multiple linear queries over a single table, and how to release the answer for a single counting (join size) query over a set of database tables. Compared to the single-table case, the join operator makes query answering challenging, since the sensitivity (i.e., by how much an individual data record can affect the answer) could be heavily amplified by complex join relationships. We present an algorithm for the general problem, and prove a lower bound illustrating that our general algorithm achieves parameterized optimality (up to logarithmic factors) on some simple queries (e.g., two-table join queries) in the most commonly-used privacy parameter regimes. For the case of hierarchical joins, we present a data partition procedure that exploits the concept of {\em uniformized sensitivities} to further improve the utility.

Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary encodings, which preserve global coherence until a measurement is performed. Contrasting this, we here demonstrate a distributed task based on a qubit channel, for which irreversible encoding operations can outperform any possible coherence-preserving protocol. This corresponds to using high-dimensional entanglement and encoding information by compressing one of the subsystems into a qubit. Demonstrating this phenomenon requires the preparation of a four-dimensional maximally entangled state, the compression of two qubits into one and joint qubit-ququart entangled measurements, with all modules executed at near-optimal fidelity. We report on a proof-of-principle experiment that achieves the advantage by realizing separate systems in distinct and independently controlled paths of a single photon. Our result demonstrates the relevance of high-dimensional entanglement and non-unitary operations for enhancing the communication capabilities of standard qubit transmissions., Comment: 7 pages, 5 figures + appendix. Comments are welcome. V2: expanded and reformatted theory section, added experimental details

Given a dataset of $n$ i.i.d. samples from an unknown distribution $P$, we consider the problem of generating a sample from a distribution that is close to $P$ in total variation distance, under the constraint of differential privacy (DP). We study the problem when $P$ is a multi-dimensional Gaussian distribution, under different assumptions on the information available to the DP mechanism: known covariance, unknown bounded covariance, and unknown unbounded covariance. We present new DP sampling algorithms, and show that they achieve near-optimal sample complexity in the first two settings. Moreover, when $P$ is a product distribution on the binary hypercube, we obtain a pure-DP algorithm whereas only an approximate-DP algorithm (with slightly worse sample complexity) was previously known.

Preference-based reinforcement learning (PbRL) provides a natural way to align RL agents' behavior with human desired outcomes, but is often restrained by costly human feedback. To improve feedback efficiency, most existing PbRL methods focus on selecting queries to maximally improve the overall quality of the reward model, but counter-intuitively, we find that this may not necessarily lead to improved performance. To unravel this mystery, we identify a long-neglected issue in the query selection schemes of existing PbRL studies: Query-Policy Misalignment. We show that the seemingly informative queries selected to improve the overall quality of reward model actually may not align with RL agents' interests, thus offering little help on policy learning and eventually resulting in poor feedback efficiency. We show that this issue can be effectively addressed via near on-policy query and a specially designed hybrid experience replay, which together enforce the bidirectional query-policy alignment. Simple yet elegant, our method can be easily incorporated into existing approaches by changing only a few lines of code. We showcase in comprehensive experiments that our method achieves substantial gains in both human feedback and RL sample efficiency, demonstrating the importance of addressing query-policy misalignment in PbRL tasks., Comment: Accepted by ICLR 2024

Offline-to-online reinforcement learning (RL), by combining the benefits of offline pretraining and online finetuning, promises enhanced sample efficiency and policy performance. However, existing methods, effective as they are, suffer from suboptimal performance, limited adaptability, and unsatisfactory computational efficiency. We propose a novel framework, PROTO, which overcomes the aforementioned limitations by augmenting the standard RL objective with an iteratively evolving regularization term. Performing a trust-region-style update, PROTO yields stable initial finetuning and optimal final performance by gradually evolving the regularization term to relax the constraint strength. By adjusting only a few lines of code, PROTO can bridge any offline policy pretraining and standard off-policy RL finetuning to form a powerful offline-to-online RL pathway, birthing great adaptability to diverse methods. Simple yet elegant, PROTO imposes minimal additional computation and enables highly efficient online finetuning. Extensive experiments demonstrate that PROTO achieves superior performance over SOTA baselines, offering an adaptable and efficient offline-to-online RL framework.

We present a result of side-channel-secure (SCS) quantum key distribution (QKD) under fully realistic conditions. Our result is not only measurement-device independent but also effective with imperfect (and unstable) source devices including imperfect vacuum and imperfect coherent-state source. Applying the virtual mapping idea, we present a general security proof under whatever out-side-lab attack, including whatever side-channel coherent attack. As a byproduct, we also present an improved method for SCS protocols which can raise the key rate by 1-2 orders of magnitude. Using these results, we obtain a non-asymptotic key rate which is instantly useful with full realistic conditions., Comment: Typos corrected

We designed and experimentally demonstrated a silicon photonics-integrated time-domain balanced homodyne detector (TBHD), whose optical part has dimensions of 1.5 mm * 0.4 mm. To automatically and accurately balance the detector, new variable optical attenuators were used, and a common mode rejection ratio of 86.9 dB could be achieved. In the quantum tomography experiment, the density matrix and Wigner function of a coherent state were reconstructed with 99.97 % fidelity. The feasibility of this TBHD in a continuous-variable quantum key distribution (CVQKD) system was also demonstrated. This facilitates the integration of the optical circuits of the CVQKD system based on the GG02 protocol on the silicon photonics chip using TBHD.