Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensor product”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Limits to Gauge Coupling in the Dark Sector Set by the Nonobservation of Instanton-Induced Decay of Super-Heavy Dark Matter in the Pierre Auger Observatory Data

Instantons, which are nonperturbative solutions to Yang-Mills equations, provide a signal for the occurrence of quantum tunneling between distinct classes of vacua. They can give rise to decays of particles otherwise forbidden. Using data collected at the Pierre Auger Observatory, we search for signatures of such instanton-induced processes that would be suggestive of super-heavy particles decaying in the Galactic halo. These particles could have been produced during the post-inflationary epoch and match the relic abundance of dark matter inferred today. The nonobservation of the signatures searched for allows us to derive a bound on the reduced coupling constant of gauge interactions in the dark sector: α X ≲ 0.09, for 10 9 ≲ M X /GeV < 10 19 . Conversely, we obtain that, for instance, a reduced coupling constant α X = 0.09 excludes masses M X ≳ 3 x 10 13 GeV. In the context of dark matter production from gravitational interactions alone, we illustrate how these bounds are complementary to those obtained on the Hubble rate at the end of inflation from the nonobservation of tensor modes in the cosmological microwave background.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Random Tensor Networks with Non-trivial Links

Abstract Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that a better model consists of random tensor networks with link states that are not maximally entangled, i.e., have non-trivial spectra. In this work, we initiate a systematic study of the entanglement properties of these networks. We employ tools from free probability, random matrix theory, and one-shot quantum information theory to study random tensor networks with bounded and unbounded variation in link spectra, and in cases where a subsystem has one or multiple minimal cuts. If the link states have bounded spectral variation, the limiting entanglement spectrum of a subsystem with two minimal cuts can be expressed as a free product of the entanglement spectra of each cut, along with a Marchenko–Pastur distribution. For a class of states with unbounded spectral variation, analogous to semiclassical states in quantum gravity, we relate the limiting entanglement spectrum of a subsystem with two minimal cuts to the distribution of the minimal entanglement across the two cuts. In doing so, we draw connections to previous work on split transfer protocols, entanglement negativity in random tensor networks, and Euclidean path integrals in quantum gravity.

Physics↗
DOE OSTI2021

Systematic Generation of Moment Invariant Bases for 2D and 3D Tensor Fields

Moment invariants have been successfully applied to pattern detection tasks in 2D and 3D scalar, vector, and matrix valued data. However so far no flexible basis of invariants exists, i.e., no set that is optimal in the sense that it is complete and independent for every input pattern. Here, we prove that a basis of moment invariants can be generated that consists of tensor contractions of not more than two different moment tensors each under the conjecture of the set of all possible tensor contractions to be complete. This result allows us to derive the first generator algorithm that produces flexible bases of moment invariants with respect to orthogonal transformations by selecting a single non-zero moment to pair with all others in these two-factor products. Since at least one non-zero moment can be found in every non-zero pattern, this approach always generates a complete set of descriptors.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1978

Sound production in a moving stream

Jet noise is modeled by particle-attached quadrupoles convected with the velocity of the actual fluid but positioned near a hypothetical instability-free vortex sheet. The strength of each quadrupole is Lighthill's stress tensor per unit mass. The work of Mani (1976) has shown that this type of model agrees well with experiment, and the present work establishes some of the equivalent sources needed for an exact analogy. The instability waves of the shear layer, as they grow into turbulence, are heard as sound that builds up as a precursor of the main turbulence-driven field. The circular compact jet is examined in some detail, and it is found that when the jet is very light it can provide a waveguide in which the effects of source activity persist for some time but eventually leak out as sound. This interaction greatly distorts the free field characteristics of the turbulent sources, so that Reynolds-stress-induced waves have an intensity that scales with the fourth power of jet velocity.

Dowling, A. P.↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2024

Warm inflation with a heavy QCD axion

We propose the first model of warm inflation in which the particle production emerges directly from coupling the inflaton to Standard Model particles. Warm inflation, an early epoch of sustained accelerated expansion at finite temperature, is a compelling alternative to cold inflation, with distinct predictions for inflationary observables such as the amplitude of fluctuations, the spectral tilt, the tensor-to-scalar ratio, and non-gaussianities. In our model a heavy QCD axion acts as the warm inflaton whose coupling to Standard Model gluons sources the thermal bath during warm inflation. Axion-like couplings to non-Abelian gauge bosons have been considered before as a successful microphysical theory with emerging thermal friction that can maintain finite temperature during inflation via sphaleron heating. However, the presence of light fermions charged under the non-Abelian group suppresses particle production, hindering a realization of warm inflation by coupling to QCD. We point out that the Standard Model quarks can be heavy during warm inflation if the Higgs field resides in a high-energy second minimum which restores efficient sphaleron heating. A subsequent large reheating temperature is required to allow the Higgs field to relax to its electroweak minimum. Exploring a scenario in which hybrid warm inflation provides the large reheating temperature, we show that future collider and beam dump experiments have discovery potential for a heavy QCD axion taking the role of the warm inflaton.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Simulating large one-dimensional neutral-atom quantum systems

