Search NASA⌕ Search

SEARCH · Search NASA

Results for “LOGARITHM”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Devulapalli, Dhruv (ORCID:000000022612308X)↗

Hidden quantum criticality and entanglement in quench dynamics

Entanglement exhibits universal behavior near the ground-state critical point where correlations are long ranged and the thermodynamic entropy is vanishing. On the other hand, a quantum quench imparts extensive energy and results in a build up of entropy, hence no critical behavior is expected at long times. In this work, we present a new paradigm in the quench dynamics of integrable spin chains which exhibit a ground-state order-disorder phase transition at a critical line. Specifically, we consider a quench along the critical line which displays a volume-law behavior of the entropy and exponentially decaying correlations; however, we show that quantum criticality is hidden in higher-order correlations and becomes manifest via measures such as the mutual information and logarithmic negativity. Furthermore, we showcase the scale invariance of the Rényi mutual information between disjoint regions as further evidence for genuine critical behavior. We attribute the emergent quantum criticality to the soft mode not getting excited in spite of the quench. Moreover, the results presented here are universal to models whose low-energy or long-wavelength dynamics are well described by a free-fermionic field theory. Our results are amenable to an experimental realization on different quantum simulator platforms, particularly the Rydberg simulators. Published by the American Physical Society 2024

Paul, Sanku↗

Potential quantum advantage for simulation of fluid dynamics

Numerical simulation of turbulent fluid dynamics needs to either parametrize turbulence—which introduces large uncertainties—or explicitly resolve the smallest scales—which is prohibitively expensive. Here, we provide evidence through analytic bounds and numerical studies that a potential quantum speedup can be achieved to simulate fluid dynamics using quantum computing. Specifically, we provide a lattice Boltzmann formulation of fluid dynamics for which we give evidence that low-order Carleman linearization is much more accurate than previously believed for these systems. This is achieved via a combination of reformulating the Navier-Stokes nonlinearity (u·$\triangledown$u) to lattice-Boltzmann nonlinearity (u 2 ) and accurately linearizing the dynamical equations, which effectively trades nonlinearity for additional degrees of freedom that add negligible expense in the quantum solver. Based on this, we apply a quantum algorithm for simulating the Carleman-linearized lattice Boltzmann equation and provide evidence that its cost scales logarithmically with system size compared with polynomial scaling in the best known classical algorithms. In this paper, we suggest that a quantum advantage may exist for simulating fluid dynamics, paving the way for simulating nonlinear multiscale transport phenomena in a wide range of disciplines using quantum computing.

42 ENGINEERING↗

Utilizing the deuterium-tritium fusion resonance to diagnose thermal runaway in igniting plasmas

For high-efficiency inertial confinement fusion implosions, it is predicted that a burning hot spot will successfully encompass all surrounding fuel and then transition into a thermal runaway where the internal energy increase from fusion occurs on a timescale faster than the expansion of the fuel is able to quench the fusion chain reaction after ignition occurs. Observation of this dynamic phase transition would indicate distinct burn properties and indicate an implosion's robustness. A technique for diagnosing the presence of thermal runaway from measurements of nuclear reaction history is presented. The technique is based on taking the logarithmic derivative of the nuclear reaction history, called the 𝛼 curve, and allowing a mathematical decoupling of the mass, volume, and thermal reactivity in the fusion reaction rate equation. During thermal runaway, where the thermal temperature dominates the burn dynamics, a maximum in the 𝛼 curve is found where there is a maximum in the first derivative of the thermal fusion reactivity, an effect to the deuterium-tritium (DT) fusion cross-section resonance. This provides a distinct signature related to the fundamental nature of the DT fusion nuclear resonance and signifies the transition into the fusion thermal instability. Impacts of charged particle transport on the effect are also assessed and the analytical formulas are compared and found to be in agreement with radiation hydrodynamic codes.

high-energy-density plasmas↗

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

97 MATHEMATICS AND COMPUTING↗

Lattice calculation of light meson radiative leptonic decays

