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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Towards a real-time computation of timelike hadronic vacuum polarization and light-by-light scattering: Schwinger Model tests

Hadronic vacuum polarization (HVP) and light-by-light scattering (HLBL) are crucial for evaluating the Standard Model predictions concerning the muon’s anomalous magnetic moment. However, direct first-principle lattice gauge theory-based calculations of these observables in the timelike region remain challenging. Discrepancies persist between lattice quantum chromodynamics (QCD) calculations in the spacelike region and dispersive approaches relying on experimental data parametrization from the timelike region. Here, we introduce a methodology employing 1+1-dimensional quantum electrodynamics (QED), i.e. the Schwinger Model, to investigate the HVP and HLBL. To that end, we use both tensor network techniques, specifically matrix product states, and classical emulators of digital quantum computers. Demonstrating feasibility in a simplified model, our approach sets the stage for future endeavors leveraging digital quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Bootstrapping Mixed MN Correlators in 3D

The recent emergence of the modern conformal bootstrap method for the study of conformal field theories (CFTs) has enabled the revisiting of old problems in classical critical phenomena described by three-dimensional CFTs. The study of such CFTs with O(m)^n \rtimes S_n O ( m ) n ⋊ S n global symmetry, also known as models, is pursued in this work. Systems of mixed correlators involving scalar operators in two different representations of the global symmetry group are considered. Isolated allowed regions are found in parameter space for various values of m m and n n . These ``islands’’ can be separated into two qualitative groups: those close to the unitarity bound and those further away. As a by-product of our analysis generic tensor structures required to bootstrap any G^n \rtimes S_n G n ⋊ S n theory with G G arbitrary are worked out.

Kousvos, Stefanos Robert↗
NASA NTRS1989

Reynolds stress development in pressure-driven three-dimensional turbulent boundary layers

The development of the Reynolds stress field was studied for flows in which an initially two-dimensional boundary layer was skewed sideways by a spanwise pressure gradient ahead of an upstream-facing wedge. Two different wedges were used, providing a variation in the boundary-layer skewing. Measurements of all components of the Reynolds stress tensor and all ten triple products were measured using a rotatable cross-wire anemometer. The results show the expected lag of the shear stress vector behind the strain rate. Comparison of the two present experiments with previous data suggests that the lag can be estimated if the radius of curvature of the free-stream streamline is known. The magnitude of the shear stress vector in the plane of the wall is seen to decrease rapidly as the boundary-layer skewing increases. The amount of decrease is apparently related to the skewing angle between the wall and the free stream. The triple products evolve rapidly and profiles in the three-dimensional boundary layer are considerably different than two-dimensional profiles, leaving little hope for gradient transport models for the Reynolds stresses. The simplified model presented by Rotta (1979) performs reasonably well providing that an appropriate value of the T-parameter is chosen.

Anderson, Shawn D.↗
DOE OSTI2021

An end-to-end trainable hybrid classical-quantum classifier

Abstract We introduce a hybrid model combining a quantum-inspired tensor network and a variational quantum circuit to perform supervised learning tasks. This architecture allows for the classical and quantum parts of the model to be trained simultaneously, providing an end-to-end training framework. We show that compared to the principal component analysis, a tensor network based on the matrix product state with low bond dimensions performs better as a feature extractor for the input data of the variational quantum circuit in the binary and ternary classification of MNIST and Fashion-MNIST datasets. The architecture is highly adaptable and the classical-quantum boundary can be adjusted according to the availability of the quantum resource by exploiting the correspondence between tensor networks and quantum circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Improving Runtime Performance of Tensor Computations using Rust From Python

