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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Codebase release 0.3 for ITensor

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗
DOE OSTI2021

GPU acceleration of rank-reduced coupled-cluster singles and doubles

Here, we have developed a graphical processing unit (GPU) accelerated implementation of our recently introduced rank-reduced coupled-cluster singles and doubles (RR-CCSD) method. RR-CCSD introduces a low-rank approximation of the doubles amplitudes. This is combined with a low-rank approximation of the electron repulsion integrals via Cholesky decomposition. The result of these two low-rank approximations is the replacement of the usual fourth-order CCSD tensors with products of second- and third-order tensors. In our implementation, only a single fourth-order tensor must be constructed as an intermediate during the solution of the amplitude equations. Owing in large part to the compression of the doubles amplitudes, the GPU-accelerated implementation shows excellent parallel efficiency (95% on eight GPUs). Our implementation can solve the RR-CCSD equations for up to 400 electrons and 1550 basis functions—roughly 50% larger than the largest canonical CCSD computations that have been performed on any hardware. In addition to increased scalability, the RR-CCSD computations are faster than the corresponding CCSD computations for all but the smallest molecules. We test the accuracy of RR-CCSD for a variety of chemical systems including up to 1000 basis functions and determine that accuracy to better than 0.1% error in the correlation energy can be achieved with roughly 95% compression of the ov space for the largest systems considered. We also demonstrate that conformational energies can be predicted to be within 0.1 kcal mol -1 with efficient compression applied to the wavefunction. Finally, we find that low-rank approximations of the CCSD doubles amplitudes used in the similarity transformation of the Hamiltonian prior to a conventional equation-of-motion CCSD computation will not introduce significant errors (on the order of a few hundredths of an electronvolt) into the resulting excitation energies.

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

Impact of tensor forces on quasifission product yield distributions

Quantum shell effects are crucial for the stability and structure of atomic nuclei and play a key role in the discovery of superheavy elements. Furthermore, during nuclear collisions, the dynamical evolution of these shell effects disrupts the equilibration process necessary for forming a compound nucleus, leading to the breakup of the initial composite as a result of quasifission. As such, quasifission reactions hinder the formation of a superheavy element.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Photon-odderon interference in exclusive χ c charmonium production at the Electron-Ion Collider

Exclusive C = + 1 scalar, axial-vector, and tensor quarkonium production in high-energy electron-proton scattering requires a C -odd t -channel exchange of a photon or a three-gluon ladder. We derive the expressions for the corresponding amplitudes. The relative phase of the photon vs three-gluon exchange amplitudes is determined by the sign of the light-front matrix element of the eikonal color current operator d a b c J + a J + b J + c at moderate x , and is not affected by small- x QCD evolution. Model calculations predict constructive interference, which is particularly strong for momentum transfer | t | ∼ 1 GeV 2 where the cross section for χ c J production exceeds that for pure photon exchange by up to a factor of 4. Exclusive χ c J electroproduction at the high luminosity Electron-Ion Collider occurs with well measurable rates and measurements of these processes should find evidence for the perturbative odderon exchange. We also compute the total electroproduction cross section as a function of energy and provide first estimates of the number of χ c J events per month at the Electron-Ion Collider design luminosity. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Hutchinson Trace Estimation for high-dimensional and high-order Physics-Informed Neural Networks

