Searcharxiv⌕ Search

arXiv subjects

Yu Zheng

Publications and source records attributed to Yu Zheng.

At least 217 records · Page 12Linked to original sources

Heisenberg-Limited Waveform Estimation with Solid-State Spins in Diamond

The newly established Heisenberg limit in arbitrary waveform estimation is quite different with parameter estimation and shows a unique characteristic of a future quantum version of oscilloscope. However, it is still a non-trivial challenge to generate a large number of exotic quantum entangled states to achieve this quantum limit. Here, by employing the time-domain quantum difference detection method, we demonstrate Heisenberg-limited waveform quantum estimation with diamond spins under ambient condition in the experiment. Periodic dynamical decoupling is applied to enhance both the dynamic range and sensitivity by one order of magnitude. Using this quantum-enhanced estimation scheme, the estimation error of an unknown waveform is reduced by more than $5$ dB below the standard quantum limit with $N\sim{\text{2}} \times {\text{1}}{\text{0}^3}$ resources, where more than ${1 \times {\text{1}}{\text{0}^5}}$ resources would be required to achieve a similar error level using classical detection. This work provides an essential step towards realizing quantum-enhanced structure recognition in a continuous space and time.

quant-ph↗

Focus the electromagnetic field to $10^{-6} λ$ for ultra-high enhancement of field-matter interaction

Focusing electromagnetic field to enhance the interaction with matter has been promoting researches and applications of nano electronics and photonics. Usually, the evanescent-wave coupling is adopted in various nano structures and materials to confine the electromagnetic field into a subwavelength space. Here, based on the direct coupling with confined electron oscillations in a nanowire, we demonstrate an extreme localization of microwave field down to 10$^{-6}λ$. A hybrid nanowire-bowtie antenna is further designed to focus the free-space microwave to this deep-subwavelength space. Detected by the nitrogen vacancy center in diamond, the field intensity and microwave-spin interaction strength are enhanced by 2.0$\times$10$^{8}$ and 1.4$\times$10$^{4}$ times, respectively. Such an extreme concentration of microwave field will further promote integrated quantum information processing, sensing and microwave photonics in a nanoscale system.

physics.optics↗

Fast high-fidelity geometric quantum control with quantum brachistochrones

We experimentally demonstrate fast and high-fidelity geometric control of a quantum system with the most brachistochrone method on hybrid spin registers in diamond. Based on the time-optimal universal geometric control, single geometric gates with the fidelities over 99.2% on the spin state of nitrogen-vacancy center are realized with average durations shortened by 74.9%, comparing with conventional geometric method. The fidelity of the fast geometric two-qubit gate exceeds 96.5% on the hybrid spin registers. With these fast high-fidelity gates available, we implement quantum entanglement-enhanced phase estimation algorithm and demonstrate the Heisenberg quantum limit at room-temperature. By comparing with the conventional geometric circuit, the measurement bandwidth and sensitivity is enhanced by 3.5 and 2.9 times. Hence, our results show that high-fidelity quantum control based on a fast geometric route will be a versatile tool for broad applications of quantum information processing in practice.

quant-ph↗

Site-Controlled Telecom Single-Photon Emitters in Atomically-thin MoTe2

Quantum emitters (QEs) in two-dimensional transition metal dichalcogenides (2D TMDCs) have advanced to the forefront of quantum communication and transduction research due to their unique potentials in accessing valley pseudo-spin degree of freedom (DOF) and facile integration into quantum-photonic, electronic and sensing platforms via the layer-by-layer-assembly approach. To date, QEs capable of operating in O-C telecommunication bands have not been demonstrated in TMDCs. Here we report a deterministic creation of such telecom QEs emitting over the 1080 to 1550 nm wavelength range via coupling of 2D molybdenum ditelluride (MoTe2) to strain inducing nano-pillar arrays. Our Hanbury Brown and Twiss experiment conducted at 10 K reveals clear photon antibunching with 90% single photon purity. Ultra-long lifetimes, 4-6 orders of magnitude longer than that of the 2D exciton, are also observed. Polarization analysis further reveals that while some QEs display cross-linearly polarized doublets with ~1 meV splitting resulting from the strain induced anisotropic exchange interaction, valley degeneracy is preserved in other QEs. Valley Zeeman splitting as well as restoring of valley symmetry in cross-polarized doublets are observed under 8T magnetic field. In contrast to other telecom QEs, our QEs which offer the potential to access valley DOF through single photons, could lead to unprecedented advantages in optical fiber-based quantum networks.