In this work, we investigate improving the runtime performance of key computational kernels in the Python Tensor Toolbox (pyttb), a package for analyzing tensor data across a wide variety of applications. Recent runtime performance improvements have been demonstrated using Rust, a compiled language, from Python via extension modules leveraging the Python C API—e.g., web applications, data parsing, data validation, etc. Using this same approach, we study the runtime performance of key tensor kernels of increasing complexity, from simple kernels involving sums of products over data accessed through single and nested loops to more advanced tensor multiplication kernels that are key in low-rank tensor decomposition and tensor regression algorithms. In numerical experiments involving synthetically generated tensor data of various sizes and these tensor kernels, we demonstrate consistent improvements in runtime performance when using Rust from Python over 1) using Python alone, 2) using Python and the Numba just-in-time Python compiler (for loop-based kernels), and 3) using the NumPy Python package for scientific computing (for pyttb kernels).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗
DOE OSTI2022

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Constraining axion inflation with gravitational waves from preheating

We study gravitational wave production from gauge preheating in a variety of inflationary models, detailing its dependence on both the energy scale and the shape of the potential. In this work, we show that preheating into Abelian gauge fields generically leads to a large gravitational wave background that contributes significantly to the effective number of relativistic degrees of freedom in the early universe, $N_{\text{eff}}$. We demonstrate that the efficiency of gravitational wave production is correlated with the tensor-to-scalar ratio, $\textit{r}$. In particular, we show that efficient gauge preheating in models whose tensor-to-scalar ratio would be detected by next-generation cosmic microwave background experiments ($\textit{r}$ ≳ 10 –3 ) will be either detected through its contribution to $N_{\text{eff}}$ or ruled out. Furthermore, we show that bounds on $N_{\text{eff}}$ provide the most sensitive probe of the possible axial coupling of the inflaton to gauge fields regardless of the potential.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗
NASA NTRS1981

Products of multiple Fourier series with application to the multiblade transformation

A relatively simple and systematic method for forming the products of multiple Fourier series using tensor like operations is demonstrated. This symbolic multiplication can be performed for any arbitrary number of series, and the coefficients of a set of linear differential equations with periodic coefficients from a rotating coordinate system to a nonrotating system is also demonstrated. It is shown that using Fourier operations to perform this transformation make it easily understood, simple to apply, and generally applicable.

Kunz, D. L.↗
DOE OSTI2023

Utah FORGE 3-2514: A Strain Sensing Array to Characterize Deformation at the FORGE Site - Workshop Presentation

This is a presentation on the Strain Sensing Array to Characterize Deformation at the FORGE Site project by Clemson University, presented by Lawrence Murdoch. The project's objective was to evaluate the feasibility of measuring and interpreting tensor strain data to improve the performance of EGS. This presentation was featured in the Utah FORGE R&D Annual Workshop on September 8, 2023. The workshop provided a valuable opportunity to explore the progress made in each of the 17 Research and Development projects funded under Solicitation 2020-1 which aim to enhance our understanding of the crucial factors influencing the development of Enhanced Geothermal Systems (EGS) reservoirs and resources.

15 GEOTHERMAL ENERGY↗
DOE OSTI2020

Search for heavy diboson resonances in semileptonic final states in pp collisions at $\sqrt{s}$ = 13 TeV with the ATLAS detector

This paper reports on a search for heavy resonances decaying into WW , ZZ or WZ using proton–proton collision data at a centre-of-mass energy of $\sqrt{s}$ = 13 TeV. The data, corresponding to an integrated luminosity of 139 fb -1 , were recorded with the ATLAS detector from 2015 to 2018 at the Large Hadron Collider. The search is performed for final states in which one W or Z boson decays leptonically, and the other W boson or Z boson decays hadronically. The data are found to be described well by expected backgrounds. Upper bounds on the production cross sections of heavy scalar, vector or tensor resonances are derived in the mass range 300–5000 GeV within the context of Standard Model extensions with warped extra dimensions or including a heavy vector triplet. Production through gluon–gluon fusion, Drell–Yan or vector-boson fusion are considered, depending on the assumed model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRSDate not supplied

Implicit Large-Eddy Simulations of Compressible Mixing Layers

