Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
93works
0followers
50topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

93 published item(s)

preprint2026arXiv

A System Architecture for Low Latency Multiprogramming Quantum Computing

As quantum systems scale, Multiprogramming Quantum Computing (MPQC) becomes essential to improve device utilization and throughput. However, current MPQC pipelines rely on expensive online compilation to co-optimize concurrently running programs, because quantum executables are device-dependent, non-portable across qubit regions, and highly susceptible to noise and crosstalk. This online step dominates runtime and impedes low-latency deployments for practical, real-world workloads in the future, such as repeatedly invoked Quantum Neural Network (QNN) services. We present FLAMENCO, a fidelity-aware multi-version compilation system that enables independent offline compilation and low-latency, high-fidelity multiprogramming at runtime. At the architecture level, FLAMENCO abstracts devices into compute units to drastically shrink the search space of region allocation. At compile time, it generates diverse executable versions for each program -- each bound to a distinct qubit region -- allowing dynamic region selection at runtime and overcoming non-portability. At runtime, FLAMENCO employs a streamlined orchestrator that leverages post-compilation fidelity metrics to avoid conflicts and mitigate crosstalk, achieving reliable co-execution without online co-optimization. Comprehensive evaluations against state-of-the-art MPQC baselines show that FLAMENCO removes online compilation overhead, achieves over 5$\times$ runtime speedup, improves execution fidelity, and maintains high utilization as concurrency increases.

preprint2026arXiv

From "Thinking" to "Justifying": Aligning High-Stakes Explainability with Professional Communication Standards

Explainable AI (XAI) in high-stakes domains should help stakeholders trust and verify system outputs. Yet Chain-of-Thought methods reason before concluding, and logical gaps or hallucinations can yield conclusions that do not reliably align with their rationale. Thus, we propose &#34;Result -> Justify&#34;, which constrains the output communication to present a conclusion before its structured justification. We introduce SEF (Structured Explainability Framework), operationalizing professional conventions (e.g., CREAC, BLUF) via six metrics for structure and grounding. Experiments across four tasks in three domains validate this approach: all six metrics correlate with correctness (r=0.20-0.42; p<0.001), and SEF achieves 83.9% accuracy (+5.3 over CoT). These results suggest structured justification can improve verifiability and may also improve reliability.

preprint2026arXiv

Hybrid Disclination Skin-topological Effects in Non-Hermitian Circuits

The bulk-disclination correspondence (BDC) is a fundamental concept in Hermitian systems that has been widely applied to predict disclination states. Recently, disclination states have also been observed and experimentally verified in non-Hermitian systems with C6 lattice symmetry, where gain and loss are introduced to induce non-Hermiticity. In this Letter, we propose a non-Hermitian two-dimensional (2D) Su-Schrieffer-Heeger (SSH) disclination model with skin-topological (ST) disclination states, and calculate its biorthogonal Zak phase. Together with the real-space disclination index, we predict the emergence of disclination states in a C4-symmetric non-Hermitian lattice and the corresponding fractional charge. We also generalize the symmetry indicator within the biorthogonal framework to predict the anomalous filling near the disclination core. Experimentally, the model is implemented on a nonreciprocal circuit platform, where we analyze the impedance matrix characterized by complex eigenfrequencies and directly observe the ST disclination states. Our work further extends the bulk-disclination correspondence to the non-Hermitian realm.

preprint2026arXiv

Why Do Aligned LLMs Remain Jailbreakable: Refusal-Escape Directions, Operator-Level Sources, and Safety-Utility Trade-off

Aligned large language models (LLMs) remain vulnerable to jailbreak attacks. Recent mechanistic studies have identified latent features and representation shifts associated with jailbreak success, but they leave a more fundamental question open: why do aligned LLMs remain jailbreakable, and what structural vulnerabilities in the model make this possible? We study this question through a continuous input-transformation view. Our theoretical finding is that aligned models can still exhibit Refusal-Escape Directions (RED): local perturbation directions around a harmful input that shift the model's behavior from refusal to answering while preserving the model's harmful-semantics interpretation. From this perspective, a jailbreak is not only a successful discrete prompt construction, but can also be understood as a refusal-to-answer behavior transition induced by continuously perturbing a harmful input along RED. We then prove that RED can be exactly decomposed into contributions from operator-level sources across the model's operator structure, and identify normalization, residual-wiring, and terminal sources as analytically constrained operator-level sources. To eliminate RED, the shared expressive modules -- self-attention and MLP -- must eliminate the contributions from these analytically constrained sources while preserving the mechanisms that support benign responses. These competing requirements give rise to a conditional safety-utility trade-off. Experiments across multiple models and attack methods empirically analyze RED from two complementary perspectives and show that added token dimensions can expose RED, while successful jailbreaks exhibit refusal-to-answer shifts largely aligned with terminal-source contributions.

preprint2024arXiv

Correlated sensing with a solid-state quantum multi-sensor system for atomic-scale structural analysis

Developing superior quantum sensing strategies ranging from ultra-high precision measurement to complex structural analysis is at the heart of quantum technologies. While strategies using quantum resources, such as entanglement among sensors, to enhance the sensing precision have been abundantly demonstrated, the signal correlation among quantum sensors is rarely exploited. Here we develop a novel sensing paradigm exploiting the signal correlation among multiple quantum sensors to resolve overlapping signals from multiple targets that individual sensors can&#39;t resolve and complex structural construction struggles with. With three nitrogen-vacancy centers as a quantum electrometer system, we demonstrate this multi-sensor paradigm by resolving individual defects&#39; fluctuating electric fields from ensemble signals. We image the three-dimensional distribution of 16 dark electronic point-defects in diamond with accuracy approaching 1.7 nm via a GPS-like localization method. Furthermore, we obtain the real-time charge dynamics of individual point defects and visualize how the dynamics induce the well-known optical spectral diffusion. The multi-sensor paradigm extends the quantum sensing toolbox and offers new possibilities for structural analysis.

preprint2024arXiv

Investigation for $D^+ \to π^+ ν\barν$ decay process within QCDSR approach

In the paper, we investigate the charmed meson rare decay process $D^+ \to π^+ν\barν$ by using QCD sum rules approach. Firstly, the pion twist-2 and twist-3 distribution amplitude $ξ$-moments $\langleξ_{2;π}^n\rangle|_μ$ up to 10th-order and $\langle ξ_{3;π}^{(p,σ),n}\rangle|_μ$ up to fourth-order are calculated by using QCD sum rule under background field theory. After constructing the light-cone harmonic oscillator model for pion twist-2, 3 DAs, we get their behaviors by matching the calculated $ξ$-moments. Then, the $D\to π$ transition form factors are calculated by using QCD light-cone sum rules approach. The vector form factor at large recoil region is $f_+^{D\toπ}(0) = 0.627^{+0.120} _{-0.080}$. By taking the rapidly $z(q^2,t)$ converging simplified series expansion, we present the TFFs and the corresponding angular coefficients in the whole squared momentum transfer physical region. Furthermore, we display the semileptonic decay process $\bar D^0 \to π^+ e\bar ν_e$ differential decay widths and branching fraction with ${\cal B}(\bar D^0\toπ^+e\barν_e) = 0.308^{+0.155}_{-0.066} \times 10^{2}$. The $\bar D^0\toπ^+e\barν_e$ differential/total predictions for forward-backward asymmetry, $q^2$-differential flat terms and lepton polarization asymmetry are also given. After considering the non-standard neutrino interactions, the predictions for the $D^+ \to π^+ ν\barν$ branching fraction is ${\cal B}(D^+ \to π^+ {ν}{\barν}) = 1.85^{+0.93}_{-0.46}\times10^{-8}$.

preprint2024arXiv

Reflected Schrödinger Bridge for Constrained Generative Modeling

Diffusion models have become the go-to method for large-scale generative models in real-world applications. These applications often involve data distributions confined within bounded domains, typically requiring ad-hoc thresholding techniques for boundary enforcement. Reflected diffusion models (Lou23) aim to enhance generalizability by generating the data distribution through a backward process governed by reflected Brownian motion. However, reflected diffusion models may not easily adapt to diverse domains without the derivation of proper diffeomorphic mappings and do not guarantee optimal transport properties. To overcome these limitations, we introduce the Reflected Schrodinger Bridge algorithm: an entropy-regularized optimal transport approach tailored for generating data within diverse bounded domains. We derive elegant reflected forward-backward stochastic differential equations with Neumann and Robin boundary conditions, extend divergence-based likelihood training to bounded domains, and explore natural connections to entropic optimal transport for the study of approximate linear convergence - a valuable insight for practical training. Our algorithm yields robust generative modeling in diverse domains, and its scalability is demonstrated in real-world constrained generative modeling through standard image benchmarks.

preprint2023arXiv

Rotation-Invariant Completion Network

Real-world point clouds usually suffer from incompleteness and display different poses. While current point cloud completion methods excel in reproducing complete point clouds with consistent poses as seen in the training set, their performance tends to be unsatisfactory when handling point clouds with diverse poses. We propose a network named Rotation-Invariant Completion Network (RICNet), which consists of two parts: a Dual Pipeline Completion Network (DPCNet) and an enhancing module. Firstly, DPCNet generates a coarse complete point cloud. The feature extraction module of DPCNet can extract consistent features, no matter if the input point cloud has undergone rotation or translation. Subsequently, the enhancing module refines the fine-grained details of the final generated point cloud. RICNet achieves better rotation invariance in feature extraction and incorporates structural relationships in man-made objects. To assess the performance of RICNet and existing methods on point clouds with various poses, we applied random transformations to the point clouds in the MVP dataset and conducted experiments on them. Our experiments demonstrate that RICNet exhibits superior completion performance compared to existing methods.

preprint2022arXiv

A Compacted Structure for Cross-domain learning on Monocular Depth and Flow Estimation

Accurate motion and depth recovery is important for many robot vision tasks including autonomous driving. Most previous studies have achieved cooperative multi-task interaction via either pre-defined loss functions or cross-domain prediction. This paper presents a multi-task scheme that achieves mutual assistance by means of our Flow to Depth (F2D), Depth to Flow (D2F), and Exponential Moving Average (EMA). F2D and D2F mechanisms enable multi-scale information integration between optical flow and depth domain based on differentiable shallow nets. A dual-head mechanism is used to predict optical flow for rigid and non-rigid motion based on a divide-and-conquer manner, which significantly improves the optical flow estimation performance. Furthermore, to make the prediction more robust and stable, EMA is used for our multi-task training. Experimental results on KITTI datasets show that our multi-task scheme outperforms other multi-task schemes and provide marked improvements on the prediction results.

preprint2022arXiv

A Magnetic Flux Rope Configuration Derived by Optimization of Two-Spacecraft In-situ Measurements

Increasingly one interplanetary coronal mass ejection (ICME) structure can propagate across more than one spacecraft in the solar wind. This usually happens when two or more spacecraft are nearly radially aligned with a relatively small longitudinal separation angle from one another. This provides multi-point measurements of the same structure and enables better characterization and validation of modeling results of the structures embedded in these ICMEs. We report such an event during October 13-14, 2019 when the Solar TErrestrial RElations Observatory Ahead (STA) spacecraft and the Parker Solar Probe (PSP) crossed one ICME structure at two different locations with nominal separations in both heliocentric distances and the longitudinal angles. We first perform an optimal fitting to the STA in-situ measurements, based on an analytic quasi-three dimensional (3D) model, yielding a minimum reduced $χ^2=0.468$. Then we further apply the optimization approach by combining the magnetic field measurements from both spacecraft along their separate paths across the ICME structure. We find that the output based on the optimization (with the minimum reduced $χ^2=3.15$) of the combined two-spacecraft dataset yields a more consistent result, given the much improved agreement of the model output with PSP data. The result demonstrates a magnetic flux rope configuration with clear 3D spatial variations.

preprint2022arXiv

A multiferroic two-dimensional electron gas

