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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

MIONet: Learning Multiple-Input Operators via Tensor Product

As an emerging paradigm in scientific machine learning, neural operators aim to learn operators, via neural networks, that map between infinite-dimensional function spaces. Several neural operators have been recently developed. However, all the existing neural operators are only designed to learn operators defined on a single Banach space; i.e., the input of the operator is a single function. Here, for the first time, we study the operator regression via neural networks for multiple-input operators defined on the product of Banach spaces. We first prove a universal approximation theorem of continuous multiple-input operators. We also provide a detailed theoretical analysis including the approximation error, which provides guidance for the design of the network architecture. Based on our theory and a low-rank approximation, we propose a novel neural operator, MIONet, to learn multiple-input operators. MIONet consists of several branch nets for encoding the input functions and a trunk net for encoding the domain of the output function. Here, we demonstrate that MIONet can learn solution operators involving systems governed by ordinary and partial differential equations. In our computational examples, we also show that we can endow MIONet with prior knowledge of the underlying system, such as linearity and periodicity, to further improve accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum Tensor-Product Decomposition from Choi-State Tomography

The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt or tensor-product decomposition. While quantum technological implementations of the former are thoroughly studied, entangling properties on the operator level are harder to extract in the quantum computational framework because of the exponential nature of sample complexity. Here, we present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor-product decomposition of a unitary the effect of which on the small subsystem is captured in classical memory, while the effect on the environment is accessible as a quantum resource. This quantum algorithm may be used to make predictions about operator nonlocality and effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries. We demonstrate the method and its applications on a time-evolution unitary of an isotropic Heisenberg model in two dimensions. Published by the American Physical Society 2024

Mansuroglu, Refik (ORCID:000000017352513X)↗
DOE OSTI2024

Non-invertible symmetries and LSM-type constraints on a tensor product Hilbert space

We discuss the exact non-invertible Kramers-Wannier symmetry of 1+1d lattice models on a tensor product Hilbert space of qubits. This symmetry is associated with a topological defect and a conserved operator, and the latter can be presented as a matrix product operator. Importantly, unlike its continuum counterpart, the symmetry algebra involves lattice translations. Consequently, it is not described by a fusion category. In the presence of this defect, the symmetry algebra involving parity/time-reversal is realized projectively, which is reminiscent of an anomaly. Different Hamiltonians with the same lattice non-invertible symmetry can flow in their continuum limits to infinitely many different fusion categories (with different Frobenius-Schur indicators), including, as a special case, the Ising CFT. The non-invertible symmetry leads to a constraint similar to that of Lieb-Schultz-Mattis, implying that the system cannot have a unique gapped ground state. It is either in a gapless phase or in a gapped phase with three (or a multiple of three) ground states, associated with the spontaneous breaking of the lattice non-invertible symmetry.

Seiberg, Nathan (ORCID:000000033897046X)↗
DOE OSTI2024

Small tensor product distributed active space (STP-DAS) framework for relativistic and non-relativistic multiconfiguration calculations: Scaling from 10 9 on a laptop to 10 12 determinants on a supercomputer

Despite the power and flexibility of configuration interaction (CI) based methods in computational chemistry, their broader application is limited by an exponential increase in both computational and storage requirements, particularly due to the substantial memory needed for excitation lists that are crucial for scalable parallel computing. Here, the objective of this work is to develop a new CI framework, namely, the small tensor product distributed active space (STP-DAS) framework, aimed at drastically reducing memory demands for extensive CI calculations on individual workstations or laptops, while simultaneously enhancing scalability for extensive parallel computing. Moreover, the STP-DAS framework can support various CI-based techniques, such as complete active space (CAS), restricted active space, generalized active space, multireference CI, and multireference perturbation theory, applicable to both relativistic (two- and four-component) and non-relativistic theories, thus extending the utility of CI methods in computational research. We conducted benchmark studies on a supercomputer to evaluate the storage needs, parallel scalability, and communication downtime using a realistic exact-two-component CASCI (X2C-CASCI) approach, covering a range of determinants from 10 9 to 10 12 . Additionally, we performed large X2C-CASCI calculations on a single laptop and examined how the STP-DAS partitioning affects performance.

Complete-active space self-consistent field↗
DOE OSTI2023

Tencoder: tensor-product encoder-decoder architecture for predicting solutions of PDEs with variable boundary data

It is widely hoped that artificial intelligence will boost data-driven surrogate models in science and engineering. However, fundamental spatial aspects of AI surrogate models remain under-studied. We investigate the ability of neural-network surrogate models to predict solutions to PDEs under variable boundary values. We do not wish to retrain the model when the boundary values change but to make them inputs to the model and infer the solution of the PDE under those boundary conditions. Such a capability is essential to making AI-based surrogate models practically useful. While simple feedforward networks are used for one-dimensional (1D) Poisson equation, an encoder-decoder architecture with a tensor-product layer is developed for the two-dimensional Poisson equation posed on a rectangular domain. We show that it is indeed possible to infer solutions to PDEs from variable boundary data using neural networks in this relatively simple setting, and point to future directions.

Kashi, Aditya↗
DOE OSTI2024

Preserving Superconvergence of Spectral Elements for Curved Domains

Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using geometric refinement, which both refines the mesh near high-curvature regions and increases the degree of geometric basis functions. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce ApSEM, a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and 3D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries. We also show the efficiency of ApSEM as it can recover superconvergence in nodal solutions without drastically increasing the computational cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Preserving Superconvergence of Spectral Elements for Curved Domains via $h$ and $p$-Geometric Refinement

Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using h- and p-geometric refinement, which refines the mesh near high-curvature regions and increases the degree of geometric basis functions, respectively. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The stranger things of symmetric product orbifold CFTs