cond-mat.mes-hall↗

The logarithmic Sobolev inequality for a submanifold in manifold with nonnegative sectional curvature

We prove a sharp logarithmic Sobolev inequality which holds for compact submanifolds without boundary in Riemannian manifold with nonnegative sectional curvature of arbitrary dimension and codimension, while the ambient manifold needs to have a specific Euclid-like property. Like the Michael-Simon Sobolev inequality, this inequality includes a term involving the mean curvature. This extends a recent result of S. Brendle with Euclidean setting.

math.DG↗

Attack-Resilient Weighted $\ell_1$ Observer with Prior Pruning

Security related questions for Cyber Physical Systems (CPS) have attracted much research attention in searching for novel methods for attack-resilient control and/or estimation. Specifically, false data injection attacks (FDIAs) have been shown to be capable of bypassing bad data detection (BDD), while arbitrarily compromising the integrity of state estimators and robust controller even with very sparse measurements corruption. Moreover, based on the inherent sparsity of pragmatic attack signals, $\ell_1$-minimization scheme has been used extensively to improve the design of attack-resilient estimators. For this, the theoretical maximum for the percentage of compromised nodes that can be accommodated has been shown to be $50\%$. In order to guarantee correct state recoveries for larger percentage of attacked nodes, researchers have begun to incorporate prior information into the underlying resilient observer design framework. For the most pragmatic cases, this prior information is often obtained through some data-driven machine learning process. Existing results have shown strong positive correlation between the tolerated attack percentages and the precision of the prior information. In this paper, we present a pruning method to improve the precision of the prior information, given corresponding stochastic uncertainty characteristics of the underlying machine learning model. Then a weighted $\ell_1$-minimization is proposed based on the pruned prior. The theoretical and simulation results show that the pruning method significantly improves the observer performance for much larger attack percentages, even when moderately accurate machine learning model used.

math.OC↗

Gaussian conversion protocols for cubic phase state generation

Universal quantum computing with continuous variables requires non-Gaussian resources, in addition to a Gaussian set of operations. A known resource enabling universal quantum computation is the cubic phase state, a non-Gaussian state whose experimental implementation has so far remained elusive. In this paper, we introduce two Gaussian conversion protocols that allow for the conversion of a non-Gaussian state that has been achieved experimentally, namely the trisqueezed state [Sandbo Changet al., Phys. Rev. X10, 011011 (2020)],to a cubic phase state. The first protocol is deterministic and it involves active (in-line) squeezing, achieving large fidelities that saturate the bound for deterministic Gaussian protocols. The second protocol is probabilistic and it involves an auxiliary squeezed state, thus removing the necessity of in-line squeezing but still maintaining significant success probabilities and fidelities even larger than for the deterministic case. The success of these protocols provides strong evidence for using trisqueezed states as resources for universal quantum computation.

quant-ph↗

Disentangling User Interest and Conformity for Recommendation with Causal Embedding

Recommendation models are usually trained on observational interaction data. However, observational interaction data could result from users' conformity towards popular items, which entangles users' real interest. Existing methods tracks this problem as eliminating popularity bias, e.g., by re-weighting training samples or leveraging a small fraction of unbiased data. However, the variety of user conformity is ignored by these approaches, and different causes of an interaction are bundled together as unified representations, hence robustness and interpretability are not guaranteed when underlying causes are changing. In this paper, we present DICE, a general framework that learns representations where interest and conformity are structurally disentangled, and various backbone recommendation models could be smoothly integrated. We assign users and items with separate embeddings for interest and conformity, and make each embedding capture only one cause by training with cause-specific data which is obtained according to the colliding effect of causal inference. Our proposed methodology outperforms state-of-the-art baselines with remarkable improvements on two real-world datasets on top of various backbone models. We further demonstrate that the learned embeddings successfully capture the desired causes, and show that DICE guarantees the robustness and interpretability of recommendation.