Multiferroics are compounds in which at least two ferroic orders coexist - typically (anti)ferromagnetism and ferroelectricity. While magnetic order can arise in both insulating and conducting compounds, ferroelectricity is in principle not allowed in metals although a few two-dimensional (semi)metals were reported to behave as ferroelectrics. Yet, the combination with magnetic order to realize multiferroic metals remains elusive. Here, by combining x-ray spectroscopy and magnetotransport, we show the coexistence of ferroelectricity and magnetism in an oxide-based two-dimensional electron gas (2DEG). The data evidence a non-volatile switching of the polar displacements and of the anomalous Hall effect by the polarization direction, demonstrating a magnetoelectric coupling. Our findings provide new opportunities in quantum matter stemming from the interplay between ferroelectricity, ferromagnetism and Rashba spin-orbit coupling in a 2DEG.

preprint2022arXiv

A Secure Dynamic Edge Resource Federation Architecture for Cross-Domain IoT Systems

The fast integration of 5G communication, Artificial Intelligence (AI), and Internet-of-Things (IoT) technologies is envisioned to enable Next Generation Networks (NGNs) for diverse smart services and user-defined applications for Smart Cities. However, it is still challenging to build a scalable and efficient infrastructure that satisfies the various performance, security, and management demands by heterogeneous IoT applications across multiple administrative domains. This paper presents a dynamic edge resource federation architecture, which integrates the concept of network slicing (NS) and blockchain to improve scalability, dynamicity, and security for multi-domain IoT applications. A NS-enabled dynamic edge resource federation framework adopts intelligent mechanisms to support efficient multi-domain service coordination that satisfies diverse Quality of Service (QoS) and security requirements. We propose a Hierarchical Integrated Federated Ledger (HIFL), which aims to guarantee decentralized security and privacy-preserving properties in multi-domain resource orchestration and service re-adjustment. As a secure-by-design solution, HIFL is promising to support efficient, trust and secured end-to-end IoT services. A preliminary proof-of-concept prototype has been implemented for comparing intra- and inter-domain performance expectations.

preprint2022arXiv

A Study of Shared-Control with Force Feedback for Obstacle Avoidance in Whole-body Telelocomotion of a Wheeled Humanoid

Teleoperation has emerged as an alternative solution to fully-autonomous systems for achieving human-level capabilities on humanoids. Specifically, teleoperation with whole-body control is a promising hands-free strategy to command humanoids but demands more physical and mental effort. To mitigate this limitation, researchers have proposed shared-control methods incorporating robot decision-making to aid humans on low-level tasks, further reducing operation effort. However, shared-control methods for wheeled humanoid telelocomotion on a whole-body level has yet to be explored. In this work, we study how whole-body feedback affects the performance of different shared-control methods for obstacle avoidance in diverse environments. A Time-Derivative Sigmoid Function (TDSF) is proposed to generate more intuitive force feedback from obstacles. Comprehensive human experiments were conducted, and the results concluded that force feedback enhances the whole-body telelocomotion performance in unfamiliar environments but could reduce performance in familiar environments. Conveying the robot&#39;s intention through haptics showed further improvements since the operator can utilize the force feedback for short-distance planning and visual feedback for long-distance planning.

preprint2022arXiv

Adversarial attacks and defenses in Speaker Recognition Systems: A survey

Speaker recognition has become very popular in many application scenarios, such as smart homes and smart assistants, due to ease of use for remote control and economic-friendly features. The rapid development of SRSs is inseparable from the advancement of machine learning, especially neural networks. However, previous work has shown that machine learning models are vulnerable to adversarial attacks in the image domain, which inspired researchers to explore adversarial attacks and defenses in Speaker Recognition Systems (SRS). Unfortunately, existing literature lacks a thorough review of this topic. In this paper, we fill this gap by performing a comprehensive survey on adversarial attacks and defenses in SRSs. We first introduce the basics of SRSs and concepts related to adversarial attacks. Then, we propose two sets of criteria to evaluate the performance of attack methods and defense methods in SRSs, respectively. After that, we provide taxonomies of existing attack methods and defense methods, and further review them by employing our proposed criteria. Finally, based on our review, we find some open issues and further specify a number of future directions to motivate the research of SRSs security.

preprint2022arXiv

Afterpulse measurement of JUNO 20-inch PMTs

In this article we present the large photo-multiplier tube (PMT) afterpulse measurement results of Jiangmen Underground Neutrino Observatory (JUNO) experiment. Totally 11 dynode-PMTs (R12860) from Hamamatsu company and 150 micro-channel plate PMTs (MCP-PMTs, GDB-6201) from NNVT company were tested, an afterpulse model is built according to the afterpulse time distribution and probability of occurrence for these two types of PMTs. The average ratio between the total afterpulse charge with the delay between 0.5 $μ$ s and 20 $μ$ s to the primary pulse charge is 5.6%(13.2%) for the tested MCP-PMTs (dynode-PMTs). JUNO experiment will deploy 20,012 20-inch PMTs, and this study will benefit the detector simulation, event reconstruction and data analysis of JUNO experiment.

preprint2022arXiv

Asymptotically Unbiased Estimation for Delayed Feedback Modeling via Label Correction

Alleviating the delayed feedback problem is of crucial importance for the conversion rate(CVR) prediction in online advertising. Previous delayed feedback modeling methods using an observation window to balance the trade-off between waiting for accurate labels and consuming fresh feedback. Moreover, to estimate CVR upon the freshly observed but biased distribution with fake negatives, the importance sampling is widely used to reduce the distribution bias. While effective, we argue that previous approaches falsely treat fake negative samples as real negative during the importance weighting and have not fully utilized the observed positive samples, leading to suboptimal performance. In this work, we propose a new method, DElayed Feedback modeling with UnbiaSed Estimation, (DEFUSE), which aim to respectively correct the importance weights of the immediate positive, the fake negative, the real negative, and the delay positive samples at finer granularity. Specifically, we propose a two-step optimization approach that first infers the probability of fake negatives among observed negatives before applying importance sampling. To fully exploit the ground-truth immediate positives from the observed distribution, we further develop a bi-distribution modeling framework to jointly model the unbiased immediate positives and the biased delay conversions. Experimental results on both public and our industrial datasets validate the superiority of DEFUSE. Codes are available at https://github.com/ychen216/DEFUSE.git.

preprint2022arXiv

Compact Graph Structure Learning via Mutual Information Compression

Graph Structure Learning (GSL) recently has attracted considerable attentions in its capacity of optimizing graph structure as well as learning suitable parameters of Graph Neural Networks (GNNs) simultaneously. Current GSL methods mainly learn an optimal graph structure (final view) from single or multiple information sources (basic views), however the theoretical guidance on what is the optimal graph structure is still unexplored. In essence, an optimal graph structure should only contain the information about tasks while compress redundant noise as much as possible, which is defined as &#34;minimal sufficient structure&#34;, so as to maintain the accurancy and robustness. How to obtain such structure in a principled way? In this paper, we theoretically prove that if we optimize basic views and final view based on mutual information, and keep their performance on labels simultaneously, the final view will be a minimal sufficient structure. With this guidance, we propose a Compact GSL architecture by MI compression, named CoGSL. Specifically, two basic views are extracted from original graph as two inputs of the model, which are refinedly reestimated by a view estimator. Then, we propose an adaptive technique to fuse estimated views into the final view. Furthermore, we maintain the performance of estimated views and the final view and reduce the mutual information of every two views. To comprehensively evaluate the performance of CoGSL, we conduct extensive experiments on several datasets under clean and attacked conditions, which demonstrate the effectiveness and robustness of CoGSL.

preprint2022arXiv

DeFakePro: Decentralized DeepFake Attacks Detection using ENF Authentication

Advancements in generative models, like Deepfake allows users to imitate a targeted person and manipulate online interactions. It has been recognized that disinformation may cause disturbance in society and ruin the foundation of trust. This article presents DeFakePro, a decentralized consensus mechanism-based Deepfake detection technique in online video conferencing tools. Leveraging Electrical Network Frequency (ENF), an environmental fingerprint embedded in digital media recording, affords a consensus mechanism design called Proof-of-ENF (PoENF) algorithm. The similarity in ENF signal fluctuations is utilized in the PoENF algorithm to authenticate the media broadcasted in conferencing tools. By utilizing the video conferencing setup with malicious participants to broadcast deep fake video recordings to other participants, the DeFakePro system verifies the authenticity of the incoming media in both audio and video channels.

preprint2022arXiv

Effective Multi-User Delay-Constrained Scheduling with Deep Recurrent Reinforcement Learning

Multi-user delay constrained scheduling is important in many real-world applications including wireless communication, live streaming, and cloud computing. Yet, it poses a critical challenge since the scheduler needs to make real-time decisions to guarantee the delay and resource constraints simultaneously without prior information of system dynamics, which can be time-varying and hard to estimate. Moreover, many practical scenarios suffer from partial observability issues, e.g., due to sensing noise or hidden correlation. To tackle these challenges, we propose a deep reinforcement learning (DRL) algorithm, named Recurrent Softmax Delayed Deep Double Deterministic Policy Gradient ($\mathtt{RSD4}$), which is a data-driven method based on a Partially Observed Markov Decision Process (POMDP) formulation. $\mathtt{RSD4}$ guarantees resource and delay constraints by Lagrangian dual and delay-sensitive queues, respectively. It also efficiently tackles partial observability with a memory mechanism enabled by the recurrent neural network (RNN) and introduces user-level decomposition and node-level merging to ensure scalability. Extensive experiments on simulated/real-world datasets demonstrate that $\mathtt{RSD4}$ is robust to system dynamics and partially observable environments, and achieves superior performances over existing DRL and non-DRL-based methods.

preprint2022arXiv

Electrically tunable magnetism and unique intralayer charge transfer in Janus monolayer MnSSe for spintronics applications

Controlling magnetism and electronic properties of two-dimensional (2D) materials by purely electrical means is crucial and highly sought for high-efficiency spintronics devices since electric field can be easily applied locally compared with magnetic field. The recently discover 2D Janus crystals has provide a new platform for nanoscale electronics and spintronics due to their broken inversion symmetry nature. The intrinsic ferromagnetic Jauns monolayer, and hence the tunable physical properties, is therefore of great interest. Here, through comprehensive density functional theory calculations and Monte Carlo simulations, we unveil that single-layer MnSSe is an intrinsic ferromagnetic half-metal with a direct band gap of 1.14 eV in spin-down channel and a Curie temperature of about 72 K. The exchange coupling can be significantly enhanced or quenched by hole and electron doping, respectively. In particular, a small amount of hole doping MnSSe can tune its magnetization easy axis in between out-of-plane and in-plane directions, which is conducive to designing 2D spin field-effect transistor for spin-dependent transport. We also find a reversible longitudinal interlayer charge transfer between S and Se layers for the first time that is highly sensitive to the applied external electric field. Interestingly, the directions of charge flow and the applied field are the same. The behavior originates from the coexistence and/or the competition of external and built-in fields. These findings, together with the excellent stability and large in-plane stiffness, can greatly facilitate the development of nanoscale electronics and spintronics devices based on 2D MnSSe crystal.

preprint2022arXiv

FAEP: Fast Autonomous Exploration Planner for UAV Equipped with Limited FOV Sensor

Autonomous exploration is one of the important parts to achieve the autonomous operation of Unmanned Aerial Vehicles (UAVs). To improve the efficiency of the exploration process, a fast and autonomous exploration planner (FAEP) is proposed in this paper. We firstly design a novel frontiers exploration sequence generation method to obtain a more reasonable exploration path, which considers not only the flight-level but frontier-level factors into TSP. According to the exploration sequence and the distribution of frontiers, a two-stage heading planning strategy is proposed to cover more frontiers by heading change during an exploration journey. To improve the stability of path searching, a guided kinodynamic path searching based on a guiding path is devised. In addition, a dynamic start point selection method for replanning is also adopted to increase the fluency of flight. We present sufficient benchmark and real-world experiments. Experimental results show the superiority of the proposed exploration planner compared with typical and state-of-the-art methods.

preprint2022arXiv

Fast fluorescence lifetime imaging analysis via extreme learning machine