Physics-Informed Neural Networks (PINNs) have proven effective in solving partial differential equations (PDEs), especially when some data are available by seamlessly blending data and physics. However, extending PINNs to high-dimensional and even high-order PDEs encounters significant challenges due to the computational cost associated with automatic differentiation in the residual loss function calculation. Herein, we address the limitations of PINNs in handling high-dimensional and high-order PDEs by introducing the Hutchinson Trace Estimation (HTE) method. Starting with the second-order high-dimensional PDEs, which are ubiquitous in scientific computing, HTE is applied to transform the calculation of the entire Hessian matrix into a Hessian vector product (HVP). This approach not only alleviates the computational bottleneck via Taylor-mode automatic differentiation but also significantly reduces memory consumption from the Hessian matrix to an HVP’s scalar output. We further showcase HTE’s convergence to the original PINN loss and its unbiased behavior under specific conditions. Comparisons with the Stochastic Dimension Gradient Descent (SDGD) highlight the distinct advantages of HTE, particularly in scenarios with significant variability and variance among dimensions. We further extend the application of HTE to higher-order and higher-dimensional PDEs, specifically addressing the biharmonic equation. By employing tensor-vector products (TVP), HTE efficiently computes the colossal tensor associated with the fourth-order high-dimensional biharmonic equation, saving memory and enabling rapid computation. The effectiveness of HTE is illustrated through experimental setups, demonstrating comparable convergence rates with SDGD under memory and speed constraints. Additionally, HTE proves valuable in accelerating the Gradient-Enhanced PINN (gPINN) version as well as the Biharmonic equation. Overall, HTE opens up a new capability in scientific machine learning for tackling high-order and high-dimensional PDEs.

Curse of dimensionality↗
DOE OSTI2021

Tensor Text-Mining Methods for Malware Identification and Detection, Malware Dynamics Characterization, and Hosts Ranking

Malware is one of the most persistent and costly cyber threats endangering reputation, confidentiality, integrity, and availability for organizations and national security. Consequently, many of the incident detection and prevention systems, and incident responders have begun to utilize machine learning as a helper in the fight against malware and other cyber threats. However, cyber defenders rely on interpretability and generalizability, yet the popular machine learning methods are black-box and often use traditional supervised solutions that do not generalize to novel malware. Therefore, there is a need to improve the existing solutions. At the same time, the majority of the prior research ignored essential evaluation criteria when reporting the results of their methods, which disables the safe reproducibility of the methods in a production environment. Tensor decomposition, on the other hand, enables interpretable unsupervised analysis of the large-scale data for the discovery of hidden patterns. Our findings, performed on real-world and large-scale experiments, show that tensor factorization-based methods yield performance results that surpasses or competes with existing supervised solutions with the added benefit of interpretability and generalizability. With the ability to analyze complex and large-scale data using tensors, we report results that reflect real-world production environments. We propose to develop new game- changing tools for malware identification and characterization that can trace malware evolution, rank the infected or malicious hosts, and streamline the work of incident response teams, malware analysts, and incident detection and prevention systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

High-Energy Collision of Quarks and Mesons in the Schwinger Model: From Tensor Networks to Circuit QED

With the aim of studying nonperturbative out-of-equilibrium dynamics of high-energy particle collisions on quantum simulators, we investigate the scattering dynamics of lattice quantum electrodynamics in 1 + 1 dimensions. Working in the bosonized formulation of the model and in the thermodynamic limit, we use uniform-matrix-product-state tensor networks to construct multiparticle wave-packet states, evolve them in time, and detect outgoing particles post collision. This facilitates the numerical simulation of scattering experiments in both confined and deconfined regimes of the model at different energies, giving rise to rich phenomenology, including inelastic production of quark and meson states, meson disintegration, and dynamical string formation and breaking. We obtain elastic and inelastic scattering cross sections, together with time-resolved momentum and position distributions of the outgoing particles. Furthermore, we propose an analog circuit-QED implementation of the scattering process that is native to the platform, requires minimal ingredients and approximations, and enables practical schemes for particle wave-packet preparation and evolution. Furthermore, this study highlights the role of classical and quantum simulation in enhancing our understanding of scattering processes in quantum field theories in real time.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

A tensor train-based isogeometric solver for large-scale 3D poisson problems

We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Robust Tensor Hypercontraction of the Particle–Particle Ladder Term in Equation-of-Motion Coupled Cluster Theory