While abstract models of quantum computation assume a closed system of two-level states, practical quantum devices inevitably couple to the environment in some way, creating sources of noise. Understanding the tolerance to noise of specific quantum algorithms run on specific devices is important for determining the feasibility of quantum computing in the current noisy intermediate-scale quantum era. Of particular interest is understanding the noise sensitivity of these devices as more qubits are added to the system. Classical simulations are a useful tool to understand the effects of this noise, but direct classical simulations of open quantum systems are burdened by an exponentially growing cost in the number of qubits and a large local Hilbert space dimension. For onedimensional, shallow circuits, using tensor networks can replace this exponential cost with a linear one and simulate far wider systems than what would normally be available. In this paper, we describe a tensor network simulation of a neutral atom quantum system under the presence of noise, while introducing a purity-preserving truncation technique that compromises between the simplicity of the matrix product state and the positivity of the matrix product density operator. We apply this simulation to a near-optimized iteration of the quantum approximate optimization algorithm on a transverse field Ising model in order to investigate the influence of large system sizes on the performance of the algorithm. We find that while circuits with a large number of qubits fail more often under noise that depletes the qubit population, their outputs on a successful measurement are just as robust under Rydberg atom dissipation or qubit dephasing as smaller systems. However, such circuits might not perform as well under coherent multiqubit errors such as Rydberg atom crosstalk. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters before switching to a cleaner system for measurements of observables.

Allen, James↗
DOE OSTI2025

Five-point functions and the permutation group 𝑆 5

Five-point functions and five-body wave functions play an important role in many areas of nuclear and particle physics, e.g., in 2 →3 scattering processes, in the five-gluon vertex, or in the study of pentaquarks. In this work we consider the permutation group 𝑆 5 to facilitate the description of such objects. We work out the multiplets transforming under irreducible representations of 𝑆 5 and provide compact formulas allowing one to cast the permutations of an object 𝑓 12345 into combinations with definite permutation symmetry. We also give the explicit expressions for the irreducible multiplet products. We consider several practical applications as examples: We arrange the four-momenta and Lorentz invariants of a five-point function into the multiplet structure, we work out the color tensors of the five-gluon vertex in the multiplet notation, and we discuss applications for five-body wave functions like those of pentaquarks.

Bethe-Salpeter equation↗
DOE OSTI2021

Spatiotemporal Crossover between Low- and High-Temperature Dynamical Regimes in the Quantum Heisenberg Magnet

The stranglehold of low temperatures on fascinating quantum phenomena in one-dimensional quantum magnets has been challenged recently by the discovery of anomalous spin transport at high temperatures. Whereas both regimes have been investigated separately, no study has attempted to reconcile them. For instance, the paradigmatic quantum Heisenberg spin-$1/2$ chain falls at low-temperature within the Tomonaga-Luttinger liquid framework, while its high-temperature dynamics is superdiffusive and relates to the Kardar-Parisi-Zhang universality class in $1+1$ dimensions. This work aims at reconciling the two regimes. Building on large-scale matrix product state simulations, we find that they are connected by a temperature-dependent spatiotemporal crossover. In this work, as the temperature $T$ is reduced, we show that the onset of superdiffusion takes place at longer length and time scales $\propto 1/T$. This prediction has direct consequences for experiments including nuclear magnetic resonance: it is consistent with earlier measurements on the nearly ideal Heisenberg $S=1/2$ chain compound Sr$_2$CuO$_3$ yet calls for new and dedicated experiments.

1-dimensional spin chains↗
NASA NTRS1982

Operator split methods in the numerical solution of the finite deformation elastoplastic dynamic problem

The spatial formulation of the elastoplastic dynamic problem for finite deformations is considered. A thermodynamic argument leads to an additive decomposition of the spatial rate of deformation tensor and allows an operator split of the evolutionary equations of the problem into elastic and plastic parts. This operator split is taken as the basis for the definition of a global product algorithm. In the context of finite element discretization the product algorithm entails, for every time step, the solution of a nonlinear elastodynamic problem followed by the application of plastic algorithms that operate on the stresses and internal variables at the integration points and bring in the plastic constitutive equations. Suitable plastic algorithms are discussed for the cases of perfect and hardening plasticity and viscoplasticity. The proposed formalism does not depend on any notion of smoothness of the yield surface and is applicable to arbitrary convex elastic regions, with or without corners. The stabiity properties of the global product algorithm are shown to be identical to those of the algorithm used for the integration of the nonlinear elastodynamic problem. Numerical examples illustrate the accuracy of the method.