We present a fast and accurate analytical method for fluorescence lifetime imaging microscopy (FLIM) using the extreme learning machine (ELM). We used extensive metrics to evaluate ELM and existing algorithms. First, we compared these algorithms using synthetic datasets. Results indicate that ELM can obtain higher fidelity, even in low-photon conditions. Afterwards, we used ELM to retrieve lifetime components from human prostate cancer cells loaded with gold nanosensors, showing that ELM also outperforms the iterative fitting and non-fitting algorithms. By comparing ELM with a computational efficient neural network, ELM achieves comparable accuracy with less training and inference time. As there is no back-propagation process for ELM during the training phase, the training speed is much higher than existing neural network approaches. The proposed strategy is promising for edge computing with online training.

preprint2022arXiv

Incompatibility measures in multi-parameter quantum estimation under hierarchical quantum measurements

The incompatibility of the measurements constraints the achievable precisions in multi-parameter quantum estimation. Understanding the tradeoff induced by such incompatibility is a central topic in quantum metrology. Here we provide an approach to study the incompatibility under general $p$-local measurements, which are the measurements that can be performed collectively on at most $p$ copies of quantum states. We demonstrate the power of the approach by presenting a hierarchy of analytical bounds on the tradeoff among the precision limits of different parameters. These bounds lead to a necessary condition for the saturation of the quantum Cramér-Rao bound under $p$-local measurements, which recovers the partial commutative condition at p=1 and the weak commutative condition at $p=\infty$. As a further demonstration of the power of the framework, we present another set of tradeoff relations with the right logarithmic operators(RLD).

preprint2022arXiv

Influence of Binomial Crossover on Approximation Error of Evolutionary Algorithms

Although differential evolution (DE) algorithms perform well on a large variety of complicated optimization problems, only a few theoretical studies are focused on the working principle of DE algorithms. To make the first attempt to reveal the function of binomial crossover, this paper aims to answer whether it can reduce the approximation error of evolutionary algorithms. By investigating the expected approximation error and the probability of not finding the optimum, we conduct a case study comparing two evolutionary algorithms with and without binomial crossover on two classical benchmark problems: OneMax and Deceptive. It is proven that using binomial crossover leads to the dominance of transition matrices. As a result, the algorithm with binomial crossover asymptotically outperforms that without crossover on both OneMax and Deceptive, and outperforms on OneMax, however, not on Deceptive. Furthermore, an adaptive parameter strategy is proposed which can strengthen the superiority of binomial crossover on Deceptive.

preprint2022arXiv

Information geometry under hierarchical quantum measurement

In most quantum technologies, measurements need to be performed on the parametrized quantum states to transform the quantum information to classical information. The measurements, however, inevitably distort the information. The characterization of the discrepancy is an important subject in quantum information science, which plays a key role in understanding the difference between the structures of the quantum and classical information. Here we analyze the discrepancy in terms of the Fisher information metric and present a framework that can provide analytical bounds on the difference under hierarchical quantum measurements. Specifically, we present a set of analytical bounds on the difference between the quantum and classical Fisher information metric under hierarchical p-local quantum measurements, which are measurements that can be performed collectively on at most p copies of quantum states. The results can be directly transformed to the precision limit in multi-parameter quantum metrology, which leads to characterizations of the tradeoff among the precision of different parameters. The framework also provides a coherent picture for various existing results by including them as special cases.

preprint2022arXiv

Leveraging Structural Information to Improve Point Line Visual-Inertial Odometry

Leveraging line features can help to improve the localization accuracy of point-based monocular Visual-Inertial Odometry (VIO) system, as lines provide additional constraints. Moreover, in an artificial environment, some straight lines are parallel to each other. In this paper, we designed a VIO system based on points and straight lines, which divides straight lines into structural straight lines (that is, straight lines parallel to each other) and non-structural straight lines. In addition, unlike the orthogonal representation using four parameters to represent the 3D straight line, we only used two parameters to minimize the representation of the structural straight line and the non-structural straight line. Furthermore, we designed a straight line matching strategy based on sampling points to improve the efficiency and success rate of straight line matching. The effectiveness of our method is verified on both public datasets of EuRoc and TUM VI benchmark and compared with other state-of-the-art algorithms.

preprint2022arXiv

Mass Testing and Characterization of 20-inch PMTs for JUNO

Main goal of the JUNO experiment is to determine the neutrino mass ordering using a 20kt liquid-scintillator detector. Its key feature is an excellent energy resolution of at least 3 % at 1 MeV, for which its instruments need to meet a certain quality and thus have to be fully characterized. More than 20,000 20-inch PMTs have been received and assessed by JUNO after a detailed testing program which began in 2017 and elapsed for about four years. Based on this mass characterization and a set of specific requirements, a good quality of all accepted PMTs could be ascertained. This paper presents the performed testing procedure with the designed testing systems as well as the statistical characteristics of all 20-inch PMTs intended to be used in the JUNO experiment, covering more than fifteen performance parameters including the photocathode uniformity. This constitutes the largest sample of 20-inch PMTs ever produced and studied in detail to date, i.e. 15,000 of the newly developed 20-inch MCP-PMTs from Northern Night Vision Technology Co. (NNVT) and 5,000 of dynode PMTs from Hamamatsu Photonics K. K.(HPK).

preprint2022arXiv

Nuclear phase retrieval spectroscopy using resonant x-ray scattering

Light-matter interaction is exploited in spectroscopic techniques to access information about molecular, atomic or nuclear constituents of the sample of interest. While scattered light carries both amplitude and phase information of the electromagnetic field, most of the time the latter is lost in intensity measurements. However, often the phase information is paramount to reconstruct the desired information of the target, as it is well known from coherent x-ray imaging. Here we introduce a new phase retrieval algorithm which allows us to reconstruct the field phase information from two-dimensional time- and energy-resolved spectra. We apply this method to the particular case of x-ray scattering off Mössbauer nuclei at a synchrotron radiation source. Knowledge of the phase allows also for an excellent reconstruction of the energy spectra from experimental data, which could not be achieved with this resolution otherwise. Our approach provides an efficient novel data analysis tool which will benefit x-ray quantum optics and Mössbauer spectroscopy with synchrotron radiation alike.

preprint2022arXiv

Optimizing Quantum Annealing Schedules with Monte Carlo Tree Search enhanced with neural networks

Quantum annealing is a practical approach to approximately implement the adiabatic quantum computational model under a real-world setting. The goal of an adiabatic algorithm is to prepare the ground state of a problem-encoded Hamiltonian at the end of an annealing path. This is typically achieved by driving the dynamical evolution of a quantum system slowly to enforce adiabaticity. Properly optimized annealing schedules often significantly accelerate the computational process. Inspired by the recent success of deep reinforcement learning such as DeepMind&#39;s AlphaZero, we propose a Monte Carlo Tree Search (MCTS) algorithm and its enhanced version boosted with neural networks, which we name QuantumZero (QZero), to automate the design of annealing schedules in a hybrid quantum-classical framework. Both the MCTS and QZero algorithms perform remarkably well in discovering effective annealing schedules even when the annealing time is short for the 3-SAT examples we consider in this study. Furthermore, the flexibility of neural networks allows us to apply transfer-learning techniques to boost QZero&#39;s performance. We demonstrate in benchmark studies, that MCTS and QZero perform more efficiently than other reinforcement learning algorithms in designing annealing schedules.

preprint2022arXiv

Port Selection for Fluid Antenna Systems

Fluid antenna system promises to obtain enormous diversity in the small space of a mobile device by switching the position of the radiating element to the most desirable position from a large number of prescribed locations of the given space. Previous researches have revealed the promising performance of fluid antenna systems if the position with the maximum received signal-to-noise ratio (SNR) is chosen. However, selecting the best position, referred to as port selection, requires a huge number of SNR observations from the ports and may prove to be infeasible. This letter tackles this problem by devising a number of fast port selection algorithms utilizing a combination of machine learning methods and analytical approximation when the system observes only a few ports. Simulation results illustrate that with only 10% of the ports observed, more than an order of magnitude reduction in the outage probability can be achieved. Even in the extreme cases where only one port is observed, considerable performance improvements are possible using the proposed algorithms.

preprint2022arXiv

Readout of a quantum processor with high dynamic range Josephson parametric amplifiers

We demonstrate a high dynamic range Josephson parametric amplifier (JPA) in which the active nonlinear element is implemented using an array of rf-SQUIDs. The device is matched to the 50 $Ω$ environment with a Klopfenstein-taper impedance transformer and achieves a bandwidth of 250-300 MHz, with input saturation powers up to -95 dBm at 20 dB gain. A 54-qubit Sycamore processor was used to benchmark these devices, providing a calibration for readout power, an estimate of amplifier added noise, and a platform for comparison against standard impedance matched parametric amplifiers with a single dc-SQUID. We find that the high power rf-SQUID array design has no adverse effect on system noise, readout fidelity, or qubit dephasing, and we estimate an upper bound on amplifier added noise at 1.6 times the quantum limit. Lastly, amplifiers with this design show no degradation in readout fidelity due to gain compression, which can occur in multi-tone multiplexed readout with traditional JPAs.

preprint2022arXiv

Real-Time Elderly Monitoring for Senior Safety by Lightweight Human Action Recognition

With an increasing number of elders living alone, care-giving from a distance becomes a compelling need, particularly for safety. Real-time monitoring and action recognition are essential to raise an alert timely when abnormal behaviors or unusual activities occur. While wearable sensors are widely recognized as a promising solution, highly depending on user&#39;s ability and willingness makes them inefficient. In contrast, video streams collected through non-contact optical cameras provide richer information and release the burden on elders. In this paper, leveraging the Independently-Recurrent neural Network (IndRNN) we propose a novel Real-time Elderly Monitoring for senior Safety (REMS) based on lightweight human action recognition (HAR) technology. Using captured skeleton images, the REMS scheme is able to recognize abnormal behaviors or actions and preserve the user&#39;s privacy. To achieve high accuracy, the HAR module is trained and fine-tuned using multiple databases. An extensive experimental study verified that REMS system performs action recognition accurately and timely. REMS meets the design goals as a privacy-preserving elderly safety monitoring system and possesses the potential to be adopted in various smart monitoring systems.

preprint2022arXiv

Semi-Discriminative Representation Loss for Online Continual Learning

The use of episodic memory in continual learning has demonstrated effectiveness for alleviating catastrophic forgetting. In recent studies, gradient-based approaches have been developed to make more efficient use of compact episodic memory. Such approaches refine the gradients resulting from new samples by those from memorized samples, aiming to reduce the diversity of gradients from different tasks. In this paper, we clarify the relation between diversity of gradients and discriminativeness of representations, showing shared as well as conflicting interests between Deep Metric Learning and continual learning, thus demonstrating pros and cons of learning discriminative representations in continual learning. Based on these findings, we propose a simple method -- Semi-Discriminative Representation Loss (SDRL) -- for continual learning. In comparison with state-of-the-art methods, SDRL shows better performance with low computational cost on multiple benchmark tasks in the setting of online continual learning.

preprint2022arXiv

Spacecraft depth completion based on the gray image and the sparse depth map

Perceiving the three-dimensional (3D) structure of the spacecraft is a prerequisite for successfully executing many on-orbit space missions, and it can provide critical input for many downstream vision algorithms. In this paper, we propose to sense the 3D structure of spacecraft using light detection and ranging sensor (LIDAR) and a monocular camera. To this end, Spacecraft Depth Completion Network (SDCNet) is proposed to recover the dense depth map based on gray image and sparse depth map. Specifically, SDCNet decomposes the object-level spacecraft depth completion task into foreground segmentation subtask and foreground depth completion subtask, which segments the spacecraft region first and then performs depth completion on the segmented foreground area. In this way, the background interference to foreground spacecraft depth completion is effectively avoided. Moreover, an attention-based feature fusion module is also proposed to aggregate the complementary information between different inputs, which deduces the correlation between different features along the channel and the spatial dimension sequentially. Besides, four metrics are also proposed to evaluate object-level depth completion performance, which can more intuitively reflect the quality of spacecraft depth completion results. Finally, a large-scale satellite depth completion dataset is constructed for training and testing spacecraft depth completion algorithms. Empirical experiments on the dataset demonstrate the effectiveness of the proposed SDCNet, which achieves 0.25m mean absolute error of interest and 0.759m mean absolute truncation error, surpassing state-of-the-art methods by a large margin. The spacecraft pose estimation experiment is also conducted based on the depth completion results, and the experimental results indicate that the predicted dense depth map could meet the needs of downstream vision tasks.

