BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Qin Li

Qin Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
math.NANumerical Analysismath.APMachine Learningmath-phmath.MPmath.OCmath.QAastro-ph.SRCryptography and Securityhep-thmath.DGphysics.flu-dynphysics.soc-phquant-phastro-ph.IMCell BehaviorComputation and LanguageComputational Engineering, Finance, and ScienceComputer Visioneess.ASeess.SYFormal Languages and Automata Theorymath.AGmath.CVmath.PRphysics.comp-phphysics.plasm-phPopulations and EvolutionSocial and Information NetworksSoundSystems and Control

Trust snapshot

Quick read

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

28 published item(s)

preprint2026arXiv

Comparative study of equilibrium and non-equilibrium predictions by different models for a hypersonic cone at high-altitude

Targeting a cone with the half-angle as 10-deg at M = 27 and H = 72 km, simulations were conducted comparatively to analyze the predictions by different equilibrium and non-equilibrium gas models. Following validation and grid studies, systematic comparisons on aerodynamic performance, flow structures, and characteristic distributions were performed. The key findings are: (1) While the overall flow structures are broadly similar, discrepancies exist in the features at the base locations, e.g., the diverse high-temperature distributions. Notably, the vibrational temperatures distribute differently under slip and non-slip boundary conditions near the wall; (2) The equilibrium gas model predicts higher drag coefficient, wall heat flux, and skin friction than those of non-equilibrium models. Predictions also vary among the non-equilibrium models themselves. Specifically, compared to the three-temperature model, the one- and two-temperature models predict larger drag coefficients with the relative difference exceeding 5%. Nevertheless, the results from the three-temperature model with and without slip conditions are largely consistent; (3) The disparities between equilibrium and non-equilibrium characteristics are primarily manifested in the shock layer and wake regions. Within these regions, the overall temperature for the equilibrium gas is lower than that for the non-equilibrium cases, while in the latter specific non-equilibrium features are distinctly exhibited, e.g., the translational-rotational temperature is generally higher than that from the one-temperature model, and the vibrational-electronic temperature shows the opposite trend. Notably, in the slip flow within the three-temperature model, the translational-rotational temperature is higher and, particularly, the vibrational temperature is even larger than counterparts of the non-slip flows near the wall and base center line.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Data selection: at the interface of PDE-based inverse problem and randomized linear algebra

All inverse problems rely on data to recover unknown parameters, yet not all data are equally informative. This raises the central question of data selection. A distinctive challenge in PDE-based inverse problems is their inherently infinite-dimensional nature: both the parameter space and the design space are infinite, which greatly complicates the selection process. Somewhat unexpectedly, randomized numerical linear algebra (RNLA), originally developed in very different contexts, has provided powerful tools for addressing this challenge. These methods are inherently probabilistic, with guarantees typically stating that information is preserved with probability at least 1-p when using N randomly selected, weighted samples. Here, the notion of "information" can take different mathematical forms depending on the setting. In this review, we survey the problem of data selection in PDE-based inverse problems, emphasize its unique infinite-dimensional aspects, and highlight how RNLA strategies have been adapted and applied in this context.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Modeling Epidemic Dynamics of Mutant Strains with Evolutionary Game-based Vaccination Behavior

The outbreak of mutant strains and vaccination behaviors have been the focus of recent epidemiological research, but most existing epidemic models failed to simultaneously capture viral mutation and consider the complexity and behavioral dynamics of vaccination. To address this gap, we develop an extended SIRS model that distinguishes infections with the original strain and a mutant strain, and explicitly introduces a vaccinated compartment state. At the behavioral level, we employ evolutionary game theory to model individual vaccination decisions, where strategies are determined by both neighbors' choices and the current epidemiological situation. This process corresponds to the time-varying vaccination rate of susceptible individuals transitioning to vaccinated individuals at the epidemic spreading level. We then couple the epidemic and vaccination behavioral processes through the microscopic Markov chain approach (MMCA) and finally investigate the evolutionary dynamics via numerical simulations. The results show that our framework can effectively mitigate outbreaks across different disease scenarios. Sensitivity analysis further reveals that vaccination uptake is most strongly influenced by vaccine cost, efficacy, and perceived risk of side effects. Overall, this behavior-aware modeling framework captures the co-evolution of viral mutation and vaccination behavior, providing quantitative and theoretical support for designing effective public health vaccination policies.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Provable imitation learning for control of instability in partially-observed Vlasov--Poisson equations

