Search NASASearch

SEARCH · Search NASA

Results for “Approximation”

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 91 records · Page 5

Schwinger-Keldysh effective action for hydrodynamics with approximate symmetries

We study hydrodynamic theories with approximate symmetries in the recently developed effective action approach on the Schwinger-Keldysh contour. We employ the method of spurious symmetry transformation for small explicit symmetry-breaking parameters to systematically constrain symmetry-breaking effects in the nonequilibrium effective action for hydrodynamics. We apply our method to the hydrodynamic theory of chiral symmetry in quantum chromodynamics at finite temperature and density and its explicit breaking by quark masses. We show that the spurious symmetry and the Kubo-Martin-Schwinger relation dictate that the Ward-Takahashi identity for the axial symmetry, i.e., the partial conservation of axial vector current (PCAC) relation, contains a relaxational term proportional to the axial chemical potential, whose kinetic coefficient is at least of the second order in the quark mass. In the phase where the chiral symmetry is spontaneously broken, and the pseudo-Nambu-Goldstone pions appear as hydrodynamic variables, this relaxation effect is subleading compared to the conventional pion mass term in the PCAC relation, which is of the first order in the quark mass. On the other hand, in the chiral symmetry restored phase, we show that our relaxation term, which is of the second order in the quark mass, becomes the leading contribution to the axial charge relaxation. Therefore, the leading axial charge relaxation mechanism is parametrically different in the quark mass across a chiral phase transition.

Goldstone bosons

Relaxation time approximation for a multispecies relativistic gas

We generalize a recent prescription for the relaxation time approximation for the relativistic Boltzmann equation for systems with multiple particle species at finite temperature. This is performed by adding counter-terms to the traditional Anderson-Witting ansatz for each particle species. Our approach allows for the use of momentum-dependent relaxation times and the obedience of local conservation laws regardless of the definition of the local equilibrium state. As an application, we derive the first order Chapman-Enskog corrections to the equilibrium distribution and display results for the hadron-resonance gas. We also demonstrate that our collision term ansatz obeys the second law of thermodynamics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Heavy quark mass effects in charged-current deep-inelastic scattering at approximate NNLO in the Aivazis-Collins-Olness-Tung scheme

The approximate SACOT-𝜒 scheme for heavy quark production in deep-inelastic scattering was initially formulated for the neutral current structure functions 𝐹 2 and 𝐹 𝐿 . We extend this approach to the charged current case (also including 𝐹 3 ), and thereby complete the definitions for the most relevant inclusive structure functions. Furthermore, we implement these structure functions in the open-source code APFEL++ which provides fast numerical evaluations over a wide kinematic range; this addition to the APFEL++ code is publicly available, with details provided in the Appendix. This SACOT-𝜒 implementation enables detailed numerical insights on the mass dependence of the structure functions and cross sections in the (𝑥,𝑄 2 )-plane for both neutral and charged current processes. We consider kinematic regions relevant for the experimental measurements from fixed-target 𝜈⁢ DIS experiments (NuTeV, CCFR, and Chorus) and HERA, and also projections for the upcoming EIC. In particular, the 𝜈⁢ DIS experiments reveal a surprisingly strong dependence on the mass effects, offering valuable insights that may help resolve long-standing challenges in accurately describing these datasets.

Risse, P. [Westfälische Wilhelms-Universität Münst

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE

Quantum Monte Carlo calculations of electron scattering from 12 C in the short-time approximation

The short-time approximation is a method introduced to evaluate electroweak nuclear response for systems with A ≥ 12, extending the reach of first-principle many-body quantum Monte Carlo calculations. Using realistic two- and three-body nuclear interactions and consistent one- and two-body electromagnetic currents, we calculate longitudinal and transverse response densities and response functions of 12 C. Here, we compare the resulting cross sections with experimental data for electron-nucleus scattering, finding good agreement.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)