In this work, we perform a lattice QCD calculation of the branching ratios and the form factors\r\nof radiative leptonic decays P →ℓνℓγ (P= π,K) using Nf = 2+1 domain wall fermion ensembles\r\ngenerated by the RBC and UKQCD collaborations at the physical pion mass. We adopt the\r\ninfinite-volume reconstruction (IVR) method, which extends lattice data to infinite volume and\r\neffectively controls the finite-volume effects. This study represents a first step toward a complete\r\ncalculation of radiative corrections to leptonic decays using the IVR method, including both real\r\nphoton emissions and virtual photon loops. For decays involving a final-state electron, collinear\r\nradiative corrections, enhanced by the large logarithmic factors such as ln(m2\r\nπ/m2e) and ln(m2K/m2e), can reach the level of O(10%) and are essential at the current level of theoretical and experimental precision. After including these corrections, our result for π →eνeγ agrees with the PIBETA measurement; for K →eνeγ, our results are consistent with the KLOE data and exhibit a 1.7σtension with E36; and for K →µνµγ, where radiative corrections are negligible, our results confirm the previously observed discrepancies between lattice results and the ISTRA/OKA measurements at large photon energies, and with the E787 results at large muon–photon angles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. However, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. Here, in this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Rapid Quantum Ground State Preparation via Dissipative Dynamics

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

decoherence↗

Shear and bulk viscosity for a pure glue theory using an effective matrix model

At nonzero temperatures, the deconfining phase transition can be analyzed using an effective matrix model to characterize the change in holonomy. The model includes gluons and two-dimensional ghost fields in the adjoint representation, or “teens.” As ghosts, the teen fields are responsible for the decrease of the pressure as 𝑇 →𝑇 𝑑 , with 𝑇 𝑑 the transition temperature for deconfinement. Using the solution of this matrix model for a large number of colors, the parameters of the teen fields are adjusted so that the expectation value of the Polyakov loop is close to the values from the lattice. The shear, 𝜂, and bulk, 𝜁, viscosities are computed at nonzero holonomy to leading logarithmic order in weak coupling. In the pure glue theory, the value of the Polyakov loop is relatively large in the deconfined phase, ≈1/2 at 𝑇 𝑑 . Consequently, if 𝑠 is the entropy density, while 𝜂/𝑠 decreases as 𝑇 →𝑇 𝑑 , it is still well above the conformal bound. In contrast, 𝜁/𝑠 is largest at 𝑇 𝑑 , comparable to 𝜂/𝑠, then falls off rapidly with increasing temperature and is negligible by ∼2⁢𝑇 𝑑 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Performance Improvements Through Advanced PV Backtracking on Uneven Terrain

The climatic sensitivity of new terrain-aware backtracking algorithms is evaluated across 800 locations in the continental USA on a representative synthetic rolling terrain. We find that a global optimization approach to backtracking results in climate-specific annual energy gains of 2.4%–3.2% relative to a traditional backtracking algorithm baseline. We identify a strong logarithmic correlation between local diffuse fraction and yield improvement, and highlight the effect of seasonal precipitation on performance gains. We also find that a backtracking approach, which approximates the terrain as constant, does not offer significant annual energy gains over the baseline on the synthetic terrain. Our findings suggest that specific yield from backtracking in the USA can be improved by as much as 88 kWh/kW by considering terrain when selecting a backtracking algorithm.

Backtracking↗

Bridging the Gap Between LLMs and LNS with Dynamic Data Format and Architecture Codesign

