Search NASA⌕ Search

SEARCH · Search NASA

Results for “random tensors”

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 OSTI2024

Reflected entropy in random tensor networks. Part III. Triway cuts

For general random tensor network states at large bond dimension, we prove that the integer Rényi reflected entropies (away from phase transitions) are determined by minimal triway cuts through the network. This generalizes the minimal cut description of bipartite entanglement for these states. A natural extrapolation away from integer Rényi parameters, suggested by the triway cut problem, implies the holographic conjecture S R = 2EW, where S R is the reflected entropy and EW is the entanglement wedge cross-section. Minimal triway cuts can be formulated as integer programs which cannot be relaxed to find a dual maximal flow/bit-thread description. This sheds light on the gap between the existence of tripartite entanglement in holographic states and the bipartite entanglement structure motivated by bit-threads. In particular, we prove that the Markov gap that measures tripartite entanglement is lower bounded by the integrality gap of the integer program that computes the triway cut.

AdS-CFT correspondence↗
DOE OSTI2025

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗
DOE OSTI2025

Entanglement negativity and replica symmetry breaking in general holographic states

The entanglement negativity $\mathcal{E}$(A : B) is a useful measure of quantum entanglement in bipartite mixed states. In random tensor networks (RTNs), which are related to fixed-area states, it was found in ref. [1] that the dominant saddles computing the even Rényi negativity $\mathcal{E}$ (2k) generically break the ℤ 2k replica symmetry. This calls into question previous calculations of holographic negativity using 2D CFT techniques that assumed ℤ 2k replica symmetry and proposed that the negativity was related to the entanglement wedge cross section. In this paper, we resolve this issue by showing that in general holographic states, the saddles computing $\mathcal{E}$ (2k) indeed break the ℤ 2k replica symmetry.

AdS-CFT Correspondence↗
DOE OSTI2026

Living on the edge: a non-perturbative resolution to the negativity of bulk entropies

Lin, Maldacena, Rozenberg, and Shan (LMRS) presented a new information paradox in black hole physics by noticing that the entanglement and Rényi entropies in a two-sided black hole can become negative when the geometry contains a very large number of matter excitations behind the black hole horizon. While originally this puzzle was presented in the context of BPS two-sided black holes in two-dimensional supergravity, the negativity in fact persists for more general two-sided black holes in the presence of a large number of matter excitations. Since the entanglement and Rényi entropies in ordinary quantum systems cannot be negative, resolving this puzzle is a necessary step towards understanding the quantum mechanical description of black holes. In this paper, we explain how to address the entanglement negativity puzzle, both in the original setting discussed by LMRS and in more general non-supersymmetric settings, by summing over all non-perturbative contributions to the gravitational path integral. We then interpret this result from the point of view of a dual matrix integral, which we use to extend our analysis beyond the regime of validity of the genus re-summation performed in the gravitational path integral. In this regime, positivity is rescued by new saddles of the matrix integral, a one-eigenvalue instanton and a two-eigenvalue instanton. Finally, we formulate a similar puzzle and its resolution using random tensor network techniques.

2D Gravity↗
DOE OSTI2025

Hollow-grams: generalized entanglement wedges from the gravitational path integral

Recently, Bousso and Penington (BP) made a proposal for the entanglement wedge associated to a gravitating bulk region. In this paper, we derive this proposal in time-reflection symmetric settings using the gravitational path integral. To do this, we exploit the connection between random tensor networks (RTNs) and fixed-geometry states in gravity. We define the entropy of a bulk region in an RTN by removing tensors in that region and computing the entropy of the open legs thus generated in the “hollowed” RTN. We thus derive the BP proposal for RTNs and hence, also for fixed-geometry states in gravity. By then expressing a general holographic state as a superposition over fixed-geometry states and using a diagonal approximation, we provide a general gravitational path integral derivation of the BP proposal. We demonstrate that the saddles computing the Rényi entropy Sn depend on how the bulk region is gauge-invariantly specified. Nevertheless, we show that the BP proposal is universally reproduced in the n → 1 limit.

2D Gravity↗
DOE OSTI2025

Living on the edge: a non-perturbative resolution to the negativity of bulk entropies

