Searcharxiv⌕ Search

arXiv subjects

Kai Xu

Publications and source records attributed to Kai Xu.

At least 181 records · Page 10Linked to original sources

Determining the Meson Cloud Contribution of Nucleon Electromagnetic Form Factor Using Dispersion Relation

We explore the meson cloud contribution to nucleon electromagnetic form factors in dispersion relation approach. In our calculations, experimental data on transition amplitudes for pion-nucleon scatterings are taken directly as inputs, with the assumption that the photon-pion interaction dominates over other meson-photon couplings. Combining with the quark core contribution evaluated in quark model, the proton electromagnetic form factors are well reproduced in the work. The resulting mean-square charge radius of the proton agrees well with experimental data, and the quark core radius is reasonable.

hep-ph↗

Linear hypothesis testing in high-dimensional heteroscedastics via random integration

In this paper, for the problem of heteroskedastic general linear hypothesis testing (GLHT) in high-dimensional settings, we propose a random integration method based on the reference L2-norm to deal with such problems. The asymptotic properties of the test statistic can be obtained under the null hypothesis when the relationship between data dimensions and sample size is not specified. The results show that it is more advisable to approximate the null distribution of the test using the distribution of the chi-square type mixture, and it is shown through some numerical simulations and real data analysis that our proposed test is powerful.

math.ST↗

Dynamics of quantum coherence in many-body localized systems

We demonstrate that the dynamics of quantum coherence serves as an effective probe for identifying dephasing, which is a distinctive signature of many-body localization (MBL). Quantum coherence can be utilized to measure both the local coherence of specific subsystems and the total coherence of the whole system in a consistent manner. Our results reveal that the local coherence of small subsystems decays over time following a power law in the MBL phase, while it reaches a stable value within the same time window in the Anderson localized (AL) phase. In contrast, the total coherence of the whole system exhibits logarithmic growth during the MBL phase and reaches a stable value in the AL phase. Notably, this dynamic characteristic of quantum coherence remains robust even with weak interactions and displays unbounded behavior in infinite systems. Our results provide insights into understanding many-body dephasing phenomena in MBL systems and propose a novel feasible method for identifying and characterizing MBL phases in experiments.

quant-ph↗

LLM-enhanced Scene Graph Learning for Household Rearrangement

The household rearrangement task involves spotting misplaced objects in a scene and accommodate them with proper places. It depends both on common-sense knowledge on the objective side and human user preference on the subjective side. In achieving such task, we propose to mine object functionality with user preference alignment directly from the scene itself, without relying on human intervention. To do so, we work with scene graph representation and propose LLM-enhanced scene graph learning which transforms the input scene graph into an affordance-enhanced graph (AEG) with information-enhanced nodes and newly discovered edges (relations). In AEG, the nodes corresponding to the receptacle objects are augmented with context-induced affordance which encodes what kind of carriable objects can be placed on it. New edges are discovered with newly discovered non-local relations. With AEG, we perform task planning for scene rearrangement by detecting misplaced carriables and determining a proper placement for each of them. We test our method by implementing a tiding robot in simulator and perform evaluation on a new benchmark we build. Extensive evaluations demonstrate that our method achieves state-of-the-art performance on misplacement detection and the following rearrangement planning.

cs.RO↗

Absence of Anomalous Electron-Phonon Coupling in the Temperature Renormalization of the Gap of CsPbBr$_3$ Nanocrystals

Metal halide perovskites exhibit a fairly linear increase of the bandgap with increasing temperature, when crystallized in a tetragonal or cubic phase. In general, both thermal expansion and electron-phonon interaction effects contribute equally to this variation of the gap with temperature. Herein, we have disentangled both contributions in the case of colloidal CsPbBr$_3$ nanocrystals (NCs) by means of photoluminescence (PL) measurements as a function of temperature (from 80 K to ambient) and hydrostatic pressure (from atmospheric to ca. 1 GPa). At around room temperature, CsPbBr$_3$ NCs also show a linear increase of the bandgap with temperature with a slope similar to that of the archetypal methylammonium lead iodide (MAPbI$_3$) perovskite. This is somehow unexpected in view of the recent observations in mixed-cation Cs$_x$MA$_{1-x}$PbI$_3$ single crystals with low Cs content, for which Cs incorporation caused a reduction by a factor of two in the temperature slope of the gap. This effect was ascribed to an anomalous electron-phonon interaction induced by the coupling with vibrational modes admixed with the Cs translational dynamics inside the cage voids. Thus, no trace of anomalous coupling is found in CsPbBr$_3$ NCs. In fact, we show that the linear temperature renormalization exhibited by the gap of CsPbBr$_3$ NCs is shared with most metal halide perovskites, due to a common bonding/antibonding and atomic orbital character of the electronic band-edge states. In this way, we provide a deeper understanding of the gap temperature dependence in the general case when the A-site cation dynamics is not involved in the electron-phonon interaction.

