Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tensor”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Universal CMB 𝐵-mode spectrum from early causal tensor sources

Many early Universe scenarios predict postinflationary tensor perturbations from causality-limited, subhorizon sources. While the microphysical details may be different, as long as these sources are bounded in duration and correlation length, their tensor power spectra exhibit a universal scaling behavior at small wave number: 𝒫 ℎ ⁡(𝑘)∝𝑘 3 , corresponding to white noise on superhorizon scales at the time of production. If these early causal tensor sources (ECTs) exclusively produce gravitational waves before redshift 𝑧 ∼10 5 , this scaling is realized on all of the scales observed in the CMB, and thus yields a universal multipole distribution for the 𝐵-mode angular power spectrum. Unlike the scale-invariant distributions of inflationary 𝐵 modes, ECTs generically predict enhanced power on small scales and suppressed power on large scales, which allows these source classes to be distinguished given measurements over a sufficient range of angular scales. In this paper, we introduce a unified framework for characterizing ECTs and demonstrate how their universal infrared scaling manifests in low-frequency observables, including CMB 𝐵 modes and stochastic gravitational wave spectral densities. We illustrate this mapping with representative case studies of this universality class involving first-order phase transitions, topological defects, and enhanced scalar perturbations, which source tensor modes at second order in perturbation theory.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

QSpace - An open-source tensor library for Abelian and non-Abelian symmetries

This is the documentation for the tensor library QSpace (v4.0), a toolbox to exploit ‘quan tum symmetry spaces’ in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the abelian symmetries $\mathbb{Z}_n$ and U(1), as well as all non-abelian symmetries based on the semisimple classical Lie algebras: A n , B n , C n , and D n , or respectively, the special unitary group SU(n), the odd orthogonal group SO(2n+1), the symplectic group Sp(2n), and the even orthogonal group SO(2n). The code (C++ embedded via the MEX interface into Matlab) is available open source as of QSpace v4.0 on bitbucket under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly comput ing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in the type of operations that it can perform across all symmetries. At the level of an ap plication, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-abelian symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

A tensor density measure of topological charge in three dimensional nematic phases

A path independent measure in order parameter space is introduced such that, when integrated along any closed contour in a three dimensional nematic phase, it yields the topological charge of any line defects encircled by the contour. A related measure, when integrated over either closed or open surfaces, reduces to known results for the charge associated with point defects (hedgehogs) or Skyrmions. We further define a tensor density, the disclination density tensor D, from which the location of a disclination line can be determined. This tensor density has a dyadic decomposition near the line into its tangent and its rotation vector, allowing a convenient determination of both. The tensor D may be nonzero in special configurations in which there are no defects (double-splay or double-twist configurations), and its behavior there is provided. The special cases of Skyrmions and hedgehog defects are also examined, including the computation of their topological charge from D.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The Poisson tensor completion parametric estimator

We introduce the Poisson tensor completion (PTC) estimator that exploits inter-sample relationships to compute a low-rank Poisson tensor decomposition of the frequency histogram for samples of a multivariate distribution. Our crucial observation is that the histogram bins are an instance of a space partitioning of counts and thus can be identified with a spatial non-homogeneous Poisson process. The Poisson tensor decomposition leads to a completion of the mean measure over all bins—including those containing few to no samples—and leads to our proposed estimator. A Poisson tensor decomposition models the underlying distribution of the count data and guarantees non-negative estimated values obviating the need for additional constraints to ensure non-negativity. Furthermore, we demonstrate that our PTC estimator is a substantial improvement over standard histogram-based estimators for sub-Gaussian probability distributions because of the concentration of norm phenomenon.

97 MATHEMATICS AND COMPUTING↗
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

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

The Average Spectrum Norm and Near-Optimal Tensor Completion