We consider the stabilization of Vlasov--Poisson plasma dynamics, a central control problem in nuclear fusion. Our focus is the gap between what an ideal controller would use and what experiments can actually observe: while optimal policy may rely on the full phase-space state, practical feedback is typically limited to sparse macroscopic diagnostics. We therefore study imitation learning methods that distill a fully observed expert policy into controllers operating only on macroscopic measurements. We show the stability guarantees of the learned policy, where the error floor depends on the minimal behavior cloning loss achievable under the observation constraints. We further characterize this minimal loss in terms of a notion of entropy that quantifies the complexity of the initial distribution. Our results demonstrates the theoretical feasibility of learning stabilizing feedback policies for kinetic plasma dynamics from macroscopic observations, and exhibits the adaptivity of the learning approach to low-complexity structures. Through extensive numerical experiments, we validate our theory and show that the learned policies can stabilize the system using only macroscopic observations, within a significantly longer time horizon than non-adaptive baseline controllers.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Stability of the reconstruction of the heat reflection coefficient in the phonon transport equation

The reflection coefficient is an important thermal property of materials, especially at the nanoscale, and determining this property requires solving an inverse problem based on macroscopic temperature measurements. In this manuscript, we investigate the stability of this inverse problem to infer the reflection coefficient in the phonon transport equation. We show that the problem becomes ill-posed as the system transitions from the ballistic to the diffusive regime, characterized by the Knudsen number converging to zero. Such a stability estimate clarifies the discrepancy observed in previous studies on the well-posedness of this inverse problem. Furthermore, we quantify the rate at which the stability deteriorates with respect to the Knudsen number and confirm the theoretical result with numerical evidence.

0 citations0 reviewsNo code linkedOpen access
preprint2024arXiv

Reconstructing the kinetic chemotaxis kernel using macroscopic data: well-posedness and ill-posedness

Bacterial motion is steered by external stimuli (chemotaxis), and the motion described on the mesoscopic scale is uniquely determined by a parameter $K$ that models velocity change response from the bacteria. This parameter is called chemotaxis kernel. In a practical setting, it is inferred by experimental data. We deploy a PDE-constrained optimization framework to perform this reconstruction using velocity-averaged, localized data taken in the interior of the domain. The problem can be well-posed or ill-posed depending on the data preparation and the experimental setup. In particular, we propose one specific design that guarantees numerical reconstructability and local convergence. This design is adapted to the discretization of $K$ in space and decouples the reconstruction of local values of $K$ into smaller cell problems, opening up parallelization opportunities. Numerical evidences support the theoretical findings.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

High-frequency limit of the inverse scattering problem: asymptotic convergence from inverse Helmholtz to inverse Liouville

We investigate the asymptotic relation between the inverse problems relying on the Helmholtz equation and the radiative transfer equation (RTE) as physical models, in the high-frequency limit. In particular, we evaluate the asymptotic convergence of a generalized version of inverse scattering problem based on the Helmholtz equation, to the inverse scattering problem of the Liouville equation (a simplified version of RTE). The two inverse problems are connected through the Wigner transform that translates the wave-type description on the physical space to the kinetic-type description on the phase space, and the Husimi transform that models data localized both in location and direction. The finding suggests that impinging tightly concentrated monochromatic beams can indeed provide stable reconstruction of the medium, asymptotically in the high-frequency regime. This fact stands in contrast with the unstable reconstruction for the classical inverse scattering problem when the probing signals are plane-waves.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Improvements to enhance robustness of third-order scale-independent WENO-Z schemes

Although there are many improvements to WENO3-Z that target the achievement of optimal order in the occurrence of the first-order critical point (CP1), they mainly address resolution performance, while the robustness of schemes is of less concern and lacks understanding accordingly. In light of our analysis considering the occurrence of critical points within grid intervals, we theoretically prove that it is impossible for a scale-independent scheme that has the stencil of WENO3-Z to fulfill the above order achievement, and current scale-dependent improvements barely fulfill the job when CP1 occurs at the middle of the grid cell. In order to achieve scale-independent improvements, we devise new smoothness indicators that increase the error order from 2 to 4 when CP1 occurs and perform more stably. Meanwhile, we construct a new global smoothness indicator that increases the error order from 4 to 5 similarly, through which new nonlinear weights with regard to WENO3-Z are derived and new scale-independents improvements, namely WENO-ZES2 and -ZES3, are acquired. Through 1D scalar and Euler tests, as well as 2D computations, in comparison with typical scale-dependent improvement, the following performances of the proposed schemes are demonstrated: The schemes can achieve third-order accuracy at CP1 no matter its location in the stencil, indicate high resolution in resolving flow subtleties, and manifest strong robustness in hypersonic simulations (e.g., the accomplishment of computations on hypersonic half-cylinder flow with Mach numbers reaching 16 and 19, respectively, as well as essentially non-oscillatory solutions of inviscid sharp double cone flow at M=9.59), which contrasts the comparative WENO3-Z improvement.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Kapranov's $L_\infty$ structures, Fedosov's star products, and one-loop exact BV quantizations on Kähler manifolds