preprint2021arXiv

An Environmentally-Adaptive Hawkes Process with An Application to COVID-19

We proposed a new generalized model based on the classical Hawkes process with environmental multipliers, which is called an environmentally-adaptive Hawkes (EAH) model. Compared to the classical self-exciting Hawkes process, the EAH model exhibits more flexibility in a macro environmentally temporal sense, and can model more complex processes by using dynamic branching matrix. We demonstrate the well-definedness of this EAH model. A more specified version of this new model is applied to model COVID-19 pandemic data through an efficient EM-like algorithm. Consequently, the proposed model consistently outperforms the classical Hawkes process.

preprint2021arXiv

An Optimized H.266/VVC Software Decoder On Mobile Platform

As the successor of H.265/HEVC, the new versatile video coding standard (H.266/VVC) can provide up to 50% bitrate saving with the same subjective quality, at the cost of increased decoding complexity. To accelerate the application of the new coding standard, a real-time H.266/VVC software decoder that can support various platforms is implemented, where SIMD technologies, parallelism optimization, and the acceleration strategies based on the characteristics of each coding tool are applied. As the mobile devices have become an essential carrier for video services nowadays, the mentioned optimization efforts are not only implemented for the x86 platform, but more importantly utilized to highly optimize the decoding performance on the ARM platform in this work. The experimental results show that when running on the Apple A14 SoC (iPhone 12pro), the average single-thread decoding speed of the present implementation can achieve 53fps (RA and LB) for full HD (1080p) bitstreams generated by VTM-11.0 reference software using 8bit Common Test Conditions (CTC). When multi-threading is enabled, an average of 32 fps (RA) can be achieved when decoding the 4K bitstreams.

preprint2021arXiv

Continual Density Ratio Estimation in an Online Setting

In online applications with streaming data, awareness of how far the training or test set has shifted away from the original dataset can be crucial to the performance of the model. However, we may not have access to historical samples in the data stream. To cope with such situations, we propose a novel method, Continual Density Ratio Estimation (CDRE), for estimating density ratios between the initial and current distributions ($p/q_t$) of a data stream in an iterative fashion without the need of storing past samples, where $q_t$ is shifting away from $p$ over time $t$. We demonstrate that CDRE can be more accurate than standard DRE in terms of estimating divergences between distributions, despite not requiring samples from the original distribution. CDRE can be applied in scenarios of online learning, such as importance weighted covariate shift, tracing dataset changes for better decision making. In addition, (CDRE) enables the evaluation of generative models under the setting of continual learning. To the best of our knowledge, there is no existing method that can evaluate generative models in continual learning without storing samples from the original distribution.

preprint2021arXiv

Deep reinforcement learning for RAN optimization and control

Due to the high variability of the traffic in the radio access network (RAN), fixed network configurations are not flexible enough to achieve optimal performance. Our vendors provide several settings of the eNodeB to optimize the RAN performance, such as media access control scheduler, loading balance, etc. But the detailed mechanisms of the eNodeB configurations are usually very complicated and not disclosed, not to mention the large key performance indicators (KPIs) space needed to be considered. These make constructing a simulator, offline tuning, or rule-based solutions difficult. We aim to build an intelligent controller without strong assumption or domain knowledge about the RAN and can run 24/7 without supervision. To achieve this goal, we first build a closed-loop control testbed RAN in a lab environment with one eNodeB provided by one of the largest wireless vendors and four smartphones. Next, we build a double Q network agent trained with the live feedback of the key performance indicators from the RAN. Our work proved the effectiveness of applying deep reinforcement learning to improve network performance in a real RAN network environment.

preprint2021arXiv

Experimental Adiabatic Quantum Metrology with the Heisenberg scaling

The critical quantum metrology, which exploits the quantum phase transition for high precision measurement, has gained increasing attention recently. The critical quantum metrology with the continuous quantum phase transition, however, is experimentally very challenging since the continuous quantum phase transition only exists at the thermal dynamical limit. Here, we propose an adiabatic scheme on a perturbed Ising spin model with the first order quantum phase transition. By employing the Landau-Zener anticrossing, we can not only encode the unknown parameter in the ground state but also tune the energy gap to control the evolution time of the adiabatic passage. We experimentally implement the adiabatic scheme on the nuclear magnetic resonance and show that the achieved precision attains the Heisenberg scaling. The advantages of the scheme-easy implementation, robust against the decay, tunable energy gap-are critical for practical applications of quantum metrology.

preprint2021arXiv

Exponential suppression of bit or phase flip errors with repetitive error correction

Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the $10^{-15}$ regime, but state-of-the-art quantum platforms typically have physical error rates near $10^{-3}$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits so that errors can be detected and corrected. Logical errors are then exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold. QEC also requires that the errors are local and that performance is maintained over many rounds of error correction, two major outstanding experimental challenges. Here, we implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors, reducing logical error per round by more than $100\times$ when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analyzing error correlations with high precision, and characterize the locality of errors in a device performing QEC for the first time. Finally, we perform error detection using a small 2D surface code logical qubit on the same device, and show that the results from both 1D and 2D codes agree with numerical simulations using a simple depolarizing error model. These findings demonstrate that superconducting qubits are on a viable path towards fault tolerant quantum computing.

preprint2021arXiv

Generation and storage of spin squeezing via learning-assisted optimal control

The generation and storage of spin squeezing is an attracting topic in quantum metrology and the foundations of quantum mechanics. The major models to realize the spin squeezing are the one- and two-axis twisting models. Here, we consider a collective spin system coupled to a bosonic field, and show that proper constant-value controls in this model can simulate the dynamical behaviors of these two models. More interestingly, a better performance of squeezing can be obtained when the control is time-varying, which is generated via a reinforcement learning algorithm. However, this advantage becomes limited if the collective noise is involved. To deal with it, we propose a four-step strategy for the construction of a new type of combined controls, which include both constant-value and time-varying controls, but performed at different time intervals. Compared to the full time-varying controls, the combined controls not only give a comparable minimum value of the squeezing parameter over time, but also provides a better lifetime and larger full amount of squeezing. Moreover, the amplitude form of a combined control is simpler and more stable than the full time-varying control. Therefore, our scheme is very promising to be applied in practice to improve the generation and storage performance of squeezing.

preprint2021arXiv

Information Scrambling in Computationally Complex Quantum Circuits

Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantum scrambling, is the key to resolving various conundrums in physics. Here, by measuring the time-dependent evolution and fluctuation of out-of-time-order correlators, we experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We engineer quantum circuits that distinguish the two mechanisms associated with quantum scrambling, operator spreading and operator entanglement, and experimentally observe their respective signatures. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate. These results open the path to studying complex and practically relevant physical observables with near-term quantum processors.

preprint2021arXiv

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

preprint2021arXiv

Observation of Time-Crystalline Eigenstate Order on a Quantum Processor

Quantum many-body systems display rich phase structure in their low-temperature equilibrium states. However, much of nature is not in thermal equilibrium. Remarkably, it was recently predicted that out-of-equilibrium systems can exhibit novel dynamical phases that may otherwise be forbidden by equilibrium thermodynamics, a paradigmatic example being the discrete time crystal (DTC). Concretely, dynamical phases can be defined in periodically driven many-body localized systems via the concept of eigenstate order. In eigenstate-ordered phases, the entire many-body spectrum exhibits quantum correlations and long-range order, with characteristic signatures in late-time dynamics from all initial states. It is, however, challenging to experimentally distinguish such stable phases from transient phenomena, wherein few select states can mask typical behavior. Here we implement a continuous family of tunable CPHASE gates on an array of superconducting qubits to experimentally observe an eigenstate-ordered DTC. We demonstrate the characteristic spatiotemporal response of a DTC for generic initial states. Our work employs a time-reversal protocol that discriminates external decoherence from intrinsic thermalization, and leverages quantum typicality to circumvent the exponential cost of densely sampling the eigenspectrum. In addition, we locate the phase transition out of the DTC with an experimental finite-size analysis. These results establish a scalable approach to study non-equilibrium phases of matter on current quantum processors.

preprint2021arXiv

Personalized Food Recommendation as Constrained Question Answering over a Large-scale Food Knowledge Graph

Food recommendation has become an important means to help guide users to adopt healthy dietary habits. Previous works on food recommendation either i) fail to consider users&#39; explicit requirements, ii) ignore crucial health factors (e.g., allergies and nutrition needs), or iii) do not utilize the rich food knowledge for recommending healthy recipes. To address these limitations, we propose a novel problem formulation for food recommendation, modeling this task as constrained question answering over a large-scale food knowledge base/graph (KBQA). Besides the requirements from the user query, personalized requirements from the user&#39;s dietary preferences and health guidelines are handled in a unified way as additional constraints to the QA system. To validate this idea, we create a QA style dataset for personalized food recommendation based on a large-scale food knowledge graph and health guidelines. Furthermore, we propose a KBQA-based personalized food recommendation framework which is equipped with novel techniques for handling negations and numerical comparisons in the queries. Experimental results on the benchmark show that our approach significantly outperforms non-personalized counterparts (average 59.7% absolute improvement across various evaluation metrics), and is able to recommend more relevant and healthier recipes.

preprint2021arXiv

Photonic-enabled radio-frequency self-interference cancellation incorporated in an in-band full-duplex radio-over-fiber system

A photonic approach for radio-frequency (RF) self-interference cancellation (SIC) incorporated in an in-band full-duplex radio-over-fiber system is proposed. A dual-polarization binary phase-shift keying modulator is used for dual-polarization multiplexing at the central office (CO). A local oscillator signal and an intermediate-frequency signal carrying the downlink data are single-sideband modulated on the two polarization directions of the modulator, respectively. The optical signal is then transmitted to the remote unit, where the optical signals in the two polarization directions are split into two parts. One part is detected to generate the up-converted downlink RF signal, and the other part is re-modulated by the uplink RF signal and the self-interference, which is then transmitted back to the CO for the signal down-conversion and SIC via the optical domain signal adjustment and balanced detection. The functions of SIC, frequency up-conversion, down-conversion, and fiber transmission with dispersion immunity are all incorporated in the system. An experiment is performed. Cancellation depths of more than 39 dB for the single-tone signal and more than 20 dB for the 20-MBaud 16 quadrature amplitude modulation signal are achieved in the back-to-back case. The performance of the system does not have a significant decline when a section of 4.1-km optical fiber is incorporated.

preprint2021arXiv

Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits

Scalable quantum computing can become a reality with error correction, provided coherent qubits can be constructed in large arrays. The key premise is that physical errors can remain both small and sufficiently uncorrelated as devices scale, so that logical error rates can be exponentially suppressed. However, energetic impacts from cosmic rays and latent radioactivity violate both of these assumptions. An impinging particle ionizes the substrate, radiating high energy phonons that induce a burst of quasiparticles, destroying qubit coherence throughout the device. High-energy radiation has been identified as a source of error in pilot superconducting quantum devices, but lacking a measurement technique able to resolve a single event in detail, the effect on large scale algorithms and error correction in particular remains an open question. Elucidating the physics involved requires operating large numbers of qubits at the same rapid timescales as in error correction, exposing the event&#39;s evolution in time and spread in space. Here, we directly observe high-energy rays impacting a large-scale quantum processor. We introduce a rapid space and time-multiplexed measurement method and identify large bursts of quasiparticles that simultaneously and severely limit the energy coherence of all qubits, causing chip-wide failure. We track the events from their initial localised impact to high error rates across the chip. Our results provide direct insights into the scale and dynamics of these damaging error bursts in large-scale devices, and highlight the necessity of mitigation to enable quantum computing to scale.

preprint2021arXiv

Small-scale magnetic flux ropes and their properties based on in-situ measurements from Parker Solar Probe