Symmetric product orbifold theories are valuable due to their universal features at large N. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within their moduli space. To this end, we consider the symmetric product orbifold of tensor products of N = 2 super-Virasoro minimal models, and classify them according to two criteria. The first criterion is the existence of a single-trace twisted exactly marginal operator that triggers the deformation. The second criterion is a sparseness condition on the growth of light states in the elliptic genera. In this context we encounter a strange variety: theories that obey the first criterion but the second criterion falls into a Hagedorn-like growth. We explain why this may be counter-intuitive and discuss how it might be accounted for in conformal perturbation theory. We also find a new infinite class of theories that obey both criteria, which are necessary conditions for each moduli space to contain a supergravity point.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Spinbox: tools for many-body quantum systems in a Monte Carlo context

Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations

Fox, Jordan↗
DOE OSTI2025

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗
DOE OSTI2023

Learning local equivariant representations for large-scale atomistic dynamics

Abstract A simultaneously accurate and computationally efficient parametrization of the potential energy surface of molecules and materials is a long-standing goal in the natural sciences. While atom-centered message passing neural networks (MPNNs) have shown remarkable accuracy, their information propagation has limited the accessible length-scales. Local methods, conversely, scale to large simulations but have suffered from inferior accuracy. This work introduces Allegro, a strictly local equivariant deep neural network interatomic potential architecture that simultaneously exhibits excellent accuracy and scalability. Allegro represents a many-body potential using iterated tensor products of learned equivariant representations without atom-centered message passing. Allegro obtains improvements over state-of-the-art methods on QM9 and revMD17. A single tensor product layer outperforms existing deep MPNNs and transformers on QM9. Furthermore, Allegro displays remarkable generalization to out-of-distribution data. Molecular simulations using Allegro recover structural and kinetic properties of an amorphous electrolyte in excellent agreement with ab-initio simulations. Finally, we demonstrate parallelization with a simulation of 100 million atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum magic and computational complexity in the neutrino sector

We consider the quantum magic in systems of dense neutrinos undergoing coherent flavor transformations, relevant for supernova and neutron-star binary mergers. Mapping the three-flavor-neutrino system to qutrits, the evolution of quantum magic is explored in the single scattering angle limit for a selection of initial tensor-product pure states for 𝑁 𝜈 ≤ 8 neutrinos. For |𝜈𝑒⟩ ⊗𝑁𝜈 initial states, the magic, as measured by the 𝛼 = 2 stabilizer Renyi entropy ℳ 2 , is found to decrease with radial distance from the neutrino sphere, reaching a value that lies below the maximum for tensor-product qutrit states. Further, the asymptotic magic per neutrino, ℳ 2 /𝑁 𝜈 , decreases with increasing 𝑁 𝜈 . In contrast, the magic evolving from states containing all three flavors reaches values only possible with entanglement, with the asymptotic ℳ 2 /𝑁 𝜈 increasing with 𝑁 𝜈 . These results highlight the connection between the complexity in simulating quantum physical systems and the parameters of the Standard Model.

computational complexity↗
DOE OSTI2024

One- and two-dimensional higher-point conformal blocks as free-particle wavefunctions in $$ {\textrm{AdS}}_3^{\otimes m} $$

Abstract We establish that all of the one- and two-dimensional global conformal blocks are, up to some choice of prefactor, free-particle wavefunctions in tensor products of AdS 3 or limits thereof. Our first core observation is that the six-point comb-channel conformal blocks correspond to free-particle wavefunctions on an AdS 3 constructed directly in cross-ratio space. This construction generalizes to blocks for a special class of diagrams, which are determined as free-particle wavefunctions in tensor products of AdS 3 . Conformal blocks for all the remaining topologies are obtained as limits of the free wavefunctions mentioned above. Our results show directly that the integrable models associated with all one- and two-dimensional conformal blocks can be seen as limits of free theory, and manifest a relation between AdS and CFT kinematics that lies outside of the standard AdS/CFT dictionary. We complete the discussion by providing explicit Feynman-like rules that can be used to work out blocks for all topologies, as well as a Mathematica notebook that allows simple computation of Casimir equations and series expansions for blocks, by requiring just an OPE diagram as input.

Physics↗
DOE OSTI2026

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗
DOE OSTI2025

The algebraic structure of gravitational scrambling

We introduce a new algebraic framework to describe gravitational scrambling, including the semiclassical limit of any out-of-time-order correlation function that is built out of operator insertions separated by approximately the scrambling time. In two dimensions, the scrambling algebra, which we call a modular-twisted product, is defined in terms of two copies of the Leutheusser-Liu half-sided modular inclusion of von Neumann algebras; these describe early- and late-time operators respectively. In limits where the separation between insertions is taken to be either significantly greater or smaller than the scrambling time, the modular-twisted product reduces, respectively, to free- and tensor-product algebras that were previously studied in [arXiv:2209.10454]. In a sense, the modular-twisted product interpolates between these two products. Including the Hamiltonian in the scrambling algebra leads to a Type II$_\infty$ von Neumann algebra with finite renormalized entropies that interpolate between single-QES and multi-QES phases. We also describe how to generalize the modular-twisted product algebra to higher dimensions, including spatially localized boundary excitations.

FOS: Physical sciences↗