One method of representing a high-rank tensor as a (hyper-)product of lower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et al. This strategy has been found to be useful for reducing the polynomial scaling of coupled-cluster methods by representation of a four-dimensional tensor of electron-repulsion integrals in terms of five two-dimensional matrices. Pierce et al. have already shown that the application of a robust form of THC to the particle–particle ladder (PPL) term reduces the cost of this term in couple-cluster singles and doubles (CCSD) from O(N 6 ) to O(N 5 ) with negligible errors in energy with respect to the density-fitted variant. In this work, we have implemented the least-squares variant of THC (LS-THC) which does not require a nonlinear tensor factorization, including the robust form (R-LS-THC), for the calculation of the excitation and electron attachment energies using equation-of-motion coupled cluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked the effect of the R-LS-THC-PPL approximation on excitation energies using the comprehensive QUEST database and the accuracy of electron attachment energies using the NAB22 database. Here, we find that errors on the order of 1 meV are achievable with a reduction in total calculation time of approximately 5x.

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

Transversity Distributions and Tensor Charges of the Nucleon: Extraction from Dihadron Production and Their Universal Nature

We perform the first global quantum chromodynamics (QCD) analysis of dihadron production for a comprehensive set of data in electron-positron annihilation, semi-inclusive deep-inelastic scattering, and proton-proton collisions, from which we extract simultaneously the transversity distributions of the nucleon and π + π − dihadron fragmentation functions. We incorporate in our fits known theoretical constraints on transversity, namely, its small- x asymptotic behavior and the Soffer bound. We furthermore show that lattice-QCD results for the tensor charges can be successfully included in the analysis. This resolves the previously reported incompatibility between the tensor charges extracted from dihadron production data and lattice QCD. We also find agreement with results for the transversity and tensor charges obtained from measurements on single-hadron production. Overall, our work demonstrates for the first time the universal nature of all available information for the transversity distributions and the tensor charges of the nucleon. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 OSTI2022

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Approximate symmetries in d = 4 CFTs with an Einstein gravity dual

By applying the stress-tensor-scalar operator product expansion (OPE) twice, we search for algebraic structures in d = 4 conformal field theories (CFTs) with a pure Einstein gravity dual. We find that a rescaled mode operator defined by an integral of the stress tensor T ++ on a d = 2 plane satisfies a Virasoro-like algebra when the dimension of the scalar is large. The structure is enhanced to include a Kac-Moody-type algebra if we incorporate the T -- component. In our scheme, the central terms are finite. It remains challenging to directly compute the stress-tensor sector of d = 4 scalar four-point functions at large central charge, which, based on holography and bootstrap methods, were recently shown to have a Virasoro/ $\mathcal{W}$-algebra vacuum block-like structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 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 OSTI2022

Error-Bounded Learned Scientific Data Compression with Preservation of Derived Quantities

Scientific applications continue to grow and produce extremely large amounts of data, which require efficient compression algorithms for long-term storage. Compression errors in scientific applications can have a deleterious impact on downstream processing. Thus, it is crucial to preserve all the “known” Quantities of Interest (QoI) during compression. To address this issue, most existing approaches guarantee the reconstruction error of the original data or primary data (PD), but cannot directly control the problem of preserving the QoI. In this work, we propose a physics-informed compression technique that is composed of two parts: (i) reduction of the PD with bounded errors and (ii) preservation of the QoI. In the first step, we combine tensor decompositions, autoencoders, product quantizers, and error-bounded lossy compressors to bound the reconstruction error at high levels of compression. In the second step, we use constraint satisfaction post-processing followed by quantization to preserve the QoI. To illustrate the challenges of reducing the reconstruction errors of the PD and QoI, we focus on simulation data generated by a large-scale fusion code, XGC, which can produce tens of petabytes in a single day. The results show that our approach can achieve a high compression amount while accurately preserving the QoI within scientifically acceptable bounds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tensor renormalization group for fermions

Abstract We review the basic ideas of the tensor renormalization group method and show how they can be applied for lattice field theory models involving relativistic fermions and Grassmann variables in arbitrary dimensions. We discuss recent progress for entanglement filtering, loop optimization, bond-weighting techniques and matrix product decompositions for Grassmann tensor networks. The new methods are tested with two-dimensional Wilson–Majorana fermions and multi-flavor Gross–Neveu models. We show that the methods can also be applied to the fermionic Hubbard model in 1+1 and 2+1 dimensions.

Physics↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