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 37 records · Page 2

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

Lightweight and effective tensor sensitivity for atomistic neural networks

Atomistic machine learning focuses on the creation of models that obey fundamental symmetries of atomistic configurations, such as permutation, translation, and rotation invariances. In many of these schemes, translation and rotation invariance are achieved by building on scalar invariants, e.g., distances between atom pairs. There is growing interest in molecular representations that work internally with higher rank rotational tensors, e.g., vector displacements between atoms, and tensor products thereof. Here, we present a framework for extending the Hierarchically Interacting Particle Neural Network (HIP-NN) with Tensor Sensitivity information (HIP-NN-TS) from each local atomic environment. Crucially, the method employs a weight tying strategy that allows direct incorporation of many-body information while adding very few model parameters. We show that HIP-NN-TS is more accurate than HIP-NN, with negligible increase in parameter count, for several datasets and network sizes. As the dataset becomes more complex, tensor sensitivities provide greater improvements to model accuracy. In particular, HIP-NN-TS achieves a record mean absolute error of 0.927 $\frac{\text{kcal}}{\text{mol}}$ for conformational energy variation on the challenging COMP6 benchmark, which includes a broad set of organic molecules. We also compare the computational performance of HIP-NN-TS to HIP-NN and other models in the literature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Universal bounds on CFT Distance Conjecture

For any unitary conformal field theory in two dimensions with the central charge c, we prove that, if there is a nontrivial primary operator whose conformal dimension ∆ vanishes in some limit on the conformal manifold, the Zamolodchikov distance t to the limit is infinite, the approach to this limit is exponential ∆ = exp(−αt + O(1)), and the decay rate obeys the universal bounds c−1/2 ≤ α ≤ 1. In the limit, we also find that an infinite tower of primary operators emerges without a gap above the vacuum and that the conformal field theory becomes locally a tensor product of a sigma-model in the large radius limit and a compact theory. As a corollary, we establish a part of the Distance Conjecture about gravitational theories in three-dimensional anti-de Sitter space. In particular, our bounds on α indicate that the emergence of exponentially light states is inevitable as the moduli field corresponding to t rolls beyond the Planck scale along the steepest path and that this phenomenon can begin already at the curvature scale of the bulk geometry. We also comment on implications of our bounds for gravity in asymptotically flat spacetime by taking the flat space limit and compare with the Sharpened Distance Conjecture.

AdS-CFT Correspondence↗

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by utilizing the simultaneous pinching method. Here, we construct one-shot codes for various scenarios and find achievable rate regions relying on various quantum Rényi mutual information error exponents. Our investigation includes a comprehensive study of pinching across tensor product spaces, presenting our findings as the asymptotic counterpart to our one-shot codes. By employing the non-unique decoding, we also establish a simpler proof to Marton’s inner bound for two-receiver quantum broadcast channels without the need for more involved techniques. Additionally, we derive no-go results and demonstrate their tightness in special cases.