Quantum Approximate Optimization Algorithm on Different Qubit Systems

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)

COBRA:COMPUTED-TOMOGRAPHY BASED RANDOM-FIELD APPROXIMATION

SF-25-115 COBRA (COmputed-tomography Based Random-field Approximation) is a Python application for generating statistically equivalent random fields from CT-scan imagery. It leverages Karhunen–Loève expansions to model microstructural variability, enabling users to: Preprocess CT scans (filtering and Gaussian transformation); Fit covariance kernels fromempirical data; Solve eigenproblems to obtain KL modes; Sample random fields onsistent with fitted statistics; Postprocess samples back into the physical domain.

Hu, Tianchen

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS

Atomistic Modeling of the Interphase Structure between Alumina and Al12Fe2Cr Quasicrystal Approximant

Molecular dynamics simulations are performed to study the stability of an fcc metallic interlayer phase between an iron aluminide quasicrystal approximant (QCA) phase (84.2 Al, 5.7 Fe, 5.4 Ni, and 4.7 at.% Cr) and aluminum oxides (α-Al 2 O 3 and γ-Al 2 O 3 ). The presence of the interlayer phase was experimentally observed in some regions of the inner diameter surface of a TPBAR cladding tube. The simulations employed existing many-body (MEAM and EAM) interatomic potentials to describe atomic interactions in the interlayer and QCA phases, and Buckingham+Coulomb pair interactions for the alumina and between the alumina and the QCA (or fcc). Interface systems of QCA/alumina, fec/alumina, and QCA/fcc are modeled and the fracture energy of the interfaces is calculated. Based on the fracture energies, for the γ-Al 2 O 3 , both MEAM and EAM suggest that the fcc interlayer phase would not form. For the α-Al 2 O 3 , the MEAM predicts that the fcc phase would form, however, the EAM predicts that it forms only if the α-Al 2 O 3 is Al-terminated at the interface. For the O-terminated α-Al 2 O 3 , the EAM predicts the fcc phase would not form, consistent with the results for γ-Al 2 O 3 .

36 MATERIALS SCIENCE

Red Noise–based False Alarm Thresholds for Astrophysical Periodograms via Whittle’s Approximation to the Likelihood

Astronomers who search for periodic signals using Lomb–Scargle periodograms rely on false alarm level (FAL) estimates to identify statistically significant peaks. Although FALs are often calculated from white noise models, many astronomical time series suffer from red noise. Prewhitening is a statistical technique in which a continuum model is subtracted from the log power spectrum estimate, after which the observer can proceed with a white-noise treatment. Here we present a prewhitening-based method of calculating frequency-dependent FALs. We fit power laws and autoregressive models of order 1 to each Lomb–Scargle periodogram by minimizing the Whittle approximation to the negative log-likelihood (NLL), then calculate FALs based on the best-fit model power spectrum. Our technique is a novel extension of the Whittle NLL to datasets with uneven time sampling. We demonstrate FAL calculations using observations of α Cen B, GJ 581, HD 192310, synthetic data from the radial velocity (RV) fitting challenge, and Kepler observations of a differential rotator. The Kepler data analysis shows that only true rotation signals are detected by red noise FALs, while white noise FALs suggest all spurious peaks in the low-frequency range are significant. A high-frequency sinusoid injected into α Cen B logR$'$ HK observations exceeds the 1% red noise FAL despite having only 8.9% of the power of the dominant rotation signal. In a periodogram of HD 192310 RVs, peaks associated with differential rotation and planets are detected against the 5% red noise FAL without iterative model fitting or subtraction. The software for calculating red noise–based FALs is available on GitHub.

Astrostatistics (1882)

Anomaly Detection and Approximate Similarity Searches of Transients in Real-time Data Streams