We study quantization schemes on a Kähler manifold and relate several interesting structures. We first construct Fedosov's star products on a Kähler manifold $X$ as quantizations of Kapranov's $L_\infty$-algebra structure. Then we investigate the Batalin-Vilkovisky (BV) quantizations associated to these star products. A remarkable feature is that they are all one-loop exact, meaning that the Feynman weights associated to graphs with two or more loops all vanish. This leads to a succinct cochain level formula in de Rham cohomology for the algebraic index.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Low-rank approximation for multiscale PDEs

Historically, analysis for multiscale PDEs is largely unified while numerical schemes tend to be equation-specific. In this paper, we propose a unified framework for computing multiscale problems through random sampling. This is achieved by incorporating randomized SVD solvers and manifold learning techniques to numerically reconstruct the low-rank features of multiscale PDEs. We use multiscale radiative transfer equation and elliptic equation with rough media to showcase the application of this framework.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Predicting Solar Energetic Particles Using SDO/HMI Vector Magnetic Data Products and a Bidirectional LSTM Network

Solar energetic particles (SEPs) are an essential source of space radiation, which are hazards for humans in space, spacecraft, and technology in general. In this paper we propose a deep learning method, specifically a bidirectional long short-term memory (biLSTM) network, to predict if an active region (AR) would produce an SEP event given that (i) the AR will produce an M- or X-class flare and a coronal mass ejection (CME) associated with the flare, or (ii) the AR will produce an M- or X-class flare regardless of whether or not the flare is associated with a CME. The data samples used in this study are collected from the Geostationary Operational Environmental Satellite's X-ray flare catalogs provided by the National Centers for Environmental Information. We select M- and X-class flares with identified ARs in the catalogs for the period between 2010 and 2021, and find the associations of flares, CMEs and SEPs in the Space Weather Database of Notifications, Knowledge, Information during the same period. Each data sample contains physical parameters collected from the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory. Experimental results based on different performance metrics demonstrate that the proposed biLSTM network is better than related machine learning algorithms for the two SEP prediction tasks studied here. We also discuss extensions of our approach for probabilistic forecasting and calibration with empirical evaluation.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Classical limit for the varying-mass Schrödinger equation with random inhomogeneities

The varying-mass Schrödinger equation (VMSE) has been successfully applied to model electronic properties of semiconductor hetero-structures, for example, quantum dots and quantum wells. In this paper, we consider VMSE with small random heterogeneities, and derive a radiative transfer equation as its asymptotic limit. The main tool is to systematically apply the Wigner transform in the classical regime when the rescaled Planck constant $ε\ll 1$, and expand the Wigner equation to proper orders of $ε$. As a proof of concept, we numerically compute both VMSE and its limiting radiative transfer equation, and show that their solutions agree well in the classical regime.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Cryptanalysis and improvement of a semi-quantum private comparison protocol based on Bell states

Semi-quantum private comparison (SQPC) allows two participants with limited quantum ability to securely compare the equality of their secrets with the help of a semi-dishonest third party (TP). Recently, Jiang proposed a SQPC protocol based on Bell states (Quantum Inf Process 19(6): 180, 2020) and claimed it is secure. In this paper, we present two types of attack on Jiang's SQPC protocol. In the first type of attack, an outside eavesdropper will make participants accept a wrong result. In the second type of attack, a malicious participant will not only make the other participant accept a wrong result, but also learn the secret of the honest participant. Neither type of attack will be detected. In addition, we propose an improved SQPC protocol that can resist these two types of attack.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Improving speech recognition models with small samples for air traffic control systems