Salek, Farzin [Technical University of Munich (Ger↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

A higher-order finite-element implementation of the nonlinear Fokker–Planck collision operator for charged particle collisions in a low density plasma

Collisions between particles in a low density plasma are described by the Fokker–Planck collision operator. In applications, this nonlinear integro-differential operator is often approximated by linearised or ad-hoc model operators due to computational cost and complexity. In this work, we present an implementation of the nonlinear Fokker–Planck collision operator written in terms of Rosenbluth potentials in the Rosenbluth–MacDonald–Judd (RMJ) form. The Rosenbluth potentials may be obtained either by direct integration or by solving partial differential equations (PDEs) similar to Poisson's equation: we optimise for performance and scalability by using sparse matrices to solve the relevant PDEs. We represent the distribution function using a tensor-product continuous-Galerkin finite-element representation and we derive and describe the implementation of the weak form of the collision operator. We present tests demonstrating a successful implementation using an explicit time integrator and we comment on the speed and accuracy of the operator. Finally, we speculate on the potential for applications in the current and next generation of kinetic plasma models.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Definitive Assessment of the Accuracy, Variationality, and Convergence of Relativistic Coupled Cluster and Density Matrix Renormalization Group in 100-Orbital Space

Accuracy, variationality, and convergence underpin the reliability of modern electronic structure methods, yet definitive benchmarks in the relativistic regime remain elusive due to the absence of numerically exact full configuration interaction (CI) references. Recent algorithmic advances in the CI framework, enabled by the small-tensor-product (STP) decomposition approach, have dramatically extended the tractable size of the configuration space, making numerically exact CI calculations feasible in large active spaces previously beyond reach. In this paper, we employ the recently developed STP-CI framework to perform large-scale numerically exact CI calculations and directly benchmark relativistic coupled cluster and density matrix renormalization group methods. Definitive benchmarking of approximate relativistic electronic structure methods is ensured through the application of the gap theorem, which provides rigorous error bounds on the CI reference and establishes a controlled standard for assessing accuracy, variationality, and convergence.

Chemical calculations↗

Numerically exact configuration interaction at quadrillion-determinant scale

The combinatorial growth of configuration interaction (CI) has long limited this formally exact quantum chemistry method to only the smallest molecules. Here, we report a numerically exact CI calculation exceeding one quadrillion (10 15 ) determinants, made possible by a lossless categorical compression strategy within the small-tensor-product distributed active space (STP-DAS) framework. This approach overcomes the traditional memory bottlenecks of CI by a numerically exact compression of the wavefunction representation and reformulating the most computationally demanding matrix–vector operations. Using this method, we performed a fully relativistic CI calculation of the ground state of HBrTe with over 10 15 complex-valued determinants in just 34.5 h on 1000 computing nodes—the largest CI calculation ever reported. We further achieved fast computation for systems with hundreds of billions of determinants on only a few compute nodes. Extensive benchmarks confirm that the method retains full numerical exactness while cutting memory and computational cost by orders of magnitude. Compared to previous state-of-the-art CI calculations, this work achieves a 1000 times increase in CI space, a 10 6 -fold increase in floating-point operations performed, and a 10 6 -fold improvement in computational speed.

Computational chemistry↗

Symmetry-projected cluster mean-field theory applied to spin systems

We introduce S z spin-projection based on cluster mean-field theory and apply it to the ground state of strongly correlated spin systems. In cluster mean-fields, the ground state wavefunction is written as a factorized tensor product of optimized cluster states. In previous work, we have focused on unrestricted cluster mean-field, where each cluster is S z symmetry adapted. We here remove this restriction by introducing a generalized cluster mean-field (GcMF) theory, where each cluster is allowed to access all S z sectors, breaking S z symmetry. In addition, a projection scheme is used to restore global S z , which gives rise to the S z spin-projected generalized cluster mean-field (S z GcMF). Both of these extensions contribute to accounting for inter-cluster correlations. We benchmark these methods on the 1D, quasi-2D, and 2D J 1 – J 2 and XXZ Heisenberg models. Furthermore, our results indicate that the new methods (GcMF and S z GcMF) provide a qualitative and semi-quantitative description of the Heisenberg lattices in the regimes considered, suggesting them as useful references for further inter-cluster correlations, which are discussed in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The polarized-signal density matrix: A practical way to recover molecular frame information from isotropic samples

We present a novel approach to model ultrafast time-dependent nonlinear optical polarization sensitive signals emitted from randomly oriented molecules. By projecting the laboratory-frame analyzer polarization axis into the molecular-frame and linking that axis with the density matrix through a tensor product, we demonstrate an approach to find a specific molecular orientation that yields a good approximation to simulated four-wave mixing signals produced by the same model but with averaging over molecular orientation.

Thurston, Richard L↗

Discovering Active Subspaces for High-Dimensional Computer Models

Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. While sensible in some settings, this approach has obvious drawbacks. Recent research has demonstrated that active subspace calculations can be obtained in closed form, conditional on a Gaussian process (GP) surrogate, which can be limiting in high-dimensional settings for computational reasons. In this paper, we produce the relevant calculations for a more general case when the model of interest is a linear combination of tensor products. These general equations can be applied to the GP, recovering previous results as a special case, or applied to the models constructed by other regression techniques including multivariate adaptive regression splines (MARS). Furthermore, using a MARS surrogate has many advantages including improved scaling, better estimation of active subspaces in high dimensions and the ability to handle a large number of prior distributions in closed form. In one real-world example, we obtain the active subspace of a radiation-transport code with 240 inputs and 9,372 model runs in under half an hour.

97 MATHEMATICS AND COMPUTING↗

Generalized Hall conductivities in local commuting projector models: Generalized symmetries and protected surface modes

Hall conductivities are important characterizations of phases of matter. It is known that nonzero Hall conductivities are difficult to realize in local commuting projector lattice models due to no-go theorems in (2+1)⁢D. In this work we construct local commuting projector models in (2+1)⁢D and (3+1)⁢D with nonzero generalized Hall conductivities for ordinary and higher-form continuous symmetries on tensor product Hilbert space of finite local dimension. The model is given by a standard ℤ 𝑁 toric code, but the symmetries do not admit expression in terms of on-site charge operators. The symmetry do not have local charges or currents on the lattice in the absence of boundaries, but there is still a notion of Hall conductivities that coincide with the continuum field theories. We construct protected gapless boundaries of the lattice models using modified Villain formalism. The generalized Hall conductivities are computed by surface currents as well as bulk flux insertion and many-body Chern number.

Anomalies↗

Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage

Here, we show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on “thermodynamic codes” to general local spin and different irreducible representations using only properties of the angular momentum algebra, we obtain bounds on the code inaccuracy under generic noise on any known 𝑑 sites, under independent and identically distributed noise, and under heralded 𝑑-local erasures. We demonstrate that this family of codes protects a probe state with quantum Fisher information surpassing the standard quantum limit when the sensing parameter couples to the generator of the U(1) logical gate.

quantum error correction↗

Spontaneously Broken Noninvertible Symmetries in Transverse-Field Ising Qudit Chains

Recent developments have revealed that symmetries need not form a group, but instead can be noninvertible. Here we use analytical arguments and numerical evidence to illuminate how spontaneous symmetry breaking of a noninvertible symmetry is similar yet distinct from ordinary, invertible, symmetry breaking. We consider one-dimensional chains of group-valued qudits, whose local Hilbert space is spanned by elements of a finite group 𝐺 (reducing to ordinary qubits when 𝐺=ℤ 2 ). We construct Ising-type transverse-field Hamiltonians with Rep⁡(𝐺) symmetry whose generators multiply according to the tensor product of irreducible representations (irreps) of the group 𝐺 . For non-Abelian 𝐺 , the symmetry is noninvertible. In the symmetry broken phase there is one ground state per irrep on a closed chain. The symmetry breaking can be detected by local order parameters but, unlike the invertible case, different ground states have distinct entanglement patterns. We show that for each irrep of dimension greater than one the corresponding ground state exhibits string order, entanglement spectrum degeneracies, and has gapless edge modes on an open chain—features usually associated with symmetry-protected topological order. Consequently, domain wall excitations behave as one-dimensional non-Abelian anyons with nontrivial internal Hilbert spaces and fusion rules. Our Letter identifies properties of noninvertible symmetry breaking that existing quantum hardware can probe.

1-dimensional spin chains↗

Entanglement structures in quantum field theories: Negativity cores and bound entanglement in the vacuum

Here, the many-body entanglement between two finite (size-d) disjoint vacuum regions of noninteracting lattice scalar field theory in one spatial dimension, i.e., a (d A × d B ) mixed Gaussian continuous variable system, is locally transformed into a tensor-product core of (1 A × 1 B ) mixed entangled pairs. Accessible entanglement within these core pairs exhibits an exponential hierarchy and as such identifies the structure of dominant region modes from which vacuum entanglement could be extracted into a spatially separated pair of quantum detectors. Beyond the core, the remaining modes of the halo are determined to be AB separable in isolation, as well as separable from the core. However, state preparation protocols that distribute entanglement in the form of (1 A × 1 B ) mixed core pairs are found to require additional entanglement in the halo that is obscured by classical correlations. This inaccessible (bound) halo entanglement is found to mirror the accessible entanglement, but with a step behavior as the continuum is approached. It remains possible that alternate initialization protocols that do not utilize the exponential hierarchy of core-pair entanglement may require less inaccessible entanglement. Entanglement consolidation is expected to persist in higher dimensions and may aid classical and quantum simulations of asymptotically free gauge field theories, such as quantum chromodynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric integration of classical spin dynamics via a mean-field Schrödinger equation

The Landau-Lifshitz equation describes the time evolution of magnetic dipoles and can be derived by taking the classical limit of a quantum mechanical spin Hamiltonian. To take this limit, one constrains the many-body quantum state to a tensor product of coherent states, thereby neglecting entanglement between sites. Expectation values of the quantum spin operators produce the usual classical spin dipoles. One may also consider expectation values of polynomials of the spin operators, leading to quadrupole and higher-order spin moments, which satisfy a dynamical equation of motion that generalizes the Landau-Lifshitz dynamics [Zhang and Batista, Phys. Rev. B 104, 104409 (2021)]. Here we reformulate the dynamics of these N 2 –1 generalized spin components as a mean-field Schrödinger equation on the N-dimensional coherent state. Furthermore, this viewpoint suggests efficient integration methods that respect the local symplectic structure of the classical spin dynamics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Wave functions of multiquark hadrons from representations of the symmetry groups S n

Construction of the wave functions of multiquark hadrons by a traditional method based on the tensor products of colors, flavors, spins (and orbital) parts becomes quite complex when quark numbers grow n = 5 , 6 … 12 , as it gets difficult to satisfy the requirements of Fermi statistics. Our novel approach is focused directly on representations of the permutation symmetry generators. After showing how C 3 is manifested in the wave functions of (excited) baryons, we use it to construct the wave functions for a set of pentaquarks and hexaquarks ( n = 5 , 6 ). We also have some partial results for larger systems, with n = 9 and 12, and even beyond that as far as n = 24 . Published by the American Physical Society 2024

Miesch, Nicholas (ORCID:0000000205937535)↗