cs.IR↗

Experimental implementation of universal holonomic quantum computation on solid-state spins with optimal control

Experimental realization of a universal set of quantum logic gates with high-fidelity is critical to quantum information processing, which is always challenging by inevitable interaction between the quantum system and environment. Geometric quantum computation is noise immune, and thus offers a robust way to enhance the control fidelity. Here, we experimentally implement the recently proposed extensible nonadiabatic holonomic quantum computation with solid spins in diamond at room-temperature, which maintains both flexibility and resilience against decoherence and system control errors. Compared with previous geometric method, the fidelities of a universal set of holonomic single-qubit and two-qubit quantum logic gates are improved in experiment. Therefore, this work makes an important step towards fault-tolerant scalable geometric quantum computation in realistic systems.

quant-ph↗

Topological Transformations in Hyperuniform Pentagonal 2D Materials Induced by Stone-Wales Defects

We discover two distinct topological pathways through which the pentagonal Cairo tiling (P5), a structural model for single-layer $AB_2$ pyrite materials, respectively transforms into a crystalline rhombus-hexagon (C46) tiling and random rhombus-pentagon-hexagon (R456) tilings, by continuously introducing the Stone-Wales (SW) topological defects. We find these topological transformations are controlled by the orientation correlations among neighboring $B$-$B$ bonds, and exhibit a phenomenological analogy of the (anti)ferromagnetic to paramagnetic transition in two-state Ising systems. Unlike the SW defects in hexagonal 2D materials such as graphene, which cause distortions, the defects in pentagonal 2D materials preserve the shape and symmetry of the fundamental cell of P5 tiling and are associated with a minimal energy cost, making the intermediate R456 tilings realizable metastable states at room temperature. Moreover, the intermediate structures along the two pathways are neither crystals nor quasicrystals, and yet these random tilings preserve hyperuniformity of the P5 or C46 crystal (i.e., the infinite-wavelength normalized density fluctuations are completely suppressed), and can be viewed as 2D analogs of disordered Barlow packings in three dimensions. The resulting 2D materials possess metal-like electronic properties, making them promising candidates for forming Schottky barriers with the semiconducting P5 material.

cond-mat.soft↗

Towards Better Bus Networks: A Visual Analytics Approach

Bus routes are typically updated every 3-5 years to meet constantly changing travel demands. However, identifying deficient bus routes and finding their optimal replacements remain challenging due to the difficulties in analyzing a complex bus network and the large solution space comprising alternative routes. Most of the automated approaches cannot produce satisfactory results in real-world settings without laborious inspection and evaluation of the candidates. The limitations observed in these approaches motivate us to collaborate with domain experts and propose a visual analytics solution for the performance analysis and incremental planning of bus routes based on an existing bus network. Developing such a solution involves three major challenges, namely, a) the in-depth analysis of complex bus route networks, b) the interactive generation of improved route candidates, and c) the effective evaluation of alternative bus routes. For challenge a, we employ an overview-to-detail approach by dividing the analysis of a complex bus network into three levels to facilitate the efficient identification of deficient routes. For challenge b, we improve a route generation model and interpret the performance of the generation with tailored visualizations. For challenge c, we incorporate a conflict resolution strategy in the progressive decision-making process to assist users in evaluating the alternative routes and finding the most optimal one. The proposed system is evaluated with two usage scenarios based on real-world data and received positive feedback from the experts.

cs.HC↗

Does Unsupervised Architecture Representation Learning Help Neural Architecture Search?