cond-mat.mtrl-sci↗

Distributed Quantum Computation via Entanglement Forging and Teleportation

Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. It can be realized by direct quantum channels in flying qubits. Moreover, the pre-established quantum entanglements can also play the role of quantum channels with local operations and classical channels. However, without quantum correlations like quantum channels and entanglements, the entanglement forging technique allows us to classically forge the entangled states with local operations and classical channels only. In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations, which is based on the fact that teleportation with classically forged Bell states is equivalent to quantum state tomography. In compensation, the overhead of single-shot measurement will increase, and several auxiliary qubits are required. Our results extend the possibility of integrating quantum processors. We expect that our methods will complement the toolbox of distributed quantum computation, and facilitate the extension of the scale of quantum computations.

quant-ph↗

Purity-Assisted Zero-Noise Extrapolation for Quantum Error Mitigation

Quantum error mitigation aims to reduce errors in quantum systems and improve accuracy. Zero-noise extrapolation (ZNE) is a commonly used method, where noise is amplified, and the target expectation is extrapolated to a noise-free point. However, ZNE relies on assumptions about error rates based on the error model. In this study, a purity-assisted zero-noise extrapolation (pZNE) method is utilized to address limitations in error rate assumptions and enhance the extrapolation process. The pZNE is based on the Pauli diagonal error model implemented using the Pauli twirling technique. Although this method does not significantly reduce the bias of routine ZNE, it extends its effectiveness to a wider range of error rates where routine ZNE may face limitations. In addition, the practicality of the pZNE method is verified through numerical simulations and experiments on the online quantum computation platform, Quafu. Comparisons with routine ZNE and virtual distillation methods show that biases in extrapolation methods increase with error rates and may become divergent at high error rates. The bias of pZNE is slightly lower than routine ZNE, while its error rate threshold surpasses that of routine ZNE. Furthermore, for full density matrix information, the pZNE method is more efficient than the routine ZNE.

quant-ph↗

Probing spin hydrodynamics on a superconducting quantum simulator

Characterizing the nature of hydrodynamical transport properties in quantum dynamics provides valuable insights into the fundamental understanding of exotic non-equilibrium phases of matter. Experimentally simulating infinite-temperature transport on large-scale complex quantum systems is of considerable interest. Here, using a controllable and coherent superconducting quantum simulator, we experimentally realize the analog quantum circuit, which can efficiently prepare the Haar-random states, and probe spin transport at infinite temperature. We observe diffusive spin transport during the unitary evolution of the ladder-type quantum simulator with ergodic dynamics. Moreover, we explore the transport properties of the systems subjected to strong disorder or a tilted potential, revealing signatures of anomalous subdiffusion in accompany with the breakdown of thermalization. Our work demonstrates a scalable method of probing infinite-temperature spin transport on analog quantum simulators, which paves the way to study other intriguing out-of-equilibrium phenomena from the perspective of transport.

quant-ph↗

Graphical vs. Deep Generative Models: Measuring the Impact of Differentially Private Mechanisms and Budgets on Utility

Generative models trained with Differential Privacy (DP) can produce synthetic data while reducing privacy risks. However, navigating their privacy-utility tradeoffs makes finding the best models for specific settings/tasks challenging. This paper bridges this gap by profiling how DP generative models for tabular data distribute privacy budgets across rows and columns, which is one of the primary sources of utility degradation. We compare graphical and deep generative models, focusing on the key factors contributing to how privacy budgets are spent, i.e., underlying modeling techniques, DP mechanisms, and data dimensionality. Through our measurement study, we shed light on the characteristics that make different models suitable for various settings and tasks. For instance, we find that graphical models distribute privacy budgets horizontally and thus cannot handle relatively wide datasets for a fixed training time; also, the performance on the task they were optimized for monotonically increases with more data but could also overfit. Deep generative models spend their budgets per iteration, so their behavior is less predictable with varying dataset dimensions, but are more flexible as they could perform better if trained on more features. Moreover, low levels of privacy ($ε\geq100$) could help some models generalize, achieving better results than without applying DP. We believe our work will aid the deployment of DP synthetic data techniques by navigating through the best candidate models vis-a-vis the dataset features, desired privacy levels, and downstream tasks.