Lin, Maldacena, Rozenberg, and Shan (LMRS) presented a new information paradox in black hole physics by noticing that the entanglement and Rényi entropies in a two-sided black hole can become negative when the geometry contains a very large number of matter excitations behind the black hole horizon. While originally this puzzle was presented in the context of BPS two-sided black holes in two-dimensional supergravity, the negativity in fact persists for more general two-sided black holes in the presence of a large number of matter excitations. Since the entanglement and Rényi entropies in ordinary quantum systems cannot be negative, resolving this puzzle is a necessary step towards understanding the quantum mechanical description of black holes. In this paper, we explain how to address the entanglement negativity puzzle, both in the original setting discussed by LMRS and in more general non-supersymmetric settings, by summing over all non-perturbative contributions to the gravitational path integral. We then interpret this result from the point of view of a dual matrix integral, which we use to extend our analysis beyond the regime of validity of the genus re-summation performed in the gravitational path integral. In this regime, positivity is rescued by new saddles of the matrix integral, a one-eigenvalue instanton and a two-eigenvalue instanton. Finally, we formulate a similar puzzle and its resolution using random tensor network techniques.

FOS: Physical sciences↗
DOE OSTI2025

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

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

Loop series expansions for tensor networks

Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this article, we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of infinite projected entangled pair states, either representing the ground state of an Affleck-Kennedy-Lieb-Tasaki (AKLT) model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude while incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.