Existing Neural Architecture Search (NAS) methods either encode neural architectures using discrete encodings that do not scale well, or adopt supervised learning-based methods to jointly learn architecture representations and optimize architecture search on such representations which incurs search bias. Despite the widespread use, architecture representations learned in NAS are still poorly understood. We observe that the structural properties of neural architectures are hard to preserve in the latent space if architecture representation learning and search are coupled, resulting in less effective search performance. In this work, we find empirically that pre-training architecture representations using only neural architectures without their accuracies as labels considerably improve the downstream architecture search efficiency. To explain these observations, we visualize how unsupervised architecture representation learning better encourages neural architectures with similar connections and operators to cluster together. This helps to map neural architectures with similar performance to the same regions in the latent space and makes the transition of architectures in the latent space relatively smooth, which considerably benefits diverse downstream search strategies.

cs.CV↗

Attack-resilient observer pruning for path-tracking control of Wheeled Mobile Robot

Path-tracking control of wheeled mobile robot (WMR) has gained a lot of research attention, primarily because of its wide applicability -- for example intelligent wheelchairs, exploration-assistant remote WMR. Recent increase in remote and autonomous operations\requirements for WMR has led to more and more use of IoT devices within the control loop. Consequently, providing interfaces for malicious interactions through false data injection attacks (FDIA). Moreover, optimization-based FDIAs have been shown to cause catastrophic consequences in feedback control systems while by-passing any residual-based monitoring system. Since these attacks target system measurement process, this paper focuses on the problem of improving the resiliency of dynamical observers against FDIA. Specifically, we propose an attack-resilient pruning algorithm which attempts to exclude compromised channels from being processed by the observer. The proposed pruning algorithm improves attack-localization precision to $100\%$ with high probability, which correspondingly improves the resiliency of the underlying UKF to FDIA. The improvements due to the developed resilient pruning-based observer is validated through a numerical simulation of a two-layer path-tracking control platform of differential-driven wheeled mobile robot (DDWMR) under FDIA.

math.OC↗

Space Efficient Deterministic Approximation of String Measures

We study approximation algorithms for the following three string measures that are widely used in practice: edit distance (ED), longest common subsequence (LCS), and longest increasing sequence (LIS). All three problems can be solved exactly by standard algorithms that run in polynomial time with roughly $Θ(n)$ space, where $n$ is the input length, and our goal is to design deterministic approximation algorithms that run in polynomial time with significantly smaller space. Towards this, we design several algorithms that achieve $1+ε$ or $1-ε$ approximation for all three problems, where $ε>0$ can be any constant and even slightly sub constant. Our algorithms are flexible and can be adjusted to achieve the following two regimes of parameters: 1) space $n^δ$ for any constant $δ>0$ with running time essentially the same as or slightly more than the standard algorithms; and 2) space $\mathsf{polylog}(n)$ with (a larger) polynomial running time, which puts the approximation versions of the three problems in Steve's class (\textbf{SC}). Our algorithms significantly improve previous results in terms of space complexity, where all known results need to use space at least $Ω(\sqrt{n})$. Some of our algorithms can also be adapted to work in the asymmetric streaming model [SS13], and output the corresponding sequence. Furthermore, our results can be used to improve a recent result by Farhadi et. al. [FHRS20] about approximating ED in the asymmetric streaming model, reducing the running time from being exponential in [FHRS20] to a polynomial. Our algorithms are based on the idea of using recursion as in Savitch's theorem [Sav70], and a careful adaption of previous techniques to make the recursion work. Along the way we also give a new logspace reduction from longest common subsequence to longest increasing sequence, which may be of independent interest.

cs.DS↗

Predicting Citywide Crowd Flows in Irregular Regions Using Multi-View Graph Convolutional Networks