We report small-scale magnetic flux ropes via the Parker Solar Probe in situ measurements during the first six encounters and present additional analyses to supplement our prior work in Chen et al. 2021. These flux ropes are detected by the Grad-Shafranov-based algorithm with the duration and scale size ranging from 10 seconds to $\lesssim$1 hour and from a few hundred kilometers to 10$^{-3}$ au, respectively. They include both static structures and those with significant field-aligned plasma flows. Most structures tend to possess large cross helicity, while the residual energy distributes in wide ranges. We find that these dynamic flux ropes mostly propagate anti-sunward, with no preferential sign of magnetic helicity. The magnetic flux function follows a power law and is proportional to scale size. We also present case studies showing reconstructed two-dimensional (2D) configurations, which confirm that the static and dynamic flux ropes have the common configuration of spiral magnetic field lines (also streamlines). Moreover, the existence of such events hints at the interchange reconnection as a possible mechanism to generate flux rope-like structures near the Sun. Lastly, we summarize the major findings and discuss the possible correlation between these flux rope-like structures and turbulence due to the process of local Alfvenic alignment.

preprint2021arXiv

The LOB Recreation Model: Predicting the Limit Order Book from TAQ History Using an Ordinary Differential Equation Recurrent Neural Network

In an order-driven financial market, the price of a financial asset is discovered through the interaction of orders - requests to buy or sell at a particular price - that are posted to the public limit order book (LOB). Therefore, LOB data is extremely valuable for modelling market dynamics. However, LOB data is not freely accessible, which poses a challenge to market participants and researchers wishing to exploit this information. Fortunately, trades and quotes (TAQ) data - orders arriving at the top of the LOB, and trades executing in the market - are more readily available. In this paper, we present the LOB recreation model, a first attempt from a deep learning perspective to recreate the top five price levels of the LOB for small-tick stocks using only TAQ data. Volumes of orders sitting deep in the LOB are predicted by combining outputs from: (1) a history compiler that uses a Gated Recurrent Unit (GRU) module to selectively compile prediction relevant quote history; (2) a market events simulator, which uses an Ordinary Differential Equation Recurrent Neural Network (ODE-RNN) to simulate the accumulation of net order arrivals; and (3) a weighting scheme to adaptively combine the predictions generated by (1) and (2). By the paradigm of transfer learning, the source model trained on one stock can be fine-tuned to enable application to other financial assets of the same class with much lower demand on additional data. Comprehensive experiments conducted on two real world intraday LOB datasets demonstrate that the proposed model can efficiently recreate the LOB with high accuracy using only TAQ data as input.

preprint2021arXiv

Violation and Revival of Kramers&#39; Degeneracy in Open Quantum Systems

Kramers&#39; theorem ensures double degeneracy in the energy spectrum of a time-reversal symmetric fermionic system with half-integer total spin. Here we are now trying to go beyond the closed system and discuss Kramers&#39; degeneracy in open systems out of equilibrium. In this letter, we prove that the Kramers&#39; degeneracy in interacting fermionic systems is equivalent to the degeneracy in the spectra of different spins together with the vanishing of the inter-spin spectrum. We find the violation of Kramers&#39; degeneracy in time-reversal symmetric open quantum systems is locked with whether the system reaches thermal equilibrium. After a sudden coupling to an environment in a time-reversal symmetry preserving way, the Kramers doublet experiences an energy splitting at a short time and then a recovery process. We verified the violation and revival of Kramers&#39; degeneracy in a concrete model of interacting fermions and we find Kramers&#39; degeneracy is restored after the local thermalization time. By contrast, for time-reversal symmetry $\tilde{\cal T}$ with $\tilde{\cal T}^2=1$, we find although there is a violation and revival of spectral degeneracy for different spins, the inter-spin spectral function is always nonzero. We also prove that the degeneracy in spectral function protected by unitary symmetry can be maintained always.

preprint2020arXiv

A Bilateral Game Approach for Task Outsourcing in Multi-access Edge Computing

Multi-access edge computing (MEC) is a promising architecture to provide low-latency applications for future Internet of Things (IoT)-based network systems. Together with the increasing scholarly attention on task offloading, the problem of edge servers&#39; resource allocation has been widely studied. Most of previous works focus on a single edge server (ES) serving multiple terminal entities (TEs), which restricts their access to sufficient resources. In this paper, we consider a MEC resource transaction market with multiple ESs and multiple TEs, which are interdependent and mutually influence each other. However, this many-to-many interaction requires resolving several problems, including task allocation, TEs&#39; selection on ESs and conflicting interests of both parties. Game theory can be used as an effective tool to realize the interests of two or more conflicting individuals in the trading market. Therefore, we propose a bilateral game framework among multiple ESs and multiple TEs by modeling the task outsourcing problem as two noncooperative games: the supplier and customer side games. In the first game, the supply function bidding mechanism is employed to model the ESs&#39; profit maximization problem. The ESs submit their bids to the scheduler, where the computing service price is computed and sent to the TEs. While in the second game, TEs determine the optimal demand profiles according to ESs&#39; bids to maximize their payoff. The existence and uniqueness of the Nash equilibrium in the aforementioned games are proved. A distributed task outsourcing algorithm (DTOA) is designed to determine the equilibrium. Simulation results have demonstrated the superior performance of DTOA in increasing the ESs&#39; profit and TEs&#39; payoff, as well as flattening the peak and off-peak load.

preprint2020arXiv

A Time Delay Dynamic System with External Source for the Local Outbreak of 2019-nCoV

How to model the 2019 CoronaVirus (2019-nCov) spread in China is one of the most urgent and interesting problems in applied mathematics. In this paper, we propose a novel time delay dynamic system with external source to describe the trend of local outbreak for the 2019-nCoV. The external source is introduced in the newly proposed dynamic system, which can be considered as the suspected people travel to different areas. The numerical simulations exhibit the dynamic system with the external source is more reliable than the one without it, and the rate of isolation is extremely important for controlling the increase of cumulative confirmed people of 2019-nCoV. Based on our numerical simulation results with the public data, we suggest that the local government should have some more strict measures to maintain the rate of isolation. Otherwise the local cumulative confirmed people of 2019-nCoV might be out of control.

preprint2020arXiv

A Time Delay Dynamical Model for Outbreak of 2019-nCoV and the Parameter Identification

In this paper, we propose a novel dynamical system with time delay to describe the outbreak of 2019-nCoV in China. One typical feature of this epidemic is that it can spread in latent period, which is therefore described by the time delay process in the differential equations. The accumulated numbers of classified populations are employed as variables, which is consistent with the official data and facilitates the parameter identification. The numerical methods for the prediction of outbreak of 2019-nCoV and parameter identification are provided, and the numerical results show that the novel dynamic system can well predict the outbreak trend so far. Based on the numerical simulations, we suggest that the transmission of individuals should be greatly controlled with high isolation rate by the government.

preprint2020arXiv

An Experimental Study on Microservices based Edge Computing Platforms

The rapid technological advances in the Internet of Things (IoT) allows the blueprint of Smart Cities to become feasible by integrating heterogeneous cloud/fog/edge computing paradigms to collaboratively provide variant smart services in our cities and communities. Thanks to attractive features like fine granularity and loose coupling, the microservices architecture has been proposed to provide scalable and extensible services in large scale distributed IoT systems. Recent studies have evaluated and analyzed the performance interference between microservices based on scenarios on the cloud computing environment. However, they are not holistic for IoT applications given the restriction of the edge device like computation consumption and network capacity. This paper investigates multiple microservice deployment policies on the edge computing platform. The microservices are developed as docker containers, and comprehensive experimental results demonstrate the performance and interference of microservices running on benchmark scenarios.

preprint2020arXiv

Automatic, Dynamic, and Nearly Optimal Learning Rate Specification by Local Quadratic Approximation

In deep learning tasks, the learning rate determines the update step size in each iteration, which plays a critical role in gradient-based optimization. However, the determination of the appropriate learning rate in practice typically replies on subjective judgement. In this work, we propose a novel optimization method based on local quadratic approximation (LQA). In each update step, given the gradient direction, we locally approximate the loss function by a standard quadratic function of the learning rate. Then, we propose an approximation step to obtain a nearly optimal learning rate in a computationally efficient way. The proposed LQA method has three important features. First, the learning rate is automatically determined in each update step. Second, it is dynamically adjusted according to the current loss function value and the parameter estimates. Third, with the gradient direction fixed, the proposed method leads to nearly the greatest reduction in terms of the loss function. Extensive experiments have been conducted to prove the strengths of the proposed LQA method.

preprint2020arXiv

Chargeable photoconductivity in Van der Waals heterojunctions

Van der Waals (vdW) heterojunctions, based on two-dimensional (2D) materials, show great potential for the development of eco-friendly and high-efficiency nano-devices. Considerable research has been performed and has reported valuable applications of photovoltaic cells, photodetectors, etc. However, simultaneous energy conversion and storage in a single device has not been achieved. Here, we demonstrate a simple strategy to construct a vdW p-n junction between a WSe2 layer and quasi-2D electron gas. After once optical illumination, the device stores the light-generated electrons and holes for up to seven days, and then releases a very large photocurrent of 2.9 mA with bias voltage applied in darkness; this is referred to as chargeable photoconductivity (CPC), which completely differs from any previously observed photoelectric phenomenon. In normal photoconductivity, the recombination of electron-hole pairs takes place at the end of their lifetime, causing a release of heat; in contrast, infinite-lifetime photocarriers can be generated in CPC devices without a thermal loss. The photoelectric conversion and storage are completely self-excited during the charging process. The ratio between currents in full- and empty-energy states below the critical temperature reaches as high as 109, with an external quantum efficiency of 4410000% during optical charging. A theoretical model developed to explain the mechanism of this effect is in good agreement with the experimental data. This work paves a path towards storage-type photoconductors and high-efficiency entropy-decreasing devices.

preprint2020arXiv

Charged-particle multiplicity dependence of charm-baryon-to-meson ratio in high-energy proton-proton collisions

We propose that the charged-particle multiplicity dependence of the charm-baryon-to-meson ratio observed in high-energy $pp$ collisions can be explained by canonical treatment of quantum charges in the statistical hadronization model (SHM). Taking the full particle listings of PDG complemented by additional charm-baryon states from relativistic quark model predictions, we evaluate the canonical partition function and the charm-hadron chemical factors that measure the canonical suppression arising from the requirement of strict conservation of quantum charges. We demonstrate that, while charm number conservation induces common suppression on the production of both charm-baryons and -mesons, baryon (strangeness) number conservation causes further suppression on charm-baryons (charm-strange mesons) relative to nonstrange charm-mesons, thereby resulting in a decreasing $Λ_c/D^0$ ($D_s/D^0$) ratio toward smaller multiplicity events. The charm-hadron thermal densities thus computed are then used as pertinent weights to perform charm-quark fragmentation simulations yielding $p_T$-dependent $Λ_c/D^0$ and $D_s/D^0$ ratios at varying multiplicities in fair agreement with ALICE measurements.

preprint2020arXiv

CVPR 2020 Continual Learning in Computer Vision Competition: Approaches, Results, Current Challenges and Future Directions

In the last few years, we have witnessed a renewed and fast-growing interest in continual learning with deep neural networks with the shared objective of making current AI systems more adaptive, efficient and autonomous. However, despite the significant and undoubted progress of the field in addressing the issue of catastrophic forgetting, benchmarking different continual learning approaches is a difficult task by itself. In fact, given the proliferation of different settings, training and evaluation protocols, metrics and nomenclature, it is often tricky to properly characterize a continual learning algorithm, relate it to other solutions and gauge its real-world applicability. The first Continual Learning in Computer Vision challenge held at CVPR in 2020 has been one of the first opportunities to evaluate different continual learning algorithms on a common hardware with a large set of shared evaluation metrics and 3 different settings based on the realistic CORe50 video benchmark. In this paper, we report the main results of the competition, which counted more than 79 teams registered, 11 finalists and 2300$ in prizes. We also summarize the winning approaches, current challenges and future research directions.

preprint2020arXiv

Deform-GAN:An Unsupervised Learning Model for Deformable Registration