In the domain of air traffic control (ATC) systems, efforts to train a practical automatic speech recognition (ASR) model always faces the problem of small training samples since the collection and annotation of speech samples are expert- and domain-dependent task. In this work, a novel training approach based on pretraining and transfer learning is proposed to address this issue, and an improved end-to-end deep learning model is developed to address the specific challenges of ASR in the ATC domain. An unsupervised pretraining strategy is first proposed to learn speech representations from unlabeled samples for a certain dataset. Specifically, a masking strategy is applied to improve the diversity of the sample without losing their general patterns. Subsequently, transfer learning is applied to fine-tune a pretrained or other optimized baseline models to finally achieves the supervised ASR task. By virtue of the common terminology used in the ATC domain, the transfer learning task can be regarded as a sub-domain adaption task, in which the transferred model is optimized using a joint corpus consisting of baseline samples and new transcribed samples from the target dataset. This joint corpus construction strategy enriches the size and diversity of the training samples, which is important for addressing the issue of the small transcribed corpus. In addition, speed perturbation is applied to augment the new transcribed samples to further improve the quality of the speech corpus. Three real ATC datasets are used to validate the proposed ASR model and training strategies. The experimental results demonstrate that the ASR performance is significantly improved on all three datasets, with an absolute character error rate only one-third of that achieved through the supervised training. The applicability of the proposed strategies to other ASR approaches is also validated.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

On developing piecewise rational mapping with fine regulation capability for WENO schemes

On the idea of mapped WENO-JS scheme, properties of mapping methods are analyzed, uncertainties in mapping development are investigated, and new rational mappings are proposed. Based on our former understandings, i.e. mapping at endpoints {0, 1} tending to identity mapping, an integrated Cm,n condition is summarized for function development. Uncertainties, i.e., whether the mapping at endpoints would make mapped scheme behave like WENO or ENO, whether piecewise implementation would entail numerical instability, and whether WENO3-JS could preserve the third-order at first-order critical points by mapping, are analyzed and clarified. A new piecewise rational mapping with sufficient regulation capability is developed afterwards, where the flatness of mapping around the linear weights and its endpoint convergence toward identity mapping can be coordinated explicitly and simultaneously. Hence, the increase of resolution and preservation of stability can be balanced. Especially, concrete mappings are determined for WENO3,5,7-JS. Numerical cases are tested for the new mapped WENO-JS, which regards numerical stability including that in long time computation, resolution and robustness. In purpose of comparison, some recent mappings such as IM by [App. Math. Comput. 232, 2014:453-468], RM by [J. Sci. Comput. 67, 2016:540-580] and AIM by [J. Comput. Phys. 381, 2019:162-188] are chosen; in addition, some recent WENO-Z type scheme are selected also. Proposed new schemes can preserve optimal orders at corresponding critical points, achieve numerical stability and indicate overall comparative advantages regarding accuracy, resolution and robustness.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Semi-classical limit of an inverse problem for the Schrödinger equation

It is a classical derivation that the Wigner equation, derived from the Schrödinger equation that contains the quantum information, converges to the Liouville equation when the rescaled Planck constant $ε\to0$. Since the latter presents the Newton's second law, the process is typically termed the (semi-)classical limit. In this paper, we study the classical limit of an inverse problem for the Schrödinger equation. More specifically, we show that using the initial condition and final state of the Schrödinger equation to reconstruct the potential term, in the classical regime with $ε\to0$, becomes using the initial and final state to reconstruct the potential term in the Liouville equation. This formally bridges an inverse problem in quantum mechanics with an inverse problem in classical mechanics.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A low-rank Schwarz method for radiative transport equation with heterogeneous scattering coefficient

Random sampling has been used to find low-rank structure and to build fast direct solvers for multiscale partial differential equations of various types. In this work, we design an accelerated Schwarz method for radiative transfer equations that makes use of approximate local solution maps constructed offline via a random sampling strategy. Numerical examples demonstrate the accuracy, robustness, and efficiency of the proposed approach.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

An efficient and provably secure arbitrated quantum signature scheme

In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Machine Learning in Heliophysics and Space Weather Forecasting: A White Paper of Findings and Recommendations