Deep neural networks (DNNs) have achieved tremendous success in the past few years. However, their training and inference demand exceptional computational and memory resources. Quantization has been shown as an effective approach to mitigate the cost, with the mainstream data types reduced from FP32 to FP16/BF16 and recently FP8 in the latest NVIDIA H100 GPUs. With increasingly aggressive quantization, however, the conventional floating-point formats suffer from limited precision in representing numbers around zero. Recently, NVIDIA demonstrated the potential of using a Logarithmic Number System (LNS) for the next generation of tensor cores. While LNS mitigates the hurdles in representing small numbers, in this work we observed a mismatch between LNS and the emerging Large Language Models (LLM), where LLM exhibits significant outliers when directly adopting the LNS format. In this paper, we present a data-format/architecture codesign to bright this gap. On the format side, we propose a dynamic LNS format to flexibly represent outliers at a higher precision, by exploiting asymmetry in the LNS representation and identifying outliers through a per-vector basis. On the architecture side, for demonstration, we realize the dynamic LNS format in a systolic array, which can handle the irregularity of the outliers at runtime. We implement our approach on an Alveo U280 FPGA as a prototype. Experimental results show that our design can effectively handle the outliers and resolve the mismatch between LNS and LLM, contributing to an accuracy improvement of 15.4% and 16% over the floating-point and the original LNS baselines, using four state-of-the-art LLM models. Our observation and design lay a solid foundation for the large-scale adoption of the LNS format in the next-generation deep learning hardware.

Haghi, Pouya↗

Enhancing Automotive Intrusion Detection Through Multi-Modal Fusion: A CAN FD-LiDAR Approach

As vehicles become smarter and more autonomous, they increasingly depend on advanced sensors and communication technologies to operate securely. However, such growing dependence on technology—whether it’s CAN (Controller Area Network) for internal communication or LiDAR (Light Detection and Ranging) for sensing the world around them—also expands the attack surface for the types of cyber attacks. Traditional intrusion detection systems (IDS) typically monitor these systems in isolation, limiting their ability to detect sophisticated, crosssystem attacks. To address this, we propose a multi-modal fusion approach that combines real-world CAN FD signals (from the HCRL dataset) with LiDAR features (from the nuScenes dataset) to enhance attack detection. Our method employs a twostage ensemble approach. Calibrated XGBoost and LightGBM models initially process CAN FD (Fuzzing Data) and LiDAR data independently, detecting timing anomalies and space abnormalities. They are subsequently logarithmically combined with a logistic regression meta-model along with 17 engineered features capturing cross-modal behavior, prediction conflicts, and nonlinear interactions. This approach achieves an AUC of 0.87 and an F1-score of 0.82, surpassing single-modality baselines and early fusion methods, at merely 2 ms inference latency. Compared with deep learning competitors, it is 3 times more efficient, providing a lightweight, interpretable, and real time solution to automotive cybersecurity.

97 MATHEMATICS AND COMPUTING↗

Radiological Source Term Estimation and Isotopic Identification with Parallel Log Domain Particle Filters

This paper presents a parallel log-domain particle filtering algorithm combined with gamma spectrum unfolding to perform localization, identification, and evaluation of multiple point sources of various isotopes in an environment with attenuating obstacles. The method uses sets of precomputed attenuation kernels that map the attenuation characteristics of the environment. These kernels are specific to the energy level of a photopeak of interest. The spectral measurements are deconvolved into count measurements of each photopeak. These count measurements are fed into a set of parallel particle filters using attenuation kernels computed for that photopeak’s energy level. The individual regularized particle filters perform all likelihood calculations in the logarithmic domain to mitigate the effects of particle degeneracy. The output of each particle filter is combined to estimate which isotopes are present as well as their positions and strengths. The performance of the algorithm is characterized in a lab-scale environment using a mobile robot equipped with a gamma ray spectrometer in the presence of up to three different radioactive isotopes simultaneously. The sources were localized to within 10 cm, and their strengths were estimated within 10% of their true values. Furthermore, the isotopes were all correctly identified, and no spurious sources were reported.

42 ENGINEERING↗

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗

Universal mass equation for equal-quantum excited-states sets II

We extend our recent study of the Universal Mass Equation for equal-quantum excited-states sets reported by Roper and Strakovsky (Eur Phys J A 61:102, 2025). The masses of twelve baryon sets and sixteen meson sets, with only two equal-quantum excited states in each set, using Breit-Wigner PDG2024 masses and their uncertainties at fixed J P for baryons and J PC for mesons, are fitted by a simple one-parameter logarithmic function, M n = α Ln(n) + M 1 , where n is the level of radial excitation. Two accurate masses that start a set are used to calculate four higher masses in the set accurately. It is noted that α values for $b\bar{b}$ equal-quantum excited-states sets accurately lie on a straight line, whose line parameters can be used to calculate α and predict higher mass states for $b\bar{b}$ sets that have only one known member.