Deformable registration is one of the most challenging task in the field of medical image analysis, especially for the alignment between different sequences and modalities. In this paper, a non-rigid registration method is proposed for 3D medical images leveraging unsupervised learning. To the best of our knowledge, this is the first attempt to introduce gradient loss into deep-learning-based registration. The proposed gradient loss is robust across sequences and modals for large deformation. Besides, adversarial learning approach is used to transfer multi-modal similarity to mono-modal similarity and improve the precision. Neither ground-truth nor manual labeling is required during training. We evaluated our network on a 3D brain registration task comprehensively. The experiments demonstrate that the proposed method can cope with the data which has non-functional intensity relations, noise and blur. Our approach outperforms other methods especially in accuracy and speed.

preprint2020arXiv

Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms

Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite resources offered by existing noisy quantum hardware. Here, taking advantage of the strong adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an iSWAP-like gate to attain an arbitrary swap angle, $θ$, and a CPHASE gate that generates an arbitrary conditional phase, $ϕ$. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic Simulation, or fSim, gate set. We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim($θ$, $ϕ$) parameter space achieving purity-limited average two-qubit Pauli error of $3.8 \times 10^{-3}$ per fSim gate.

preprint2020arXiv

Effects of Radial Distances on Small-scale Magnetic Flux Ropes in the Solar Wind

Small-scale magnetic flux ropes (SFRs), in the solar wind, have been studied for decades. Statistical analysis utilizing various in situ spacecraft measurements is the main observational approach which helps investigate the generation and evolution of these small-scale structures. Based on the Grad-Shafranov (GS) reconstruction technique, we use the automated detection algorithm to build the databases of these small-scale structures via various spacecraft measurements at different heliocentric distances. We present the SFR properties including the magnetic field and plasma parameters at different radial distances from the sun near the ecliptic plane. It is found that the event occurrence rate is still in the order of a few hundreds per month, the duration and scale size distributions follow power laws, and the flux rope axis orientations are approximately centered around the local Parker spiral directions. In general, most SFR properties exhibit radial decays. In addition, with various databases established, we derive scaling laws for the changes of average field magnitude, event counts, and SFR scale sizes, with respect to the radial distances, ranging from $\sim$ 0.3 au for Helios to $\sim$ 7 au for the Voyager spacecraft. The implications of our results for comparisons with the relevant theoretical works and for the application to the Parker Solar Probe (PSP) mission are discussed.

preprint2020arXiv

Enabling Continuous Operations for UAVs with an Autonomous Service Network Infrastructure

One of the major restrictions on the practical applications of unmanned aerial vehicles (UAV) is their incomplete self-sufficiency, which makes continuous operations infeasible without human oversights. The more oversight UAVs require, the less likely they are going to be commercially advantageous when compared to their alternatives. As an autonomous system, how much human interaction is needed to function is one of the best indicators evaluating the limitations and inefficiencies of the UAVs. Popular UAV related research areas, such as path planning and computer vision, have enabled substantial advances in the ability of drones to act on their own. This research is dedicated to in-flight operations, in which there is not much reported effort to tackle the problem from the aspect of the supportive infrastructure. In this paper, an Autonomous Service network infrastructure (AutoServe) is proposed. Aiming at increasing the future autonomy of UAVs, the AutoServe system includes a service-oriented landing platform and a customized communication protocol. This supportive AutoServe infrastructure will autonomize many tasks currently done manually by human operators, such as battery replacement. A proof-of-concept prototype has been built and the simulation experimental study validated the design.

preprint2020arXiv

Estimates and Asymptotics for the stress concentration between closely spaced stiff $C^{1, γ}$ inclusions in linear elasticity

This paper is concerned with the stress concentration phenomenon in elastic composite materials when the inclusions are very closely spaced. We investigate the gradient blow-up estimates for the Lamé system of linear elasticity with partially infinite coefficients to show the dependence of the degree of stress enhancement on the distance between inclusions in a composite containing densely placed stiff inclusions. In this paper we assume that the inclusions to be of $C^{1, γ}$, weaker than the previous $C^{2, γ}$ assumption. To overcome this new difficulty, we make use of $W^{1, p}$ estimates for elliptic system with right hand side in divergence form, instead of a direct $W^{2, p}$ argument for $C^{2, γ}$ inclusion case, and combine with the Campanato&#39;s approach to establish the optimal gradient estimates, including upper and lower bounds. Moreover, an asymptotic formula of the gradient near the blow-up point is obtained for some symmetric $C^{1, γ}$ inclusions.

preprint2020arXiv

Exploitation and Exploration Analysis of Elitist Evolutionary Algorithms: A Case Study

Known as two cornerstones of problem solving by search, exploitation and exploration are extensively discussed for implementation and application of evolutionary algorithms (EAs). However, only a few researches focus on evaluation and theoretical estimation of exploitation and exploration. Considering that exploitation and exploration are two issues regarding global search and local search, this paper proposes to evaluate them via the success probability and the one-step improvement rate computed in different domains of integration. Then, case studies are performed by analyzing performances of (1+1) random univariate search and (1+1) evolutionary programming on the sphere function and the cheating problem. By rigorous theoretical analysis, we demonstrate that both exploitation and exploration of the investigated elitist EAs degenerate exponentially with the problem dimension $n$. Meanwhile, it is also shown that maximization of exploitation and exploration can be achieved by setting an appropriate value for the standard deviation $σ$ of Gaussian mutation, which is positively related to the distance from the present solution to the center of the promising region.

preprint2020arXiv

Feasibility and physics potential of detecting $^8$B solar neutrinos at JUNO

The Jiangmen Underground Neutrino Observatory~(JUNO) features a 20~kt multi-purpose underground liquid scintillator sphere as its main detector. Some of JUNO&#39;s features make it an excellent experiment for $^8$B solar neutrino measurements, such as its low-energy threshold, its high energy resolution compared to water Cherenkov detectors, and its much large target mass compared to previous liquid scintillator detectors. In this paper we present a comprehensive assessment of JUNO&#39;s potential for detecting $^8$B solar neutrinos via the neutrino-electron elastic scattering process. A reduced 2~MeV threshold on the recoil electron energy is found to be achievable assuming the intrinsic radioactive background $^{238}$U and $^{232}$Th in the liquid scintillator can be controlled to 10$^{-17}$~g/g. With ten years of data taking, about 60,000 signal and 30,000 background events are expected. This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter, which will shed new light on the tension between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework. If $Δm^{2}_{21}=4.8\times10^{-5}~(7.5\times10^{-5})$~eV$^{2}$, JUNO can provide evidence of neutrino oscillation in the Earth at the about 3$σ$~(2$σ$) level by measuring the non-zero signal rate variation with respect to the solar zenith angle. Moveover, JUNO can simultaneously measure $Δm^2_{21}$ using $^8$B solar neutrinos to a precision of 20\% or better depending on the central value and to sub-percent precision using reactor antineutrinos. A comparison of these two measurements from the same detector will help elucidate the current tension between the value of $Δm^2_{21}$ reported by solar neutrino experiments and the KamLAND experiment.

preprint2020arXiv

Fluctuation-enhanced quantum metrology

The main obstacle for practical quantum technology is the noise, which can induce the decoherence and destroy the potential quantum advantages. The fluctuation of a field, which induces the dephasing of the system, is one of the most common noises and widely regarded as detrimental to quantum technologies. Here we show, contrary to the conventional belief, the fluctuation can be used to improve the precision limits in quantum metrology for the estimation of various parameters. Specifically, we show that for the estimation of the direction and rotating frequency of a field, the achieved precisions at the presence of the fluctuation can even surpass the highest precision achievable under the unitary dynamics which have been widely taken as the ultimate limit. We provide explicit protocols, which employs the adaptive quantum error correction, to achieve the higher precision limits with the fluctuating fields. Our study provides a completely new perspective on the role of the noises in quantum metrology. It also opens the door for higher precisions beyond the limit that has been believed to be ultimate.

preprint2020arXiv

Graph-Based Parallel Large Scale Structure from Motion

While Structure from Motion (SfM) achieves great success in 3D reconstruction, it still meets challenges on large scale scenes. In this work, large scale SfM is deemed as a graph problem, and we tackle it in a divide-and-conquer manner. Firstly, the images clustering algorithm divides images into clusters with strong connectivity, leading to robust local reconstructions. Then followed with an image expansion step, the connection and completeness of scenes are enhanced by expanding along with a maximum spanning tree. After local reconstructions, we construct a minimum spanning tree (MinST) to find accurate similarity transformations. Then the MinST is transformed into a Minimum Height Tree (MHT) to find a proper anchor node and is further utilized to prevent error accumulation. When evaluated on different kinds of datasets, our approach shows superiority over the state-of-the-art in accuracy and efficiency. Our algorithm is open-sourced at https://github.com/AIBluefisher/GraphSfM.

preprint2020arXiv

Graphene nanopipette enabled liquid delivery at zeptoliter precision

Accurate extraction of liquid is the first step towards low-volume liquid delivery and nanocharacterization, which plays a significant role in biomedical research. In this study, a tip-shaped graphene nanopipette (GNP) is proposed by encapsulating the biomolecule solution on the prefabricated metal tip with graphene. The volume of the encapsulated liquid is highly controllable at zeptoliter precision by tuning the encapsulating speed and the number of graphene encapsulation rounds. Using protein (ferritin) solution as an example, it has been confirmed by finite element analysis and the controlled experiments that the GNP allows the delivery of ferritin solution at the zeptoliter-scale. Furthermore, GNP is demonstrated as a new type of tip-shaped liquid cell, which is suitable for multiple nanocharacterization techniques. In particular, due to the ultra-sharp tip shape, isotope (13C)-labelled glucose solution encapsulated in GNP has been characterized by atom probe tomography (APT) in the laser-pulsed mode. Analysis of the mass spectrum and the reconstructed three-dimensional chemical maps reveals the quantitative distribution and the compositions of individual glucose molecules. The GNP is expected to be introduced to deliver liquid in the range of zeptoliters to attoliters, and brings a new capability for characterization of biological specimens in their near-native state.

preprint2020arXiv

GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension

Conversational machine comprehension (MC) has proven significantly more challenging compared to traditional MC since it requires better utilization of conversation history. However, most existing approaches do not effectively capture conversation history and thus have trouble handling questions involving coreference or ellipsis. Moreover, when reasoning over passage text, most of them simply treat it as a word sequence without exploring rich semantic relationships among words. In this paper, we first propose a simple yet effective graph structure learning technique to dynamically construct a question and conversation history aware context graph at each conversation turn. Then we propose a novel Recurrent Graph Neural Network, and based on that, we introduce a flow mechanism to model the temporal dependencies in a sequence of context graphs. The proposed GraphFlow model can effectively capture conversational flow in a dialog, and shows competitive performance compared to existing state-of-the-art methods on CoQA, QuAC and DoQA benchmarks. In addition, visualization experiments show that our proposed model can offer good interpretability for the reasoning process.

preprint2020arXiv

Hartree-Fock on a superconducting qubit quantum computer

As the search continues for useful applications of noisy intermediate scale quantum devices, variational simulations of fermionic systems remain one of the most promising directions. Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of ${\rm H}_6$, ${\rm H}_8$, ${\rm H}_{10}$ and ${\rm H}_{12}$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments. Our parameterized ansatz circuits realize the Givens rotation approach to non-interacting fermion evolution, which we variationally optimize to prepare the Hartree-Fock wavefunction. This ubiquitous algorithmic primitive corresponds to a rotation of the orbital basis and is required by many proposals for correlated simulations of molecules and Hubbard models. Because non-interacting fermion evolutions are classically tractable to simulate, yet still generate highly entangled states over the computational basis, we use these experiments to benchmark the performance of our hardware while establishing a foundation for scaling up more complex correlated quantum simulations of chemistry.

preprint2020arXiv

HODET: Hybrid Object DEtection and Tracking using mmWave Radar and Visual Sensors

Image sensors have been explored heavily in automotive applications for collision avoidance and varying levels of autonomy. It requires a degree of brightness, therefore, the use of an image sensor in nighttime operation or dark conditions can be problematic along with challenging weather such as fog. Radar sensors have been employed to help cover the various environmental challenges with visible spectrum cameras. Edge computing technology has the potential to address a number of issues such as real-time processing requirements, off-loading of processing from congested servers, and size, weight, power, and cost (SWaP-C) constraints. This paper proposes a novel Hybrid Object DEtection and Tracking (HODET) using mmWave Radar and Visual Sensors at the edge. The HODET is a computing application of low SWaP-C electronics performing object detection, tracking and identification algorithms with the simultaneous use of image and radar sensors. While the machine vision camera alone could estimate the distance of an object, the radar sensor will provide an accurate distance and vector of movement. This additional data accuracy can be leveraged to further discriminate a detected object to protect against spoofing attacks. A real-world smart community public safety monitoring scenario is selected to verify the effectiveness of HODET, which detects, tracks objects of interests and identify suspicious activities. The experimental results demonstrate the feasibility of the approach.

