Researcher profile

Ting Gao

Ting Gao contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
18works
0followers
10topics
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

18 published item(s)

preprint2026arXiv

Kalman Filtering on Cell Complexes

Inferring latent dynamics from multivariate time-series defined over topological cell complexes is crucial for capturing the complex, higher-order interactions inherent in real-world systems such as in water, sensor, and transportation networks. However, reconstructing these latent states is challenging because the signals are coupled across higher-order topologies, while high dimensionality, nonlinear observations, and unknown structures increase the difficulty. To address this, we propose a topology-aware state space framework derived from stochastic partial differential equations on cell complexes. State evolution follows heat-like topological diffusion, with perturbations propagating along boundary operators. Under partial observability, we model observations using a cell complex convolution of latent states coupled with a nonlinear mapping. We perform recursive state estimation via an Extended Kalman Filter, simultaneously learning model parameters and uncertainties through an online Expectation-Maximization algorithm. Finally, for scenarios where only lower-order topological structure is known, e.g., nodes and edges, as in critical infrastructure networks, we introduce a heuristic cell identification algorithm to explicitly infer the second-order cell structures. Validations on synthetic and real datasets from water, sensor and transportation networks demonstrate that our approach yields reliable estimates under partial observability and successfully recovers the underlying topological structures.

preprint2025arXiv

Enhancing the charging performance of an atomic quantum battery

We study a quantum battery (QB) model composed of two atoms, where the charger and battery elements are coupled to a multimode vacuum field that serves as a mediator for energy transfer. Different figures of merit such as ergotropy, charging time, and charging efficiency are analyzed, putting emphasis on the role of various control parameters on the charging performance. It is found that there is a range of angle between the transition dipole moments and interatomic axis in which the QB can be charged. The optimal charging performance is achieved if the atomic dipole moments are perpendicular or parallel to the interatomic axis. The charging performance also improves with the decrease of the interatomic distance. Besides, the charged ergotropy can be enhanced by increasing the initial ergotropy of the charger and it is beneficial to charge the QB starting from a passive state.

preprint2024arXiv

Fourier neural operator based fluid-structure interaction for predicting the vesicle dynamics

Solving complex fluid-structure interaction (FSI) problems, characterized by nonlinear partial differential equations, is crucial in various scientific and engineering applications. Traditional computational fluid dynamics (CFD) solvers are insufficient to meet the growing requirements for large-scale and long-period simulations. Fortunately, the rapid advancement in neural networks, especially neural operator learning mappings between function spaces, has introduced novel approaches to tackle these challenges via data-driven modeling. In this paper, we propose a Fourier neural operator-based fluid-structure interaction solver (FNO-based FSI solver) for efficient simulation of FSI problems, where the solid solver based on the finite difference method is seamlessly integrated with the Fourier neural operator to predict incompressible flow using the immersed boundary method. We analyze the performance of the FNO-based FSI solver in the following three situations: training data with or without the steady state, training method with one-step label or multi-step labels, and prediction in interpolation or extrapolation. We find that the best performance for interpolation is achieved by training the operator with multi-step labels using steady-state data. Finally, we train the FNO-based FSI solver using this optimal training method and apply it to vesicle dynamics. The results show that the FNO-based FSI solver is capable of capturing the variations in the fluid and the vesicle.

preprint2023arXiv

Learning effective dynamics from data-driven stochastic systems

Multiscale stochastic dynamical systems have been widely adopted to a variety of scientific and engineering problems due to their capability of depicting complex phenomena in many real world applications. This work is devoted to investigating the effective dynamics for slow-fast stochastic dynamical systems. Given observation data on a short-term period satisfying some unknown slow-fast stochastic systems, we propose a novel algorithm including a neural network called Auto-SDE to learn invariant slow manifold. Our approach captures the evolutionary nature of a series of time-dependent autoencoder neural networks with the loss constructed from a discretized stochastic differential equation. Our algorithm is also validated to be accurate, stable and effective through numerical experiments under various evaluation metrics.

preprint2022arXiv