The authors of this white paper met on 16-17 January 2020 at the New Jersey Institute of Technology, Newark, NJ, for a 2-day workshop that brought together a group of heliophysicists, data providers, expert modelers, and computer/data scientists. Their objective was to discuss critical developments and prospects of the application of machine and/or deep learning techniques for data analysis, modeling and forecasting in Heliophysics, and to shape a strategy for further developments in the field. The workshop combined a set of plenary sessions featuring invited introductory talks interleaved with a set of open discussion sessions. The outcome of the discussion is encapsulated in this white paper that also features a top-level list of recommendations agreed by participants.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Non-recurrent Traffic Congestion Detection with a Coupled Scalable Bayesian Robust Tensor Factorization Model

Non-recurrent traffic congestion (NRTC) usually brings unexpected delays to commuters. Hence, it is critical to accurately detect and recognize the NRTC in a real-time manner. The advancement of road traffic detectors and loop detectors provides researchers with a large-scale multivariable temporal-spatial traffic data, which allows the deep research on NRTC to be conducted. However, it remains a challenging task to construct an analytical framework through which the natural spatial-temporal structural properties of multivariable traffic information can be effectively represented and exploited to better understand and detect NRTC. In this paper, we present a novel analytical training-free framework based on coupled scalable Bayesian robust tensor factorization (Coupled SBRTF). The framework can couple multivariable traffic data including traffic flow, road speed, and occupancy through sharing a similar or the same sparse structure. And, it naturally captures the high-dimensional spatial-temporal structural properties of traffic data by tensor factorization. With its entries revealing the distribution and magnitude of NRTC, the shared sparse structure of the framework compasses sufficiently abundant information about NRTC. While the low-rank part of the framework, expresses the distribution of general expected traffic condition as an auxiliary product. Experimental results on real-world traffic data show that the proposed method outperforms coupled Bayesian robust principal component analysis (coupled BRPCA), the rank sparsity tensor decomposition (RSTD), and standard normal deviates (SND) in detecting NRTC. The proposed method performs even better when only traffic data in weekdays are utilized, and hence can provide more precise estimation of NRTC for daily commuters.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

On diffusive scaling in acousto-optic imaging

Acousto-optic imaging (AOI) is a hybrid imaging process. By perturbing the to-be-reconstructed tissues with acoustic waves, one introduces the interaction between the acoustic and optical waves, leading to a more stable reconstruction of the optical properties. The mathematical model was described in [25], with the radiative transfer equation serving as the forward model for the optical transport. In this paper we investigate the stability of the reconstruction. In particular, we are interested in how the stability depends on the Knudsen number, Kn, a quantity that measures the intensity of the scattering effect of photon particles in a media. Our analysis shows that as Kn decreases to zero, photons scatter more frequently, and since information is lost, the reconstruction becomes harder. To counter this effect, devices need to be constructed so that laser beam is highly concentrated. We will give a quantitative error bound, and explicitly show that such concentration has an exponential dependence on Kn. Numerical evidence will be provided to verify the proof.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

PAC Model Checking of Black-Box Continuous-Time Dynamical Systems

In this paper we present a novel model checking approach to finite-time safety verification of black-box continuous-time dynamical systems within the framework of probably approximately correct (PAC) learning. The black-box dynamical systems are the ones, for which no model is given but whose states changing continuously through time within a finite time interval can be observed at some discrete time instants for a given input. The new model checking approach is termed as PAC model checking due to incorporation of learned models with correctness guarantees expressed using the terms error probability and confidence. Based on the error probability and confidence level, our approach provides statistically formal guarantees that the time-evolving trajectories of the black-box dynamical system over finite time horizons fall within the range of the learned model plus a bounded interval, contributing to insights on the reachability of the black-box system and thus on the satisfiability of its safety requirements. The learned model together with the bounded interval is obtained by scenario optimization, which boils down to a linear programming problem. Three examples demonstrate the performance of our approach.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Random Sampling and Efficient Algorithms for Multiscale PDEs

We describe a numerical framework that uses random sampling to efficiently capture low-rank local solution spaces of multiscale PDE problems arising in domain decomposition. In contrast to existing techniques, our method does not rely on detailed analytical understanding of specific multiscale PDEs, in particular, their asymptotic limits. We present the application of the framework on two examples --- a linear kinetic equation and an elliptic equation with rough media. On these two examples, this framework achieves the asymptotic preserving property for the kinetic equations and numerical homogenization for the elliptic equations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Security Improvements of Several Basic Quantum Private Query Protocols with O(log N) Communication Complexity