preprint2020arXiv

Hybrid Blockchain-Enabled Secure Microservices Fabric for Decentralized Multi-Domain Avionics Systems

Advancement in artificial intelligence (AI) and machine learning (ML), dynamic data driven application systems (DDDAS), and hierarchical cloud-fog-edge computing paradigm provide opportunities for enhancing multi-domain systems performance. As one example that represents multi-domain scenario, a &#34;fly-by-feel&#34; system utilizes DDDAS framework to support autonomous operations and improve maneuverability, safety and fuel efficiency. The DDDAS &#34;fly-by-feel&#34; avionics system can enhance multi-domain coordination to support domain specific operations. However, conventional enabling technologies rely on a centralized manner for data aggregation, sharing and security policy enforcement, and it incurs critical issues related to bottleneck of performance, data provenance and consistency. Inspired by the containerized microservices and blockchain technology, this paper introduces BLEM, a hybrid BLockchain-Enabled secure Microservices fabric to support decentralized, secure and efficient data fusion and multi-domain operations for avionics systems. Leveraging the fine-granularity and loose-coupling features of the microservices architecture, multidomain operations and security functionalities are decoupled into multiple containerized microservices. A hybrid blockchain fabric based on two-level committee consensus protocols is proposed to enable decentralized security architecture and support immutability, auditability and traceability for data provenience in existing multi-domain avionics system. Our evaluation results show the feasibility of the proposed BLEM mechanism to support decentralized security service and guarantee immutability, auditability and traceability for data provenience across domain boundaries.

preprint2020arXiv

I-ViSE: Interactive Video Surveillance as an Edge Service using Unsupervised Feature Queries

Situation AWareness (SAW) is essential for many mission critical applications. However, SAW is very challenging when trying to immediately identify objects of interest or zoom in on suspicious activities from thousands of video frames. This work aims at developing a queryable system to instantly select interesting content. While face recognition technology is mature, in many scenarios like public safety monitoring, the features of objects of interest may be much more complicated than face features. In addition, human operators may not be always able to provide a descriptive, simple, and accurate query. Actually, it is more often that there are only rough, general descriptions of certain suspicious objects or accidents. This paper proposes an Interactive Video Surveillance as an Edge service (I-ViSE) based on unsupervised feature queries. Adopting unsupervised methods that do not reveal any private information, the I-ViSE scheme utilizes general features of a human body and color of clothes. An I-ViSE prototype is built following the edge-fog computing paradigm and the experimental results verified the I-ViSE scheme meets the design goal of scene recognition in less than two seconds.

preprint2020arXiv

Minor Privacy Protection Through Real-time Video Processing at the Edge

The collection of a lot of personal information about individuals, including the minor members of a family, by closed-circuit television (CCTV) cameras creates a lot of privacy concerns. Particularly, revealing children&#39;s identifications or activities may compromise their well-being. In this paper, we investigate lightweight solutions that are affordable to edge surveillance systems, which is made feasible and accurate to identify minors such that appropriate privacy-preserving measures can be applied accordingly. State of the art deep learning architectures are modified and re-purposed in a cascaded fashion to maximize the accuracy of our model. A pipeline extracts faces from the input frames and classifies each one to be of an adult or a child. Over 20,000 labeled sample points are used for classification. We explore the timing and resources needed for such a model to be used in the Edge-Fog architecture at the edge of the network, where we can achieve near real-time performance on the CPU. Quantitative experimental results show the superiority of our proposed model with an accuracy of 92.1% in classification compared to some other face recognition based child detection approaches.

preprint2020arXiv

Multi-label Relation Modeling in Facial Action Units Detection

This paper describes an approach to the facial action units detections. The involved action units (AU) include AU1 (Inner Brow Raiser), AU2 (Outer Brow Raiser), AU4 (Brow Lowerer), AU6 (Cheek Raise), AU12 (Lip Corner Puller), AU15 (Lip Corner Depressor), AU20 (Lip Stretcher), and AU25 (Lip Part). Our work relies on the dataset released by the FG-2020 Competition: Affective Behavior Analysis In-the-Wild (ABAW). The proposed method consists of the data preprocessing, the feature extraction and the AU classification. The data preprocessing includes the detection of face texture and landmarks. The texture static and landmark dynamic features are extracted through neural networks and then fused as the feature latent representation. Finally, the fused feature is taken as the initial hidden state of a recurrent neural network with a trainable lookup AU table. The output of the RNN is the results of AU classification. The detected accuracy is evaluated with 0.5$\times$accuracy + 0.5$\times$F1. Our method achieve 0.56 with the validation data that is specified by the organization committee.

preprint2020arXiv

Near-linear Size Hypergraph Cut Sparsifiers

Cuts in graphs are a fundamental object of study, and play a central role in the study of graph algorithms. The problem of sparsifying a graph while approximately preserving its cut structure has been extensively studied and has many applications. In a seminal work, Benczúr and Karger (1996) showed that given any $n$-vertex undirected weighted graph $G$ and a parameter $\varepsilon \in (0,1)$, there is a near-linear time algorithm that outputs a weighted subgraph $G&#39;$ of $G$ of size $\tilde{O}(n/\varepsilon^2)$ such that the weight of every cut in $G$ is preserved to within a $(1 \pm \varepsilon)$-factor in $G&#39;$. The graph $G&#39;$ is referred to as a {\em $(1 \pm \varepsilon)$-approximate cut sparsifier} of $G$. A natural question is if such cut-preserving sparsifiers also exist for hypergraphs. Kogan and Krauthgamer (2015) initiated a study of this question and showed that given any weighted hypergraph $H$ where the cardinality of each hyperedge is bounded by $r$, there is a polynomial-time algorithm to find a $(1 \pm \varepsilon)$-approximate cut sparsifier of $H$ of size $\tilde{O}(\frac{nr}{\varepsilon^2})$. Since $r$ can be as large as $n$, in general, this gives a hypergraph cut sparsifier of size $\tilde{O}(n^2/\varepsilon^2)$, which is a factor $n$ larger than the Benczúr-Karger bound for graphs. It has been an open question whether or not Benczúr-Karger bound is achievable on hypergraphs. In this work, we resolve this question in the affirmative by giving a new polynomial-time algorithm for creating hypergraph sparsifiers of size $\tilde{O}(n/\varepsilon^2)$.

preprint2020arXiv

Near-Perfect Recovery in the One-Dimensional Latent Space Model

Suppose a graph $G$ is stochastically created by uniformly sampling vertices along a line segment and connecting each pair of vertices with a probability that is a known decreasing function of their distance. We ask if it is possible to reconstruct the actual positions of the vertices in $G$ by only observing the generated unlabeled graph. We study this question for two natural edge probability functions -- one where the probability of an edge decays exponentially with the distance and another where this probability decays only linearly. We initiate our study with the weaker goal of recovering only the order in which vertices appear on the line segment. For a segment of length $n$ and a precision parameter $δ$, we show that for both exponential and linear decay edge probability functions, there is an efficient algorithm that correctly recovers (up to reflection symmetry) the order of all vertices that are at least $δ$ apart, using only $\tilde{O}(\frac{n}{δ^ 2})$ samples (vertices). Building on this result, we then show that $O(\frac{n^2 \log n}{δ^2})$ vertices (samples) are sufficient to additionally recover the location of each vertex on the line to within a precision of $δ$. We complement this result with an $Ω(\frac{n^{1.5}}δ)$ lower bound on samples needed for reconstructing positions (even by a computationally unbounded algorithm), showing that the task of recovering positions is information-theoretically harder than recovering the order. We give experimental results showing that our algorithm recovers the positions of almost all points with high accuracy.

preprint2020arXiv

Occlum: Secure and Efficient Multitasking Inside a Single Enclave of Intel SGX

Intel Software Guard Extensions (SGX) enables user-level code to create private memory regions called enclaves, whose code and data are protected by the CPU from software and hardware attacks outside the enclaves. Recent work introduces library operating systems (LibOSes) to SGX so that legacy applications can run inside enclaves with few or even no modifications. As virtually any non-trivial application demands multiple processes, it is essential for LibOSes to support multitasking. However, none of the existing SGX LibOSes support multitasking both securely and efficiently. This paper presents Occlum, a system that enables secure and efficient multitasking on SGX. We implement the LibOS processes as SFI-Isolated Processes (SIPs). SFI is a software instrumentation technique for sandboxing untrusted modules (called domains). We design a novel SFI scheme named MPX-based, Multi-Domain SFI (MMDSFI) and leverage MMDSFI to enforce the isolation of SIPs. We also design an independent verifier to ensure the security guarantees of MMDSFI. With SIPs safely sharing the single address space of an enclave, the LibOS can implement multitasking efficiently. The Occlum LibOS outperforms the state-of-the-art SGX LibOS on multitasking-heavy workloads by up to 6,600X on micro-benchmarks and up to 500X on application benchmarks.

preprint2020arXiv

Optical System Design of Bionic Compound Eye with Broad Field of View

In nature, many common insects have compound eyes composed of many small eyes arranged on a curved retina. This kind of vision systems have many advantages, such as small size, large FOV (field of view) and high sensitivity, which have attracted extensive attention and research from world-wide researchers. It has good application prospects in military strikes and mechanical vision. In this paper, a new type of miniature compound eye system with large FOV is designed, which contains a micro-lens array and a relay system. Hexagonal micro-lens array are spliced seamlessly as a curved shell in the designed compound eye system. The intermediate curved image formed by the curved array is converted to a planar image by introducing a relay system. After combination and optimization of the micro-lens array and the relay system, the MTF values at 89.3lp/mm for each FOV within 120.5° are greater than 0.3, and the corresponding RMS spot radii less than the radius of the Airy disk, which proves the good imaging quality for the compound eye. The clear aperture of a single micro lens is 250μm with FOV 6°. After tolerance analysis, the results show the image quality still holds good enough performance and meets the requirements of the additive manufacturing process.

preprint2020arXiv

Position reconstruction using photon timing for the DEAP-3600 dark matter experiment

DEAP-3600 is a single-phase liquid argon dark matter detector being operated 2 km underground at SNOLAB, Sudbury, Canada. The detector consists of 3.3 tonnes of ultra-pure liquid argon in a spherical acrylic cryostat instrumented with 255 photomultiplier tubes. Natural radioactive contamination in the acrylic vessel or TPB wavelength shifter can alpha-decay. Reconstruction of the position of the interactions taking place in the detector uses information about the number of photoelectrons detected in each PMT and when they were detected. Including this information in our suite of cuts allows us to identify and remove almost all surface background events. A method of event position reconstruction emphasizing photon timing is presented here.

preprint2020arXiv

Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation

Natural question generation (QG) aims to generate questions from a passage and an answer. Previous works on QG either (i) ignore the rich structure information hidden in text, (ii) solely rely on cross-entropy loss that leads to issues like exposure bias and inconsistency between train/test measurement, or (iii) fail to fully exploit the answer information. To address these limitations, in this paper, we propose a reinforcement learning (RL) based graph-to-sequence (Graph2Seq) model for QG. Our model consists of a Graph2Seq generator with a novel Bidirectional Gated Graph Neural Network based encoder to embed the passage, and a hybrid evaluator with a mixed objective combining both cross-entropy and RL losses to ensure the generation of syntactically and semantically valid text. We also introduce an effective Deep Alignment Network for incorporating the answer information into the passage at both the word and contextual levels. Our model is end-to-end trainable and achieves new state-of-the-art scores, outperforming existing methods by a significant margin on the standard SQuAD benchmark.

preprint2020arXiv

Simulation Pipeline for Traffic Evacuation in Urban Areas and Emergency Traffic Management Policy Improvements through Case Studies