An end-to-end deep learning approach for extracting stochastic dynamical systems with $α$-stable Lévy noise

Recently, extracting data-driven governing laws of dynamical systems through deep learning frameworks has gained a lot of attention in various fields. Moreover, a growing amount of research work tends to transfer deterministic dynamical systems to stochastic dynamical systems, especially those driven by non-Gaussian multiplicative noise. However, lots of log-likelihood based algorithms that work well for Gaussian cases cannot be directly extended to non-Gaussian scenarios which could have high error and low convergence issues. In this work, we overcome some of these challenges and identify stochastic dynamical systems driven by $α$-stable Lévy noise from only random pairwise data. Our innovations include: (1) designing a deep learning approach to learn both drift and diffusion coefficients for Lévy induced noise with $α$ across all values, (2) learning complex multiplicative noise without restrictions on small noise intensity, (3) proposing an end-to-end complete framework for stochastic systems identification under a general input data assumption, that is, $α$-stable random variable. Finally, numerical experiments and comparisons with the non-local Kramers-Moyal formulas with moment generating function confirm the effectiveness of our method.

preprint2022arXiv

Improved indirect limits on charm and bottom quark EDMs

We derive indirect limits on the charm and bottom quark electric dipole moments (EDMs) from paramagnetic AMO and neutron EDM experiments. The charm and bottom quark EDMs generate $CP$-odd photon-gluon operators and light quark EDMs at the $c$- and $b$-quark mass thresholds. These $CP$-odd operators induce the $CP$-odd semi-leptonic operator $C_S$ and the neutron EDM below the QCD scale that are probed by the paramagnetic and neutron EDM experiments, respectively. The bound from $C_S$ is $\vert d_c \vert < 1.3\times 10^{-20}\,e\,\mathrm{cm}$ for the charm quark and $\vert d_b \vert < 7.6\times 10^{-19}\,e\,\mathrm{cm}$ for the bottom quark, with its uncertainty estimated as 10%. The neutron EDM provides a stronger bound, $\vert d_c \vert < 6\times 10^{-22}\,e\,\mathrm{cm}$ and $\vert d_b \vert < 2\times 10^{-20}\,e\,\mathrm{cm}$, though with a larger hadronic uncertainty.

preprint2022arXiv

Improved indirect limits on muon EDM

Given current discrepancy in muon $g-2$ and future dedicated efforts to measure muon electric dipole moment (EDM) $d_μ$, we assess the indirect constraints imposed on $d_μ$ by the EDM measurements performed with heavy atoms and molecules. We notice that the dominant muon EDM effect arises via the muon-loop induced &#34;light-by-light&#34; $CP$-odd amplitude $\propto{\bf B}{\bf E}^3$, and in the vicinity of a large nucleus the corresponding parameter of expansion can be significant, $eE_{\rm nucl}/m_μ^2 \sim 0.04$. We compute the $d_μ$-induced Schiff moment of the $^{199}$Hg nucleus, and the linear combination of $d_e$ and semileptonic $C_S$ operator (dominant in this case) that determine the $CP$-odd effects in ThO molecule. The results, $d_μ(^{199}{\rm Hg}) < 6\times 10^{-20}e$cm and $d_μ({\rm ThO}) < 2\times 10^{-20}e$cm, constitute approximately three- and nine-fold improvements over the limits on $d_μ$ extracted from the BNL muon beam experiment.

preprint2022arXiv

Learning the temporal evolution of multivariate densities via normalizing flows

In this work, we propose a method to learn multivariate probability distributions using sample path data from stochastic differential equations. Specifically, we consider temporally evolving probability distributions (e.g., those produced by integrating local or nonlocal Fokker-Planck equations). We analyze this evolution through machine learning assisted construction of a time-dependent mapping that takes a reference distribution (say, a Gaussian) to each and every instance of our evolving distribution. If the reference distribution is the initial condition of a Fokker-Planck equation, what we learn is the time-T map of the corresponding solution. Specifically, the learned map is a multivariate normalizing flow that deforms the support of the reference density to the support of each and every density snapshot in time. We demonstrate that this approach can approximate probability density function evolutions in time from observed sampled data for systems driven by both Brownian and Lévy noise. We present examples with two- and three-dimensional, uni- and multimodal distributions to validate the method.