cs.LG↗

A Riemann-Hilbert approach to the two-component modified Camassa-Holm equation

In this paper, we develop a Riemann-Hilbert (RH) approach to the Cauchy problem for the two-component modified Camassa-Holm (2-mCH) equation based on its Lax pair. Further via a series of deformations to the RH problem by using the $\bar{\partial}$-generalization of Deift-Zhou steepest descent method, we obtain the long-time asymptotic approximations to the solutions of the 2-mCH equation in four kinds of space-time regions. Especially we introduce a technique to unify multi-jump matrix factorizations into one form which can greatly simplify the calculation of the $\bar{\partial}$-steepest descent method.

math-ph↗

Urban context and delivery performance: Modelling service time for cargo bikes and vans across diverse urban environments

Light goods vehicles (LGV) used extensively in the last mile of delivery are one of the leading polluters in cities. Cargo-bike logistics and Light Electric Vehicles (LEVs) have been put forward as a high impact candidate for replacing LGVs. Studies have estimated over half of urban van deliveries being replaceable by cargo-bikes, due to their faster speeds, shorter parking times and more efficient routes across cities. However, the logistics sector suffers from a lack of publicly available data, particularly pertaining to cargo-bike deliveries, thus limiting the understanding of their potential benefits. Specifically, service time (which includes cruising for parking, and walking to destination) is a major, but often overlooked component of delivery time modelling. The aim of this study is to establish a framework for measuring the performance of delivery vehicles, with an initial focus on modelling service times of vans and cargo-bikes across diverse urban environments. We introduce two datasets that allow for in-depth analysis and modelling of service times of cargo bikes and use existing datasets to reason about differences in delivery performance across vehicle types. We introduce a modelling framework to predict the service times of deliveries based on urban context. We employ Uber's H3 index to divide cities into hexagonal cells and aggregate OpenStreetMap tags for each cell, providing a detailed assessment of urban context. Leveraging this spatial grid, we use GeoVex to represent micro-regions as points in a continuous vector space, which then serve as input for predicting vehicle service times. We show that geospatial embeddings can effectively capture urban contexts and facilitate generalizations to new contexts and cities. Our methodology addresses the challenge of limited comparative data available for different vehicle types within the same urban settings.

cs.CY↗

Ensemble Predicate Decoding for Unbiased Scene Graph Generation

Scene Graph Generation (SGG) aims to generate a comprehensive graphical representation that accurately captures the semantic information of a given scenario. However, the SGG model's performance in predicting more fine-grained predicates is hindered by a significant predicate bias. According to existing works, the long-tail distribution of predicates in training data results in the biased scene graph. However, the semantic overlap between predicate categories makes predicate prediction difficult, and there is a significant difference in the sample size of semantically similar predicates, making the predicate prediction more difficult. Therefore, higher requirements are placed on the discriminative ability of the model. In order to address this problem, this paper proposes Ensemble Predicate Decoding (EPD), which employs multiple decoders to attain unbiased scene graph generation. Two auxiliary decoders trained on lower-frequency predicates are used to improve the discriminative ability of the model. Extensive experiments are conducted on the VG, and the experiment results show that EPD enhances the model's representation capability for predicates. In addition, we find that our approach ensures a relatively superior predictive capability for more frequent predicates compared to previous unbiased SGG methods.

cs.CV↗

vitaLITy 2: Reviewing Academic Literature Using Large Language Models

Academic literature reviews have traditionally relied on techniques such as keyword searches and accumulation of relevant back-references, using databases like Google Scholar or IEEEXplore. However, both the precision and accuracy of these search techniques is limited by the presence or absence of specific keywords, making literature review akin to searching for needles in a haystack. We present vitaLITy 2, a solution that uses a Large Language Model or LLM-based approach to identify semantically relevant literature in a textual embedding space. We include a corpus of 66,692 papers from 1970-2023 which are searchable through text embeddings created by three language models. vitaLITy 2 contributes a novel Retrieval Augmented Generation (RAG) architecture and can be interacted with through an LLM with augmented prompts, including summarization of a collection of papers. vitaLITy 2 also provides a chat interface that allow users to perform complex queries without learning any new programming language. This also enables users to take advantage of the knowledge captured in the LLM from its enormous training corpus. Finally, we demonstrate the applicability of vitaLITy 2 through two usage scenarios. vitaLITy 2 is available as open-source software at https://vitality-vis.github.io.