Traffic evacuation plays a critical role in saving lives in devastating disasters such as hurricanes, wildfires, floods, earthquakes, etc. An ability to evaluate evacuation plans in advance for these rare events, including identifying traffic flow bottlenecks, improving traffic management policies, and understanding the robustness of the traffic management policy are critical for emergency management. Given the rareness of such events and the corresponding lack of real data, traffic simulation provides a flexible and versatile approach for such scenarios, and furthermore allows dynamic interaction with the simulated evacuation. In this paper, we build a traffic simulation pipeline to explore the above problems, covering many aspects of evacuation, including map creation, demand generation, vehicle behavior, bottleneck identification, traffic management policy improvement, and results analysis. We apply the pipeline to two case studies in California. The first is Paradise, which was destroyed by a large wildfire in 2018 and experienced catastrophic traffic jams during the evacuation. The second is Mill Valley, which has high risk of wildfire and potential traffic issues since the city is situated in a narrow valley.

preprint2020arXiv

Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation

We consider the problem of designing sublinear time algorithms for estimating the cost of a minimum metric traveling salesman (TSP) tour. Specifically, given access to a $n \times n$ distance matrix $D$ that specifies pairwise distances between $n$ points, the goal is to estimate the TSP cost by performing only sublinear (in the size of $D$) queries. For the closely related problem of estimating the weight of a metric minimum spanning tree (MST), it is known that for any $\varepsilon > 0$, there exists an $\tilde{O}(n/\varepsilon^{O(1)})$ time algorithm that returns a $(1 + \varepsilon)$-approximate estimate of the MST cost. This result immediately implies an $\tilde{O}(n/\varepsilon^{O(1)})$ time algorithm to estimate the TSP cost to within a $(2 + \varepsilon)$ factor for any $\varepsilon > 0$. However, no $o(n^2)$ time algorithms are known to approximate metric TSP to a factor that is strictly better than $2$. On the other hand, there were also no known barriers that rule out the existence of $(1 + \varepsilon)$-approximate estimation algorithms for metric TSP with $\tilde{O}(n)$ time for any fixed $\varepsilon > 0$. In this paper, we make progress on both algorithms and lower bounds for estimating metric TSP cost. We also show that the problem of estimating metric TSP cost is closely connected to the problem of estimating the size of a maximum matching in a graph.

preprint2020arXiv

TAO Conceptual Design Report: A Precision Measurement of the Reactor Antineutrino Spectrum with Sub-percent Energy Resolution

The Taishan Antineutrino Observatory (TAO, also known as JUNO-TAO) is a satellite experiment of the Jiangmen Underground Neutrino Observatory (JUNO). A ton-level liquid scintillator detector will be placed at about 30 m from a core of the Taishan Nuclear Power Plant. The reactor antineutrino spectrum will be measured with sub-percent energy resolution, to provide a reference spectrum for future reactor neutrino experiments, and to provide a benchmark measurement to test nuclear databases. A spherical acrylic vessel containing 2.8 ton gadolinium-doped liquid scintillator will be viewed by 10 m^2 Silicon Photomultipliers (SiPMs) of >50% photon detection efficiency with almost full coverage. The photoelectron yield is about 4500 per MeV, an order higher than any existing large-scale liquid scintillator detectors. The detector operates at -50 degree C to lower the dark noise of SiPMs to an acceptable level. The detector will measure about 2000 reactor antineutrinos per day, and is designed to be well shielded from cosmogenic backgrounds and ambient radioactivities to have about 10% background-to-signal ratio. The experiment is expected to start operation in 2022.

preprint2020arXiv

The First Round Result from the TianQin-1 Satellite

The TianQin-1 satellite (TQ-1), which is the first technology demonstration satellite for the TianQin project, was launched on 20 December 2019. The first round of experiment had been carried out from 21 December 2019 until 1 April 2020. The residual acceleration of the satellite is found to be about $1\times10^{-10}~{\rm m}/{\rm s}^{2}/{\rm Hz}^{1/2}$ at $0.1~{\rm Hz}\,$ and about $5\times10^{-11}~{\rm m}/{\rm s}^{2}/{\rm Hz}^{1/2}$ at $0.05~{\rm Hz}\,$, measured by an inertial sensor with a sensitivity of $5\times10^{-12}~{\rm m}/{\rm s}^{2}/{\rm Hz}^{1/2}$ at $0.1~{\rm Hz}\,$. The micro-Newton thrusters has demonstrated a thrust resolution of $0.1~μ{\rm N}$ and a thrust noise of $0.3~μ{\rm N}/{\rm Hz}^{1/2}$ at $0.1~{\rm Hz}$. The residual noise of the satellite with drag-free control is $3\times10^{-9}~{\rm m}/{\rm s}^{2}/{\rm Hz}^{1/2}$ at $0.1~{\rm Hz}\,$. The noise level of the optical readout system is about $30~{\rm pm}/{\rm Hz}^{1/2}$ at $0.1~{\rm Hz}\,$. The temperature stability at temperature monitoring position is controlled to be about $\pm3~{\rm mK}$ per orbit, and the mismatch between the center-of-mass of the satellite and that of the test mass is measured with a precision of better than $0.1~{\rm mm}$.

preprint2020arXiv

The Reconstruction and Prediction Algorithm of the Fractional TDD for the Local Outbreak of COVID-19

From late December, 2019, the novel Corona-Virus began to spread in the mainland of China. For predicting the trend of the Corona Virus spread, several time delay dynamic systems (TDD) are proposed. In this paper, we establish a novel fractional time delay dynamic system (FTDD) to describe the local outbreak of COVID-19. The fractional derivative is introduced to account for the sub-diffusion process of the confirmed and cured peoples growth. Based on the public health data by the government, we propose a stable reconstruction algorithm of the coefficients. The reconstructed coefficients are used to predict the trend of the Corona-Virus. The numerical results are in good agreement with the public data.

preprint2020arXiv

The TianQin project: current progress on science and technology

TianQin is a planned space-based gravitational wave (GW) observatory consisting of three earth orbiting satellites with an orbital radius of about $10^5~{\rm km}$. The satellites will form a equilateral triangle constellation the plane of which is nearly perpendicular to the ecliptic plane. TianQin aims to detect GWs between $10^{-4}~{\rm Hz}$ and $1~{\rm Hz}$ that can be generated by a wide variety of important astrophysical and cosmological sources, including the inspiral of Galactic ultra-compact binaries, the inspiral of stellar-mass black hole binaries, extreme mass ratio inspirals, the merger of massive black hole binaries, and possibly the energetic processes in the very early universe or exotic sources such as cosmic strings. In order to start science operations around 2035, a roadmap called the 0123 plan is being used to bring the key technologies of TianQin to maturity, supported by the construction of a series of research facilities on the ground. Two major projects of the 0123 plan are being carried out. In this process, the team has created a new generation $17~{\rm cm}$ single-body hollow corner-cube retro-reflector which has been launched with the QueQiao satellite on 21 May 2018; a new laser ranging station equipped with a $1.2~{\rm m}$ telescope has been constructed and the station has successfully ranged to all the five retro-reflectors on the Moon; and the TianQin-1 experimental satellite has been launched on 20 December 2019 and the first round result shows that the satellite has exceeded all of its mission requirements.

preprint2020arXiv

Train Your Data Processor: Distribution-Aware and Error-Compensation Coordinate Decoding for Human Pose Estimation

Recently, the leading performance of human pose estimation is dominated by heatmap based methods. While being a fundamental component of heatmap processing, heatmap decoding (i.e. transforming heatmaps to coordinates) receives only limited investigations, to our best knowledge. This work fills the gap by studying the heatmap decoding processing with a particular focus on the errors introduced throughout the prediction process. We found that the errors of heatmap based methods are surprisingly significant, which nevertheless was universally ignored before. In view of the discovered importance, we further reveal the intrinsic limitations of the previous widely used heatmap decoding methods and thereout propose a Distribution-Aware and Error-Compensation Coordinate Decoding (DAEC). Serving as a model-agnostic plug-in, DAEC learns its decoding strategy from training data and remarkably improves the performance of a variety of state-of-the-art human pose estimation models with negligible extra computation. Specifically, equipped with DAEC, the SimpleBaseline-ResNet152-256x192 and HRNet-W48-256x192 are significantly improved by 2.6 AP and 2.9 AP achieving 72.6 AP and 75.7 AP on COCO, respectively. Moreover, the HRNet-W32-256x256 and ResNet-152-256x256 frameworks enjoy even more dramatic promotions of 8.4% and 7.8% on MPII with PCKh0.1 metric. Extensive experiments performed on these two common benchmarks, demonstrates that DAEC exceeds its competitors by considerable margins, backing up the rationality and generality of our novel heatmap decoding idea. The project is available at https://github.com/fyang235/DAEC.

preprint2020arXiv

Using observed bacteria concentration and modeled transit time under an analytical framework to estimate overall removal rate of fecal coliform in an estuary

Abundance of fecal coliform (FC) is widely used to indicate the potential presence of pathogens, the No.1 cause of water impairments in the U.S. Despite extensive monitoring efforts, assessing and modeling FC pollution still faces challenges, largely owing to the uncertainties in estimation of overall removal rate (K). This study proposes an alternative method to estimate in situ K by combining observational data, hydrodynamic simulation, and analytical solution. The method requires the observed spatial distribution of FC concentration along an estuarine channel and the numerically-simulated transit time, and converts the K estimation from a temporal problem into a spatial problem, potentially reducing survey duration, effort, and cost. Application of the method gave an estimation of K = 0.5 d-1 on average for the Nassawadox Creek in Chesapeake Bay. The numerical and analytical model results with the estimated K agreed well with the observation, demonstrating the credibility of the method.

preprint2019arXiv

Natural Question Generation with Reinforcement Learning Based Graph-to-Sequence Model

Natural question generation (QG) aims to generate questions from a passage and an answer. In this paper, we propose a novel reinforcement learning (RL) based graph-to-sequence (Graph2Seq) model for QG. Our model consists of a Graph2Seq generator where a novel Bidirectional Gated Graph Neural Network is proposed to embed the passage, and a hybrid evaluator with a mixed objective combining both cross-entropy and RL losses to ensure the generation of syntactically and semantically valid text. The proposed model outperforms previous state-of-the-art methods by a large margin on the SQuAD dataset.

preprint2019arXiv

Non-Hermitian Linear Response Theory

Linear response theory lies at the heart of quantum many-body physics because it builds up connections between the dynamical response to an external probe and correlation functions at equilibrium. Here we consider the dynamical response of a Hermitian system to a non-Hermitian probe, and we develop a non-Hermitian linear response theory that can also relate this dynamical response to equilibrium properties. As an application of our theory, we consider the real-time dynamics of momentum distribution induced by one-body and two-body dissipations. We find that, for many cases, the dynamics of momentum occupation and the width of momentum distribution obey the same universal function, governed by the single-particle spectral function. We also find that, for critical state with no well-defined quasi-particles, the dynamics are slower than normal state and our theory provides a model independent way to extract the critical exponent. We apply our results to analyze recent experiment on the Bose-Hubbard model and find surprising good agreement between theory and experiment. We also propose to further verify our theory by carrying out a similar experiment on a one-dimensional Luttinger liquid.

preprint2019arXiv

Numerical Method for Parameter Inference of Nonlinear ODEs with Partial Observations

Parameter inference of dynamical systems is a challenging task faced by many researchers and practitioners across various fields. In many applications, it is common that only limited variables are observable. In this paper, we propose a method for parameter inference of a system of nonlinear coupled ODEs with partial observations. Our method combines fast Gaussian process based gradient matching (FGPGM) and deterministic optimization algorithms. By using initial values obtained by Bayesian steps with low sampling numbers, our deterministic optimization algorithm is both accurate and efficient.

preprint2019arXiv

Supplementary information for &#34;Quantum supremacy using a programmable superconducting processor&#34;

This is an updated version of supplementary information to accompany &#34;Quantum supremacy using a programmable superconducting processor&#34;, an article published in the October 24, 2019 issue of Nature. The main article is freely available at https://www.nature.com/articles/s41586-019-1666-5. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typographical and formatting corrections.