preprint2022arXiv

Quantum properties in the four-node network

There are different preparable quantum states in different network structures. The four nodes as a whole has two situations: one is the four nodes in a plane, the other is the four nodes in the space. In this paper, we obtain some properties of the quantum states that can be prepared in four-node network structures. These include the properties of entropy, entanglement measure, rank and multipartite entangled states. These properties also mean that the network structures impose some constraints on the states that can be prepared in a four-node quantum network. In order to obtain these properties we also define $n$-partite mutual information of the quantum system, which satisfies symmetry requirement.

preprint2022arXiv

Stock Trading Optimization through Model-based Reinforcement Learning with Resistance Support Relative Strength

Reinforcement learning (RL) is gaining attention by more and more researchers in quantitative finance as the agent-environment interaction framework is aligned with decision making process in many business problems. Most of the current financial applications using RL algorithms are based on model-free method, which still faces stability and adaptivity challenges. As lots of cutting-edge model-based reinforcement learning (MBRL) algorithms mature in applications such as video games or robotics, we design a new approach that leverages resistance and support (RS) level as regularization terms for action in MBRL, to improve the algorithm&#39;s efficiency and stability. From the experiment results, we can see RS level, as a market timing technique, enhances the performance of pure MBRL models in terms of various measurements and obtains better profit gain with less riskiness. Besides, our proposed method even resists big drop (less maximum drawdown) during COVID-19 pandemic period when the financial market got unpredictable crisis. Explanations on why control of resistance and support level can boost MBRL is also investigated through numerical experiments, such as loss of actor-critic network and prediction error of the transition dynamical model. It shows that RS indicators indeed help the MBRL algorithms to converge faster at early stage and obtain smaller critic loss as training episodes increase.

preprint2021arXiv

Detection of multipartite entanglement via quantum Fisher information

In this paper, we focus on two different kinds of multipartite correlation, $k$-nonseparability and $k$-partite entanglement, both of which can describe the essential characteristics of multipartite entanglement. We propose effective methods to detect $k$-nonseparability and $k$-partite entanglement in terms of quantum Fisher information. We illustrate the significance of our results and show that they identify some $k$-nonseparability and $k$-partite entanglement that cannot be identified by known criteria by several concrete examples.

preprint2021arXiv

Detection of the quantum states containing at most $k-1$ unentangled particles

There are many different classifications of entanglement for multipartite quantum systems, one of which is based on the number of unentangled particles. In this paper, we mainly study the quantum states containing at most $k-1$ unentangled particles and provide several entanglement criteria based on different forms of inequalities which can both identify quantum states containing at most $k-1$ unentangled particles. We show that these criteria are more effective for some states by concrete examples.

preprint2020arXiv

Monogamy of Logarithmic Negativity and Logarithmic Convex-Roof Extended Negativity

One of the fundamental traits of quantum entanglement is the restricted shareability among multipartite quantum systems, namely monogamy of entanglement, while it is well known that monogamy inequalities are always satisfied by entanglement measures with convexity. Here we present a measure of entanglement, logarithmic convex-roof extended negativity (LCREN) satisfying important characteristics of an entanglement measure, and investigate the monogamy relation for logarithmic negativity and LCREN both without convexity. We show exactly that the $α$th power of logarithmic negativity, and a newly defined good measure of entanglement, LCREN, obey a class of general monogamy inequalities in multiqubit systems, $2\otimes2\otimes3$ systems and $2\otimes2\otimes2^{n}$ systems for $α\geq4\ln2$. We provide a class of general polygamy inequalities of multiqubit systems in terms of logarithmic convex-roof extended negativity of assistance (LCRENoA) for $0\leqβ\leq2$. Given that the logarithmic negativity and LCREN are not convex these results are surprising. Using the power of the logarithmic negativity and LCREN, we further establish a class of tight monogamy inequalities of multiqubit systems, $2\otimes2\otimes3$ systems and $2\otimes2\otimes2^{n}$ systems in terms of the $α$th power of logarithmic negativity and LCREN for $α\geq4\ln2$. We also show that the $β$th power of LCRENoA obeys a class of tight polygamy inequalities of multiqubit systems for $0\leqβ\leq2$.