We propose the average spectrum norm to study the minimum number of measurements required to approximate a multidimensional array (i.e., sample complexity) via low-rank tensor recovery. Our focus is on the tensor completion problem, where the aim is to estimate a multiway array using a subset of tensor entries corrupted by noise. Our average spectrum norm-based analysis provides near-optimal sample complexities, exhibiting dependence on the ambient dimensions and rank that do not suffer from exponential scaling as the order increases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The tensor-train stochastic finite volume method for uncertainty quantification

The stochastic finite volume method offers an efficient one-pass approach for assessing uncertainty in hyperbolic conservation laws. Still, it struggles with the curse of dimensionality when dealing with multiple stochastic variables. Here, we introduce the stochastic finite volume method within the tensor-train framework to counteract this limitation. This integration, however, comes with its own set of difficulties, mainly due to the propensity for shock formation in hyperbolic systems. To overcome these issues, we have developed a tensor-train-adapted stochastic finite volume method that employs a global WENO reconstruction, making it suitable for such complex systems. This approach represents the first step in designing tensor-train techniques for hyperbolic systems and conservation laws involving shocks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Diagonal isometric form for tensor network states in two dimensions

Isometric tensor network states (isoTNS) generalize the isometric form of the one-dimensional matrix product states to tensor networks in two and higher dimensions. Here, we introduce an alternative isometric form for isoTNS by incorporating auxiliary tensors to represent the orthogonality hypersurface. We implement the time evolving block decimation algorithm on this new isometric form and benchmark the method by computing ground states and the real time evolution of the transverse field Ising model in two dimensions on large square lattices of up to 1250 sites. Our results demonstrate that isoTNS can efficiently capture the entanglement structure of two-dimensional area law states. The short-time dynamics is also accurately reproduced even at the critical point. Our isoTNS formulation further allows for a natural extension to different lattice geometries, such as the honeycomb or kagome lattice.

2-dimensional systems↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
DOE OSTI2026

Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity

We use the framework of fixed-point BCFT tensor networks to present a microscopic CFT derivation of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS 3 /CFT 2 , for both bipartite and multipartite settings. These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification via cutting-and-gluing CFT path integrals. Employing modular flow in the large-c limit, we demonstrate that these intrinsic CFT manipulations reproduce bulk geometric prescriptions, without assuming the AdS/CFT dictionary. The emergence of bulk geometry is traced to coarse-graining over heavy states in the large-c limit. Universal coarse-grained BCFT data for compact 2D CFTs, through the relation to Liouville theory with ZZ boundary conditions, yields hyperbolic geometry on the Cauchy slice. The corresponding averaged replica partition functions reproduce all candidate EWs, arising from different averaging patterns, with the dominant one providing the correct RE and EW. In this way, many heuristic tensor-network intuitions in toy models are made precise and established directly from intrinsic CFT data.

AdS-CFT correspondence↗
DOE OSTI2024

Non-compact gauge groups, tensor fields and Yang-Mills-Einstein amplitudes

Abstract Scattering amplitudes in Yang-Mills-Einstein theories have been investigated mostly for compact gauge groups. While non-compact gauge groups are not physically viable in Yang-Mills theory, non-compact gaugings feature prominently in the supergravity literature, where any choice of perturbative vacuum spontaneously breaks the gauge group to a compact subgroup. In this paper, we formulate double-copy constructions for several five-dimensional$$ \mathcal{N} $$ N = 2 supergravities with non-compact gauge groups. On one side of the double copy, we employ amplitudes from a super-Yang-Mills theory with a massive hypermultiplet. On the other, we use amplitudes from particular non-supersymmetric Yang-Mills-scalar theories with massive fermions, chosen to obey constraints coming from color/kinematics duality. Supergravities with massive self-dual tensors in five dimensions are also considered, showing that tensors are straightforwardly realized as double copies of gauge-theory fermions with suitable choices of signs in the corresponding solutions of the Dirac equation. We present several examples of these constructions, noting in particular the appearance of Heisenberg groups in the supergravity gauge symmetry and, in some cases, the possibility of exotic tensor-vector matter couplings.