Pinsky, P. M.↗
DOE OSTI2021

Measurement of beam asymmetry for π – Δ ++ photoproduction on the proton at E γ = 8.5 GeV

We report a measurement of the $\pi^-$ photoproduction beam asymmetry for the reaction $\vec{\gamma} p \rightarrow \pi^- \Delta^{++}$ using data from the GlueX experiment in the photon beam energy range 8.2--8.8 GeV. The asymmetry $\Sigma$ is measured as a function of four-momentum transfer $t$ to the $\Delta^{++}$ and compared to phenomenological models. We find that $\Sigma$ varies as a function of $t$: negative at smaller values and positive at higher values of $|t|$. The reaction can be described theoretically by $t$-channel particle exchange requiring pseudoscalar, vector, and tensor intermediaries. In particular, this reaction requires charge exchange, allowing us to probe pion exchange and the significance of higher-order corrections to one-pion exchange at low momentum transfer. Constraining production mechanisms of conventional mesons may aid in the search for and study of unconventional mesons. Furthermore, this is the first measurement of the process at this energy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

FLYING SERVING: On-the-Fly Parallelism Switching for Large Language Model Serving

Production LLM serving must simultaneously deliver high throughput, low latency, and sufficient context capacity under non-stationary traffic and mixed request requirements. Data parallelism (DP) maximizes throughput by running independent replicas, while tensor parallelism (TP) reduces per-request latency and pools memory for long-context inference. However, existing serving stacks typically commit to a static parallelism configuration at deployment; adapting to bursts, priorities, or long-context requests is often disruptive and slow. We present Flying Serving, a vLLM-based system that enables online DP-TP switching without restarting engine workers. Flying Serving makes reconfiguration practical by virtualizing the state that would otherwise force data movement: (i) a zero-copy Model Weights Manager that exposes TP shard views on demand, (ii) a KV Cache Adaptor that preserves request KV state across DP/TP layouts, (iii) an eagerly initialized Communicator Pool to amortize collective setup, and (iv) a deadlock-free scheduler that coordinates safe transitions under execution skew. Across three popular LLMs and realistic serving scenarios, Flying Serving improves performance by up to 4.79 × under high load and 3.47 × under low load while supporting latency- and memory-driven requests.

Gao, Shouwei [ORNL]↗
DOE OSTI2021

An experimental program with high duty-cycle polarized and unpolarized positron beams at Jefferson Lab

Positron beams, both polarized and unpolarized, are identified as important ingredients for the experimental programs at the next generation of lepton accelerators. In the context of the hadronic physics program at Jefferson Lab (JLab), positron beams are complementary, even essential, tools for a precise understanding of the electromagnetic structure of nucleons and nuclei, in both the elastic and deep-inelastic regimes. For instance, elastic scattering of polarized and unpolarized electrons and positrons from the nucleon enables a model independent determination of its electromagnetic form factors. Also, the deeply-virtual scattering of polarized and unpolarized electrons and positrons allows unambiguous separation of the different contributions to the cross section of the lepto-production of photons and of lepton-pairs, enabling an accurate determination of the nucleons and nuclei generalized parton distributions, and providing an access to the gravitational form factors of the energy-momentum tensor. Furthermore, positron beams offer the possibility of alternative tests of the Standard Model of particle physics through the search of a dark photon, the precise measurement of electroweak couplings, and the investigation of charged lepton flavor violation. This document discusses the perspectives of an experimental program with high duty-cycle positron beams at JLab.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scrambling and operator entanglement in local non-Hermitian quantum systems

The breakdown of Lieb-Robinson bounds in local, non-Hermitian quantum systems opens up the possibility for a rich landscape of quantum many-body phenomenology. We elucidate this by studying information scrambling and quantum chaos in non-Hermitian variants of paradigmatic local quantum spin-chain models. We utilize a mixture of exact diagonalization and tensor network techniques for our numerical results and focus on three dynamical quantities: (i) out-of-time-ordered correlators (OTOCs), (ii) operator entanglement of the dynamics, and (iii) entanglement growth following a quench from product initial states. We show that while OTOCs fail to capture information scrambling in a simple, local, non-Hermitian transverse-field Ising model, the closely related operator entanglement is a robust measure of dynamical properties of interest. Moreover, we show that the short-time growth of operator entanglement can generically detect entanglement phase transitions in these systems while its long-time average is shown to be a reliable indicator of quantum chaos and entanglement phases. This allows us to extend operator entanglement-based diagnostics from previous works on closed and open quantum systems, to the new arena of monitored quantum dynamics. Finally, we remark on the efficacy of these dynamical quantities in detecting integrability/chaos in the presence of continuous monitoring.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