Roper, L. David [Virginia Polytechnic Inst. and St↗

Measurement of the 1-jettiness event shape observable in deep-inelastic electron-proton scattering at HERA

The H1 Collaboration reports the first measurement of the 1-jettiness event shape observable $τ^b_1$ in neutral-current deep-inelastic electron-proton scattering (DIS). The observable $τ^b_1$ is equivalent to a thrust observable defined in the Breit frame. The data sample was collected at the HERA ep collider in the years 2003–2007 with center-of-mass energy of $\sqrt{s}$ = 319 GeV, corresponding to an integrated luminosity of 351.1 pb -1 . Triple differential cross sections are provided as a function of $τ^b_1$, event virtuality $Q^2$, and inelasticity y, in the kinematic region $Q^2$ > 150 GeV 2 . Single differential cross section are provided as a function of $τ^b_1$ in a limited kinematic range. Double differential cross sections are measured, in contrast, integrated over $τ^b_1$ and represent the inclusive neutral-current DIS cross section measured as a function of $Q^2$ and y. The data are compared to a variety of predictions and include classical and modern Monte Carlo event generators, predictions in fixed-order perturbative QCD where calculations up to $\mathcal{O}$($α^3_s$) are available for $τ^b_1$ or inclusive DIS, and resummed predictions at next-to-leading logarithmic accuracy matched to fixed order predictions at $\mathcal{O}$($α^2_s$). These comparisons reveal sensitivity of the 1-jettiness observable to QCD parton shower and resummation effects, as well as the modeling of hadronization and fragmentation. Within their range of validity, the fixed-order predictions provide a good description of the data. Monte Carlo event generators are predictive over the full measured range and hence their underlying models and parameters can be constrained by comparing to the presented data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Measurement of W±-boson differential cross-sections in proton–proton collisions with low pile-up data at s=5.02 TeV and 13TeV with the ATLAS detector

High precision single-differential W±$$W^\pm $$-boson production cross-sections as a function of electron or muon transverse momentum pT$$p_\textrm{T}$$ or their pseudorapity η$$\eta $$, as well as double-differential cross-sections as functions of these variables, are measured in proton–proton collisions at centre-of-mass energies s=5.02$$\sqrt{s}=5.02$$ TeV and 13 TeV. The W-boson charge asymmetry as a function of lepton η$$\eta $$ is also measured. The data, collected in dedicated runs at reduced instantaneous luminosity with the ATLAS detector at the Large Hadron Collider, correspond to integrated luminosities of 255 pb-1$$^{-1}$$ at 5.02 TeV and 338 pb-1$$^{-1}$$ at 13 TeV. The measurements are in agreement with Standard-Model predictions calculated at next-to-next-to-leading-order in the strong coupling constant αs$$\alpha _s$$ including transverse-momentum resummation at next-to-next-to-leading logarithmic accuracy using several parton distribution functions. The impact of the measured differential cross-sections as a function of lepton η$$\eta $$ on the determination of these functions is studied using a profiling technique.

Aad, G↗

Mitigative Strategies for Recovering From Large Language Model Trust Violations

In this study, we investigated strategies to address trust issues arising from errors in large language models (LLMs). The study examined the impact of confidence scores, system capability explanations, and user feedback on trust restoration post-error. 68 participants viewed the responses of an LLM to 20 general trivia questions, with an error introduced on the third trial. Each participant was presented with one mitigation strategy. Participants rated their overall trust in the model and the reliability of the answer. Results showed an immediate drop in trust after the error; however, there were no differences across the three strategies in trust recovery. All conditions had a logarithmic trend in trust recovery following error. Differences in overall trust were predicted by perceived reliability of the answer, suggesting that participants were evaluating results critically and using that to inform their trust in the model. Qualitative data supported this finding; participants expressed lasting distrust despite the LLM’s later accuracy. Results showcase the need to prioritize accuracy in LLM deployment, because early errors may irrevocably damage user trust calibration and later adoption.

97 MATHEMATICS AND COMPUTING↗