Evenbly, Glen [AWS Center for Quantum Computing, P↗
DOE OSTI2024

Elliptically-Contoured Tensor-variate Distributions with Application to Image Learning

Statistical analysis of tensor-valued data has largely used the tensor-variate normal (TVN) distribution that may be inadequate for data arising from distributions with heavier or lighter tails. We study a general family of elliptically contoured (EC) TV distributions and derive its characterizations, moments, marginal, and conditional distributions. We describe procedures for maximum likelihood estimation from data that are (1) uncorrelated draws from an EC distribution, (2) from a scale mixture of the TVN distribution, and (3) from an underlying but unknown EC distribution, for which we extend Tyler’s robust estimator. A detailed simulation study highlights the benefits of choosing an EC distribution over the TVN for heavier-tailed data. We develop TV classification rules using discriminant analysis and EC errors and show that they better predict cats and dogs from images in the Animal Faces-HQ dataset than the TVN-based rules. A novel tensor-on-tensor regression and TV analysis of variance (TANOVA) framework under EC errors is also demonstrated to better characterize gender, age, and ethnic origin than the usual TVN-based TANOVA in the celebrated labeled faces of the wild dataset.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Microgravity and Charge Transfer in the Neuronal Membrane: Implications for Computational Neurobiology

Evidence from natural and artificial membranes indicates that the neural membrane is a liquid crystal. A liquid-to-gel phase transition caused by the application of superposed electromagnetic fields to the outer membrane surface releases spin-correlated electron pairs which propagate through a charge transfer complex. The propagation generates Rydberg atoms in the lipid bilayer lattice. In the present model, charge density configurations in promoted orbitals interact as cellular automata and perform computations in Hilbert space. Due to the small binding energies of promoted orbitals, their automata are highly sensitive to microgravitational perturbations. It is proposed that spacetime is classical on the Rydberg scale, but formed of contiguous moving segments, each of which displays topological equivalence. This stochasticity is reflected in randomized Riemannian tensor values. Spacetime segments interact with charge automata as components of a computational process. At the termination of the algorithm, an orbital of high probability density is embedded in a more stabilized microscopic spacetime. This state permits the opening of an ion channel and the conversion of a quantum algorithm into a macroscopic frequency code.

Wallace, Ron↗
DOE OSTI2026

Poisson-response Tensor-on-Tensor Regression and Applications

We introduce Poisson-response tensor-on-tensor regression (PToTR), a novel regression framework designed to handle tensor responses composed element-wise of random Poisson-distributed counts. Tensors, or multi-dimensional arrays, composed of counts are common data in fields such as inter national relations, social networks, epidemiology, and medical imaging, where events occur across multiple dimensions like time, location, and dyads. PToTR accommodates such tensor responses alongside tensor covariates, providing a versatile tool for multi dimensional data analysis. We propose algorithms for maximum likelihood estimation under a canonical polyadic (CP) structure on the regression coefficient tensor that satisfy the positivity of Poisson parameters and then provide an initial theoretical error analysis for PToTR estimators. We also demonstrate the utility of PToTR through three concrete applications: longitudinal data analysis of the Integrated Crisis Early Warning System database, positron emission tomography (PET) image reconstruction, and change-point detection of communication patterns in longitudinal dyadic data. These applications highlight the versatility of PToTR in addressing complex, structured count data across various domains.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Variational finite element-tensor formulation for the large deflection random vibration of composite plates

A numerical integration routine is derived from a set of unified single step integration algorithms using a weighted satisfaction of the equilibrium equation governing the large deflection random response of laminated composite plates. The equilibrium equation is derived using a constant matrix large deflection finite-element formulation. In-plane inertia terms are considered in the formulation, however, rotary inertia terms are assumed negligible. Probability density, spectral density and autocorrelation functions of the maximum displacement and strain responses are presented for three acoustic excitation levels. Classical thin plate boundary conditions and pseudo white noise excitation are used in this investigation.

Robinson, Jay H.↗
NASA NTRS1990

Remote sensing of Earth terrain

The layered random medium model is used to investigate the fully polarimetric scattering of electromagnetic waves from vegetation. The vegetation canopy is modeled as an anisotropic random medium containing nonspherical scatterers with preferred alignment. The underlying medium is considered as a homogeneous half space. The scattering effect of the vegetation canopy are characterized by 3-D correlation functions with variances and correlation lengths respectively corresponding to the fluctuation strengths and the physical geometries of the scatterers. The strong fluctuation theory is used to calculate the anisotropic effective permittivity tensor of the random medium and the distorted Born approximation is then applied to obtain the covariance matrix which describes the fully polarimetric scattering properties of the vegetation field. This model accounts for all the interaction processes between the boundaries and the scatterers and includes all the coherent effects due to wave propagation in different directions such as the constructive and destructive interferences. For a vegetation canopy with low attenuation, the boundary between the vegetation and the underlying medium can give rise to significant coherent effects.

Kong, Jin AU↗
NASA NTRS2000

Inertial Effects in Suspension Dynamics

The present work analyses the dynamics of a suspension of heavy particles in shear flow. The magnitude of the particle inertia is given by the Stokes number St = m(gamma/6(pi)a, which is the ratio of the viscous relaxation time of a particle tau(sub p) = m=6pi(eta)a to the flow time gamma(sup -1). Here, m is the mass of the particle, a is its size, eta is the viscosity of the suspending fluid and gamma is the shear rate. The ratio of the Stokes number to the Reynolds number, Re = (rho)f(gamma)a(exp 2)/eta, is the density ratio rho(sub p)/rho(sub f). Of interest is to understand the separate roles of particle (St) and fluid (Re) inertia in the dynamics of suspensions. In this study we focus on heavy particles, rho(sub p)/rho(sub f) much greater than 1, for which the Stokes number is finite, but the Reynolds number is sufficiently small for inertial forces in the fluid to be neglected; thus, the fluid motion is governed by the Stokes equations. On the other hand, the probability density governing the statistics of the suspended particles satisfies a Fokker-Planck equation that accounts for both configuration and momentum coordinates, the latter being essential for finite St. The solution of the Fokker-Planck equation is obtained to O(St) via a Chapman-Enskog type-procedure, and the conditional velocity distribution so obtained is used to derive a configuration-space Smoluchowski equation with inertial corrections. The inertial effects are responsible for asymmetry in the relative trajectories of two spheres in shear flow, in contrast to the well known symmetric structure in the absence of inertia. Finite St open trajectories in the plane of shear suffer a downward lateral displacement resulting from the inability of a particle of finite mass to follow the curvature of the zero-Stokes-number pathlines. In addition to the induced asymmetry, the O(St) inertial perturbation dramatically alters the nature of the near-field trajectories. The stable closed orbits (for St = 0) in the plane of shear now spiral in, approaching particle-particle contact in the limit. All trajectories starting from an initial offset of O(St(sup 1/2) or less (which remain open for St = 0) also spiral in. The asymmetry of the trajectories leads to a non-Newtonian rheology and diffusive behavior. The latter because a given particle (moving along a finite St open trajectory) suffers a net displacement in the transverse direction after a single interaction. A sequence of such uncorrelated displacements leads to the particle executing a random walk. The inertial diffusivity tensor is anisotropic on account of differing strengths of interaction in the gradient and vorticity directions. Since the entire region (constituting an in finite area) of closed orbits in the plane of shear spirals onto contact for #finite St, the latter represents a singular surface for the pair-distribution function. The exact form of the pair-distribution function at contact is still, however, indeterminate in the absence of non-hydrodynamic effects. It should also be noted that finite St non-rectilinear flows do not support a spatially uniform number density owing to the cross-streamline inertial migration of particles.

J. F. Brady↗