New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O(logN) communication complexity of known protocols for the same task, but achieve several significant improvements in security, especially concerning user privacy. For example, the randomized form of our protocol has a cheat-sensitive property - it allows the user to detect a dishonest database with a nonzero probability, while the phase-encoded private query protocols for the same task do not have such a property. Moreover, when the database performs the computational basis measurement, a particular projective measurement which can cause a significant loss of user privacy in the previous private query protocols with O(logN) communication complexity, at most half of the user privacy could leak to such a database in our protocol, while in the QPQ protocol, the entire user privacy could leak out. In addition, it is proved here that for large N, the user could detect a cheating via the computational basis measurement, with a probability close to 1/2 using O(\sqrt{N}) special queries. Finally, it is shown here, for both forms of our protocol, basic and randomized, how a dishonest database has to act in case it could not learn user's queries.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Structured random sketching for PDE inverse problems

For an overdetermined system $\mathsf{A}\mathsf{x} \approx \mathsf{b}$ with $\mathsf{A}$ and $\mathsf{b}$ given, the least-square (LS) formulation $\min_x \, \|\mathsf{A}\mathsf{x}-\mathsf{b}\|_2$ is often used to find an acceptable solution $\mathsf{x}$. The cost of solving this problem depends on the dimensions of $\mathsf{A}$, which are large in many practical instances. This cost can be reduced by the use of random sketching, in which we choose a matrix $\mathsf{S}$ with fewer rows than $\mathsf{A}$ and $\mathsf{b}$, and solve the sketched LS problem $\min_x \, \|\mathsf{S}(\mathsf{A} \mathsf{x}-\mathsf{b})\|_2$ to obtain an approximate solution to the original LS problem. Significant theoretical and practical progress has been made in the last decade in designing the appropriate structure and distribution for the sketching matrix $\mathsf{S}$. When $\mathsf{A}$ and $\mathsf{b}$ arise from discretizations of a PDE-based inverse problem, tensor structure is often present in $\mathsf{A}$ and $\mathsf{b}$. For reasons of practical efficiency, $\mathsf{S}$ should be designed to have a structure consistent with that of $\mathsf{A}$. Can we claim similar approximation properties for the solution of the sketched LS problem with structured $\mathsf{S}$ as for fully-random $\mathsf{S}$? We give estimates that relate the quality of the solution of the sketched LS problem to the size of the structured sketching matrices, for two different structures. Our results are among the first known for random sketching matrices whose structure is suitable for use in PDE inverse problems.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Applications of Kinetic Tools to Inverse Transport Problems

We show that the inverse problems for a class of kinetic equations can be solved by classical tools in PDE analysis including energy estimates and the celebrated averaging lemma. Using these tools, we give a unified framework for the reconstruction of the absorption coefficient for transport equations in the subcritical and critical regimes. Moreover, we apply this framework to obtain, to the best of our knowledge, the first result in a nonlinear setting. We also extend the result of recovering the scattering coefficient in [14] from 3D to 2D convex domains.

0 citations0 reviewsNo code linkedOpen access
preprint2017arXiv

Batalin-Vilkovisky quantization and the algebraic index

Into a geometric setting, we import the physical interpretation of index theorems via semi-classical analysis in topological quantum field theory. We develop a direct relationship between Fedosov's deformation quantization of a symplectic manifold X and the BV quantization of a one-dimensional sigma model with target X. This model is a quantum field theory of AKSZ type and is quantized rigorously using Costello's homotopic theory of effective renormalization. We show that Fedosov's Abelian connections on the Weyl bundle produce solutions to the effective quantum master equation. Moreover, BV integration produces a natural trace map on the deformation quantized algebra. This formulation allows us to exploit a (rigorous) localization argument in quantum field theory to deduce the algebraic index theorem via semi-classical analysis, i.e., one-loop Feynman diagram computations.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

On the B-twisted topological sigma model and Calabi-Yau geometry

We provide a rigorous perturbative quantization of the B-twisted topological sigma model via a first order quantum field theory on derived mapping space in the formal neighborhood of constant maps. We prove that the first Chern class of the target manifold is the obstruction to the quantization via Batalin-Vilkovisky formalism. When the first Chern class vanishes, i.e. on Calabi-Yau manifolds, the factorization algebra of observables gives rise to the expected topological correlation functions in the B-model. We explain a twisting procedure to generalize to the Landau-Ginzburg case, and show that the resulting topological correlations coincide with Vafa's residue formula.

0 citations0 reviewsNo code linkedOpen access