Abstract We present Lightcurve Anomaly Identification and Similarity Search ( LAISS ), an automated pipeline to detect anomalous astrophysical transients in real-time data streams. We deploy our anomaly detection model on the nightly Zwicky Transient Facility (ZTF) Alert Stream via the ANTARES broker, identifying a manageable ∼1–5 candidates per night for expert vetting and coordinating follow-up observations. Our method leverages statistical light-curve and contextual host galaxy features within a random forest classifier, tagging transients of rare classes ( spectroscopic anomalies), of uncommon host galaxy environments ( contextual anomalies), and of peculiar or interaction-powered phenomena ( behavioral anomalies). Moreover, we demonstrate the power of a low-latency (∼ms) approximate similarity search method to find transient analogs with similar light-curve evolution and host galaxy environments. We use analogs for data-driven discovery, characterization, (re)classification, and imputation in retrospective and real-time searches. To date, we have identified ∼50 previously known and previously missed rare transients from real-time and retrospective searches, including but not limited to superluminous supernovae (SLSNe), tidal disruption events, SNe IIn, SNe IIb, SNe I-CSM, SNe Ia-91bg-like, SNe Ib, SNe Ic, SNe Ic-BL, and M31 novae. Lastly, we report the discovery of 325 total transients, all observed between 2018 and 2021 and absent from public catalogs (∼1% of all ZTF Astronomical Transient reports to the Transient Name Server through 2021). These methods enable a systematic approach to finding the “needle in the haystack” in large-volume data streams. Because of its integration with the ANTARES broker, LAISS is built to detect exciting transients in Rubin data.

79 ASTRONOMY AND ASTROPHYSICS

Analytical Approximations for Beamstrahlung at Very High Energy Electron-Positron Colliders

Among the many effects that occur in beam-beam electron-positron collisions at TeV energies, emission of hard synchrotron radiation, or beamstrahlung, has special importance. Beamstrahlung determines the energy spectrum of the most energetic electrons, positrons, and photons and supplies the initial condition for the calculation of all other QED processes. In this paper, we show that the description of beamstrahlung simplifies in the limit of large quantum parameter $Υ$, which is realized in 10 TeV collider designs. The beamstrahlung spectra for electrons and photons are given in terms of universal functions. We supply approximations to these functions that will be useful for more general studies of the beam-beam interaction at very high energies.

Accelerator Physics (physics.acc-ph)

Deriving Effective Coupling Strength with Born-Oppenheimer Approximation

The development of high-fidelity quantum gates is paramount to the scalability of quantum processors. Tunable couplers have played a key role in the realization of these low error rate quantum gates in superconducting circuits. However, the derivation of the effective coupling strength between the qubits is usually enabled by a Schrieffer-Wolff transformation, which is complex and requires prior-knowledge of the proper generator for the transformation. We propose a simpler method of obtaining this effective coupling using an approach similar to the Born-Oppenheimer approximation.

Wichmann, Conrad

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001

Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction

Approximate quantum error correction (AQEC) not only dictates the performance of discrete- and continuous-variable quantum error correction codes but also serves as a unifying framework across various physical disciplines. Identifying the optimal recovery channel to maximize the entanglement fidelity via standard semidefinite programming is computationally bottlenecked by the exponentially growing number of Kraus operators with system size, rendering large-scale optimization prohibitive. While analytical near-optimal maps exist, they typically work only when the Knill-Laflamme conditions are nearly satisfied. In this Letter, we establish an efficient framework by leveraging the duality between recovery and environment decoupling. This framework yields a tighter analytical lower bound on entanglement fidelity than the conventional limit set by the transpose channel. Furthermore, by exploiting the decayed weights of noise Kraus operators, we introduce a framework based on principal component analysis to reduce the dimension. In thermal loss channels where the weights decay exponentially, our approach achieves a 33-fold computational speedup while maintaining rigorous accuracy. Our approach enables high-precision optimization for AQEC codes that were previously intractable due to the curse of dimensionality.

Wu, Jing [Fermilab] (ORCID:0000000249460732)