Physics↗
DOE OSTI2025

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗
DOE OSTI2025

Absence of Barren Plateaus and Scaling of Gradients in the Energy Optimization of Isometric Tensor Network States

Abstract Vanishing gradients can pose substantial obstacles for high-dimensional optimization problems. Here we consider energy minimization problems for quantum many-body systems with extensive Hamiltonians and finite-range interactions, which can be studied on classical computers or in the form of variational quantum eigensolvers on quantum computers. Barren plateaus correspond to scenarios where the average amplitude of the energy gradient decreases exponentially with increasing system size. This occurs, for example, for quantum neural networks and for brickwall quantum circuits when the depth increases polynomially in the system size. Here we prove that the variational optimization problems for matrix product states, tree tensor networks, and the multiscale entanglement renormalization ansatz are free of barren plateaus. The derived scaling properties for the gradient variance provide an analytical guarantee for the trainability of randomly initialized tensor network states (TNS) and motivate certain initialization schemes. In a suitable representation, unitary tensors that parametrize the TNS are sampled according to the uniform Haar measure. We employ a Riemannian formulation of the gradient based optimizations which simplifies the analytical evaluation.

Barthel, Thomas↗
DOE OSTI2025

Machine learning of 27Al NMR electric field gradient tensors for crystalline structures from DFT

NMR crystallography has emerged as a promising technique for the determination and refinement of atomic coordinates in crystal structures. The crystal structure of compounds containing quadrupolar nuclei, such as 27Al, can be improved by directly comparing solid-state NMR measurements to DFT computations of the electric field gradient (EFG) tensor. The non-negligible computational cost of these first-principles calculations limits the applicability of this method to all but the most well-defined structures. We developed a fast, low-cost machine learning model to predict EFG parameters based on local structural motifs and elemental parameters. We computed 8081 EFG tensors from 1681 27Al crystalline solids using DFT and benchmarked them against 105 experimentally measured 27Al sites. Surprisingly, simple local geometric features dominate the predictive performance of the resulting random-forest model, yielding an R2 value of 0.98 and an RMSE of 0.61 MHz for CQ, the quadrupolar coupling constant. This model accuracy should enable pre-refining future structural assignments before finally validating with first-principles calculations. Such a catalogue of 27Al NMR tensors can serve as a tool for researchers assigning complex NMR spectra influenced by the nuclear electric quadrupole interaction.

Sun, He↗
DOE OSTI2026

Elastic and resonance structures of the nucleon from the hadronic tensor in lattice QCD: Implications for neutrino-nucleon scattering and hadron physics

We compute the Euclidean hadronic tensor from charge density operators and extract elastic and resonance structures by employing exponential fits to the four-point function correlator, as well as a Bayesian reconstruction inverse algorithm to obtain the corresponding spectral density for qualitative comparison. We present the determination of the nucleon’s Sachs electric form factor using the hadronic tensor formalism and verify that it is consistent with that from the conventional three-point function calculation. Beyond the elastic peak, we observe a structure located approximately 0.5–0.7 GeV above the nucleon mass in the Bayesian reconstruction. This structure is interpreted as a mixture of the Roper resonance [𝑁⁡(1440)], and states with both positive and negative parities in this mass region, as well as multihadron states. Assuming the observed structure is dominated by 𝐽 𝑃 = 1/2 ± states, we extract the transition electric form factor 𝐺$^*_𝐸$⁡(𝑄 2 ) and the corresponding longitudinal helicity amplitude 𝑆 1/2 ⁡(𝑄 2 ), and compare them with those determined from the CLAS experimental data of nucleon-to-Roper transition. Although fitting to the four-point correlation function or using the inverse algorithm does not resolve individual resonances, it nevertheless enables the determination of total inclusive lepton–nucleon scattering cross sections in appropriate energy bins. This lattice QCD calculation presents the first major step toward studying the inclusive 𝑁 → 𝑋 contributions within the hadronic tensor formalism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