preprint2020arXiv

Relations among $k$-ME concurrence, negativity, polynomial invariants, and tangle

The $k$-ME concurrence as a measure of multipartite entanglement (ME) unambiguously detects all $k$-nonseparable states in arbitrary dimensions, and satisfies many important properties of an entanglement measure. Negativity is a simple computable bipartite entanglement measure. Invariant and tangle are useful tools to study the properties of the quantum states. In this paper we mainly investigate the internal relations among the $k$-ME concurrence, negativity, polynomial invariants, and tangle. Strong links between $k$-ME concurrence and negativity as well as between $k$-ME concurrence and polynomial invariants are derived. We obtain the quantitative relation between $k$-ME ($k$=$n$) concurrence and negativity for all $n$-qubit states, give a exact value of the $n$-ME concurrence for the mixture of $n$-qubit GHZ states and white noise, and derive an connection between $k$-ME concurrence and tangle for $n$-qubit W state. Moreover, we find that for any $3$-qubit pure state the $k$-ME concurrence ($k$=2, 3) is related to negativity, tangle and polynomial invariants, while for $4$-qubit states the relations between $k$-ME concurrence (for $k$=2, 4) and negativity, and between $k$-ME concurrence and polynomial invariants also exist. Our work provides clear quantitative connections between $k$-ME concurrence and negativity, and between $k$-ME concurrence and polynomial invariants.

preprint2017arXiv

On four-photon entanglement from parametric down-conversion process

We propose two schemes to generate four-photon polarization-entangled states from the second-order emission of the spontaneous parametric down-conversion process. By using linear optical elements and the coincidence-detection, the four indistinguishable photons emitted from parametric down-conversion source result in the Greenberger-Horne-Zeilinger (GHZ) state or the superposition of two orthogonal GHZ states. For this superposition state, under particular phase settings we analyze the quantum correlation function and the local hidden variable (LHV) correlation. As a result, the Bell inequality derived from the LHV correlation is violated with the visibility larger than 0.442. It means that the present four-photon entangled state is therefore suitable for testing the LHV theory.

preprint2017arXiv

Qubit-loss-free fusion of W states employing weak cross-Kerr nonlinearities

With the assistance of weak cross-Kerr nonlinearities, we introduce an optical scheme to fuse two small-size polarization entangled W states into a large-scale W state without qubit loss, i.e.,$\mathrm{W}_{n+m}$ state can be generated from an $n$-qubit W state and a $m$-qubit W state. To complete the fusion task, two polarization entanglement processes and one spatial entanglement process are applied. The fulfillments of the above processes are contributed by a cross-Kerr nonlinear interaction between the signal photons and a coherent state via Kerr media. We analyze the resource cost and the success probability of the scheme. There is no complete failure output in our fusion mechanism, and all the garbage states are recyclable. In addition, there is no need for any controlled quantum gate and any ancillary photon, so it is simple and feasible under the current experiment technology.

preprint2017arXiv

Scalable symmetry detector and its applications by using beam splitters and weak nonlinearities

We describe a method to detect twin-beam multiphoton entanglement based on a beam splitter and weak nonlinearities. For the twin-beam four-photon entanglement, we explore a symmetry detector. It works not only for collecting two-pair entangled states directly from the spontaneous parametric down-conversion process, but also for purifying them by cascading these symmetry detectors. Surprisingly, by calculating the iterative coefficient and the success probability we show that with a few iterations the desired two-pair can be obtained from a class of four-photon entangled states. We then generalize the symmetry detector to $n$-pair emissions and show that it is capable of determining the number of the pairs emitted indistinguishably from the spontaneous parametric down-conversion source, which may contribute to explore multipair entanglement with a large number of photons.