Being able to predict the crowd flows in each and every part of a city, especially in irregular regions, is strategically important for traffic control, risk assessment, and public safety. However, it is very challenging because of interactions and spatial correlations between different regions. In addition, it is affected by many factors: i) multiple temporal correlations among different time intervals: closeness, period, trend; ii) complex external influential factors: weather, events; iii) meta features: time of the day, day of the week, and so on. In this paper, we formulate crowd flow forecasting in irregular regions as a spatio-temporal graph (STG) prediction problem in which each node represents a region with time-varying flows. By extending graph convolution to handle the spatial information, we propose using spatial graph convolution to build a multi-view graph convolutional network (MVGCN) for the crowd flow forecasting problem, where different views can capture different factors as mentioned above. We evaluate MVGCN using four real-world datasets (taxicabs and bikes) and extensive experimental results show that our approach outperforms the adaptations of state-of-the-art methods. And we have developed a crowd flow forecasting system for irregular regions that can now be used internally.

cs.CV↗

ReAD: A Regional Anomaly Detection Framework Based on Dynamic Partition

The detection of the abnormal area from urban data is a significant research problem. However, to the best of our knowledge, previous methods designed on spatio-temporal anomalies are road-based or grid-based, which usually causes the data sparsity problem and affects the detection results. In this paper, we proposed a dynamic region partition method to address the above issues. Besides, we proposed an unsupervised REgional Anomaly Detection framework (ReAD) to detect abnormal regions with arbitrary shapes by jointly considering spatial and temporal properties. Specifically, the proposed framework first generate regions via a dynamic region partition method. It keeps that observations in the same region have adjacent locations and similar non-spatial attribute readings, and could alleviate data sparsity and heterogeneity compared with the grid-based approach. Then, an anomaly metric will be calculated for each region by a regional divergence calculation method. The abnormal regions could be finally detected by a weighted approach or a wavy approach according to the different scenario. Experiments on both the simulated dataset and real-world applications demonstrate the effectiveness and practicability of the proposed framework.

cs.SI↗

Revisiting Convolutional Neural Networks for Citywide Crowd Flow Analytics

Citywide crowd flow analytics is of great importance to smart city efforts. It aims to model the crowd flow (e.g., inflow and outflow) of each region in a city based on historical observations. Nowadays, Convolutional Neural Networks (CNNs) have been widely adopted in raster-based crowd flow analytics by virtue of their capability in capturing spatial dependencies. After revisiting CNN-based methods for different analytics tasks, we expose two common critical drawbacks in the existing uses: 1) inefficiency in learning global spatial dependencies, and 2) overlooking latent region functions. To tackle these challenges, in this paper we present a novel framework entitled DeepLGR that can be easily generalized to address various citywide crowd flow analytics problems. This framework consists of three parts: 1) a local feature extraction module to learn representations for each region; 2) a global context module to extract global contextual priors and upsample them to generate the global features; and 3) a region-specific predictor based on tensor decomposition to provide customized predictions for each region, which is very parameter-efficient compared to previous methods. Extensive experiments on two typical crowd flow analytics tasks demonstrate the effectiveness, stability, and generality of our framework.

cs.CV↗

Stone-Wales Defects Preserve Hyperuniformity in Amorphous Two-Dimensional Materials

Crystalline two-dimensional (2D) materials such as graphene possess unique physical properties absent in their bulk form, enabling many novel device applications. Yet, little is known about their amorphous counterparts, which can be obtained by introducing the Stone-Wales (SW) topological defects via proton radiation. Here we provide strong numerical evidence that SW defects preserve hyperuniformity in hexagonal 2D materials, a recently discovered new state of matter characterized by vanishing normalized infinite-wavelength density fluctuations, which implies that all amorphous states of these materials are hyperuniform. Specifically, the static structure factor S(k) of these materials possesses the scaling S(k) ~ k^α for small wave number k, where 1<=α(p)<=2 is monotonically decreasing as the SW defect concentration p increases, indicating a transition from type-I to type-II hyperuniformity at p ~= 0.12 induced by the saturation of the SW defects. This hyperuniformity transition marks a structural transition from perturbed lattice structures to truly amorphous structures, and underlies the onset of strong correlation among the SW defects as well as a transition between distinct electronic transport mechanisms associated with different hyperuniformity classes.

cond-mat.mtrl-sci↗