Implicit large-eddy simulations of the self-similar regions of two compressible mixing layers at high Reynolds number and convective Mach numbers of 0.381 and 0.690 were carried out. Experimental data was used as the input into a synthetic eddy method turbulent inflow boundary condition to initiate simulations. Computational grids with nearly isotropic cells were used and the grid counts ranged from 24 to 270 million points. Agreement with experimental velocity and Reynolds stress data was good given the simplifications of the simulation. The decrease in mixing layer growth rate with increasing compressibility compares well with the literature. Budgets for the Reynolds stress transport equation were extracted from the simulations. It was demonstrated that the grids used did not resolve the dissipation term at the experimental Reynolds number. However, low Reynolds number simulations indicate that the numerical dissipation replaces the physical dissipation and the dissipation term in the transport equation can be represented by the summation term that quantifies the imbalance in the budget. The budgets for the high Reynolds number mixing layers agree well with previous low Reynolds number studies; indicating that the primary mechanism for the reduced growth rate and increased anistropy of the Reynolds stress tensor due to compressibility is a reduction in the pressure-strain and production terms. A new scaling based on the magnitude of the Reynolds stress tensor is proposed. This scaling provides better relative comparisons between the data and shows that the decrease in pressure-strain in the shear component is the primary driver in reducing the transverse normal stress.

turbulence↗
DOE OSTI2022

A multisite decomposition of the tensor network path integrals

Tensor network decompositions of path integrals for simulating open quantum systems have recently been proven to be useful. However, these methods scale exponentially with the system size. This makes it challenging to simulate the non-equilibrium dynamics of extended quantum systems coupled with local dissipative environments. In this work, we extend the tensor network path integral (TNPI) framework to efficiently simulate such extended systems. The Feynman–Vernon influence functional is a popular approach used to account for the effect of environments on the dynamics of the system. In order to facilitate the incorporation of the influence functional into a multisite framework (MS-TNPI), we combine a matrix product state (MPS) decomposition of the reduced density tensor of the system along the sites with a corresponding tensor network representation of the time axis to construct an efficient 2D tensor network. The 2D MS-TNPI network, when contracted, yields the time-dependent reduced density tensor of the extended system as an MPS. The algorithm presented is independent of the system Hamiltonian. We outline an iteration scheme to take the simulation beyond the non-Markovian memory introduced by solvents. Applications to spin chains coupled to local harmonic baths are presented; we consider the Ising, XXZ, and Heisenberg models, demonstrating that the presence of local environments can often dissipate the entanglement between the sites. We discuss three factors causing the system to transition from a coherent oscillatory dynamics to a fully incoherent dynamics. The MS-TNPI method is useful for studying a variety of extended quantum systems coupled with solvents.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Characterizing Topological Order with Matrix Product Operators

One of the most striking features of gapped quantum phases that exhibit topological order is the presence of long-range entanglement that cannot be detected by any local order parameter. The formalism of projected entangled-pair states is a natural framework for the parameterization of gapped ground state wavefunctions which allows one to characterize topological order in terms of the virtual symmetries of the local tensors that encode the wavefunction. In their most general form, these symmetries are represented by matrix product operators acting on the virtual level, which leads to a set of algebraic rules characterizing states with topological quantum order. This construction generalizes the concepts of $\mathsf G$- and twisted injectivity; the corresponding matrix product operators encode all topological features of the theory and provide a complete picture of the ground state manifold on the torus. We show how the string-net models of Levin and Wen fit within this formalism and in doing so provide a particularly intuitive interpretation of the pentagon equation for F-symbols as the pulling of matrix product operators through the string-net tensor network. Our approach paves the way to finding novel topological phases beyond string nets and elucidates the description of topological phases in terms of entanglement Hamiltonians and edge theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Method and apparatus for second-rank tensor generation

A method and apparatus are disclosed for generation of second-rank tensors using a photorefractive crystal to perform the outer-product between two vectors via four-wave mixing, thereby taking 2n input data to a control n squared output data points. Two orthogonal amplitude modulated coherent vector beams x and y are expanded and then parallel sides of the photorefractive crystal in exact opposition. A beamsplitter is used to direct a coherent pumping beam onto the crystal at an appropriate angle so as to produce a conjugate beam that is the matrix product of the vector beam that propagates in the exact opposite direction from the pumping beam. The conjugate beam thus separated is the tensor output xy (sup T).

Liu, Hua-Kuang↗