cs.HC↗

Learning High-Frequency Functions Made Easy with Sinusoidal Positional Encoding

Fourier features based positional encoding (PE) is commonly used in machine learning tasks that involve learning high-frequency features from low-dimensional inputs, such as 3D view synthesis and time series regression with neural tangent kernels. Despite their effectiveness, existing PEs require manual, empirical adjustment of crucial hyperparameters, specifically the Fourier features, tailored to each unique task. Further, PEs face challenges in efficiently learning high-frequency functions, particularly in tasks with limited data. In this paper, we introduce sinusoidal PE (SPE), designed to efficiently learn adaptive frequency features closely aligned with the true underlying function. Our experiments demonstrate that SPE, without hyperparameter tuning, consistently achieves enhanced fidelity and faster training across various tasks, including 3D view synthesis, Text-to-Speech generation, and 1D regression. SPE is implemented as a direct replacement for existing PEs. Its plug-and-play nature lets numerous tasks easily adopt and benefit from SPE.

cs.LG↗

Recovery of damaged information via scrambling in indefinite casual order

Scrambling prevents the access to local information with local operators and therefore can be used to protect quantum information from damage caused by local perturbations. Even though partial quantum information can be recovered if the type of the damage is known, the initial target state cannot be completely recovered, because the obtained state is a mixture of the initial state and a maximally mixed state. Here, we demonstrate an improved scheme to recover damaged quantum information via scrambling in indefinite causal order. We show that scheme with indefinite causal order can record information of the damage and distill the initial state from the damaged state simultaneously. It allows us to retrieve initial information versus any damage. Moreover, by iterating the schemes, the initial quantum state can be completely recovered. In addition, we experimentally demonstrate our schemes on the cloud-based quantum computer, named as Quafu. Our work proposes a feasible scheme to protect whole quantum information from damage, which is also compatible with other techniques such as quantum error corrections and entanglement purification protocols. We expect that our scheme will be useful in the both quantum information recovery from the damage and systems bench-marking.

quant-ph↗

InterFusion: Text-Driven Generation of 3D Human-Object Interaction

In this study, we tackle the complex task of generating 3D human-object interactions (HOI) from textual descriptions in a zero-shot text-to-3D manner. We identify and address two key challenges: the unsatisfactory outcomes of direct text-to-3D methods in HOI, largely due to the lack of paired text-interaction data, and the inherent difficulties in simultaneously generating multiple concepts with complex spatial relationships. To effectively address these issues, we present InterFusion, a two-stage framework specifically designed for HOI generation. InterFusion involves human pose estimations derived from text as geometric priors, which simplifies the text-to-3D conversion process and introduces additional constraints for accurate object generation. At the first stage, InterFusion extracts 3D human poses from a synthesized image dataset depicting a wide range of interactions, subsequently mapping these poses to interaction descriptions. The second stage of InterFusion capitalizes on the latest developments in text-to-3D generation, enabling the production of realistic and high-quality 3D HOI scenes. This is achieved through a local-global optimization process, where the generation of human body and object is optimized separately, and jointly refined with a global optimization of the entire scene, ensuring a seamless and contextually coherent integration. Our experimental results affirm that InterFusion significantly outperforms existing state-of-the-art methods in 3D HOI generation.

cs.CV↗

Parametric Primitive Analysis of CAD Sketches with Vision Transformer

The design and analysis of Computer-Aided Design (CAD) sketches play a crucial role in industrial product design, primarily involving CAD primitives and their inter-primitive constraints. To address challenges related to error accumulation in autoregressive models and the complexities associated with self-supervised model design for this task, we propose a two-stage network framework. This framework consists of a primitive network and a constraint network, transforming the sketch analysis task into a set prediction problem to enhance the effective handling of primitives and constraints. By decoupling target types from parameters, the model gains increased flexibility and optimization while reducing complexity. Additionally, the constraint network incorporates a pointer module to explicitly indicate the relationship between constraint parameters and primitive indices, enhancing interpretability and performance. Qualitative and quantitative analyses on two publicly available datasets demonstrate the superiority of this method.

cs.CV↗