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 73 records · Page 4

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↗

Frontal Slice Approaches for Tensor Linear Systems

Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} ∗\mathcal{X} = \mathcal{B}$ where ∗ denotes the $t$-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.

Luo, Hengrui↗

QuTree: A tree tensor network package

Here we present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Certifying almost all quantum states with few single-qubit measurements

Certifying that an n -qubit state synthesized in the laboratory is close to a given target state is a fundamental task in quantum information science. However, existing rigorous protocols applicable to general target states have potentially prohibitive resource requirements in the form of either deep quantum circuits or exponentially many single-qubit measurements. Here we prove that almost all n -qubit target states, including those with exponential circuit complexity, can be certified from only O ( n 2 ) single-qubit measurements. Given access to the target state’s amplitudes, our protocol requires only O ( n 3 ) classical computation. This result is established by a technique that relates certification to the mixing time of a random walk. Our protocol has applications for benchmarking quantum systems, for optimizing quantum circuits to generate a desired target state and for learning and verifying neural networks, tensor networks and various other representations of quantum states using only single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties of a synthesized state that would otherwise require an exponential number of measurements on the state. We demonstrate these applications in numerical experiments with up to 120 qubits and observe an advantage over existing methods such as cross-entropy benchmarking.

information theory and computation↗

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↗

Probing Postmeasurement Entanglement without Postselection

We study the problem of observing quantum collective phenomena emerging from large numbers of measurements. These phenomena are difficult to observe in conventional experiments because, in order to distinguish the effects of measurement from dephasing, it is necessary to postselect on sets of measurement outcomes with Born probabilities that are exponentially small in the number of measurements performed. An unconventional approach, which avoids this exponential “postselection problem”, is to construct cross-correlations between experimental data and the results of simulations on classical computers. However, these cross-correlations generally have no definite relation to physical quantities. We first show how to incorporate classical shadows into this framework, thereby allowing for the construction of quantum information-theoretic cross-correlations. We then identify cross-correlations that both upper and lower bound the measurement-averaged von Neumann entanglement entropy, as well as cross-correlations that lower bound the measurement-averaged purity and entanglement negativity. These bounds show that experiments can be performed to constrain postmeasurement entanglement without the need for postselection. To illustrate our technique, we consider how it could be used to observe the measurement-induced entanglement transition in Haar-random quantum circuits. We use exact numerical calculations as proxies for quantum simulations and, to highlight the fundamental limitations of classical memory, we construct cross-correlations with tensor-network calculations at finite bond dimension. Our results reveal a signature of measurement-induced criticality that can be observed using a quantum simulator in polynomial time and with polynomial classical memory. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effective Local Geometry Descriptor for 29Si NMR Q4 Anisotropy

The nuclear shielding anisotropy, ζ, is a useful nuclear magnetic resonance (NMR) shielding tensor parameter in describing the extent of electron cloud distortion about an atom. Despite the advantages afforded by NMR in structural characterization, the relationship between ζ and local structure of an atom in high-symmetry environments, such as Si-Q 4 sites, is poorly understood. Here, we use a data-driven approach combining random forest feature ranking and the Sure Independence Screening and Sparsifying Operator (SISSO) approach to derive a simple and accurate geometric descriptor for ζ with a root-mean-squared prediction error of 6.77 ppm and an R 2 of 0.761. We then apply this descriptor to describe the local geometric distortion of zeolites Sigma-2 and silica-ZSM-5 whose chemical shift anisotropy tensor has been reported. We envision that this geometric descriptor will allow for structural description and refinement in previously difficult-to-describe materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast tensor disentangling algorithm

Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.

Slagle, Kevin↗

Quantum criticality and topology in non-equilibrium systems

A key goal of condensed matter physics research is to identify new phases of matter, and to understand the universal features of the phase transitions between them. In the past decade, physicists have uncovered a wealth of new phases with interesting surface properties, exemplified by the theoretical prediction and subsequent experimental discovery of topological insulators and superconductors. Traditional condensed matter systems are usually in a thermal equilibrium state and typically at very low temperature. Very recently, experimental advances have sparked interest in the non-equilibrium setting. Non-equilibrium systems can host new phases and phenomena with no equilibrium counterpart, and could also enable robust ways to build quantum memory devices to store and manipulate quantum information in a coherent manner. These phases and phenomena are inherently “dynamical”: they are described not by changes in the arrangement or structure of the constituent particles, but instead marked by sharp distinctions in how the particles move and exchange energy or quantum information. The discovery of robust non-equilibrium phases raises many fundamental questions: Can we develop a systematic theory of states of matter and of dynamical transitions between such states? How can such states be realized and probed experimentally? The main goal of this project was to explore the emergence of topological phases and quantum criticality (two cornerstones of modern condensed matter physics in equilibrium) in such non-equilibrium quantum systems. Specific goals included (1) using tensor networks to efficiently represent non-equilibrium states of matter and their phase transitions; (2) studying and designing new probes for periodically driven systems; and (3) developing analytic and numerical tools to analyze non-equilibrium topological phase transitions. Advances in these directions were achieved using novel techniques appropriate to study the non-equilibrium dynamics in many-body quantum systems combining strong interactions and randomness. Taken together, these results provide a new conceptual framework for understanding the emergence of quantum critical and topological properties in quantum systems far from thermal equilibrium.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Calculation of the detonation state of HN 3 with quantum accuracy

HN 3 is a unique liquid energetic material that exhibits ultrafast detonation chemistry and a transition to metallic states during detonation. We combine the Chebyshev interaction model for efficient simulation (ChIMES) many-body reactive force field and the extended-Lagrangian multiscale shock technique molecular dynamics method to calculate the detonation properties of HN 3 with the accuracy of Kohn–Sham density-functional theory. ChIMES is based on a Chebyshev polynomial expansion and can accurately reproduce density-functional theory molecular dynamics (DFT-MD) simulations for a wide range of unreactive and decomposition conditions of liquid HN 3 . We show that addition of random displacement configurations and the energies of gas-phase equilibrium products in the training set allows ChIMES to efficiently explore the complex potential energy surface. Schemes for selecting force field parameters and the inclusion of stress tensor and energy data in the training set are examined. Structural and dynamical properties and chemistry predictions for the resulting models are benchmarked against DFT-MD. We demonstrate that the inclusion of explicit four-body energy terms is necessary to capture the potential energy surface across a wide range of conditions. Our results generally retain the accuracy of DFT-MD while yielding a high degree of computational efficiency, allowing simulations to approach orders of magnitude larger time and spatial scales. The techniques and recipes for MD model creation we present allow for direct simulation of nanosecond shock compression experiments and calculation of the detonation properties of materials with the accuracy of Kohn–Sham density-functional theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shear strain alters the structure and migration mechanism of self-interstitial atoms in copper

Here, we use atomistic modeling to show that externally applied shear strain causes the lowest energy self-interstitial atom (SIA) structure in copper (Cu) to change from a <100>-type dumbbell to a <110>-type dumbbell. Concurrently, SIA migration switches from the 3-D random walk characteristic of <100>-type dumbbells to a 1-D mechanism analogous to that of crowdion SIAs. Furthermore, the relative energies of these two dumbbell structures as a function of strain are well predicted using elastic dipole tensors computed at zero strain, indicating that examination of these tensors may be used to assess the likelihood of strain-induced SIA structure transitions in other materials. Changes in lowest energy SIA structures and associated migration mechanisms stand to impact predictions of SIA behavior in irradiated solids.

36 MATERIALS SCIENCE↗

Design Choices in Anomaly Detection for Industrial Control Systems: Insights from Gas Pipeline Data

Industrial control systems (ICS) remain vulnerable to increasingly sophisticated cyberattacks, yet evaluating anomaly detection models in these environments is challenging due to temporal dependencies, missing-not-at-random patterns, and extremely imbalanced datasets. These factors make common practices—especially random data splits and naïve imputation—prone to severe temporal leakage, which can inflate reported performance and obscure real-world limitations. In this work, we systematically examine classical machine learning models, temporal deep learning architecture, and tensor-decomposition–based methods on a gas-pipeline dataset using a fully temporally separated evaluation pipeline designed to mimic realistic deployment conditions. Our findings show that proper temporal handling and MNAR-aware preprocessing significantly alter the relative performance of popular anomaly-detection methods, providing practical guidance for designing reliable, leakage-resistant ICS intrusion-detection systems.

97 MATHEMATICS AND COMPUTING↗

Machine learning inversion from scattering for mechanically driven polymers

A machine learning inversion method is developed for analyzing scattering functions of mechanically driven polymers and extracting the corresponding feature parameters, which include energy parameters and conformation variables. The polymer is modeled as a chain of fixed-length bonds constrained by bending energy, and it is subject to external forces such as stretching and shear. We generate a data set consisting of random combinations of energy parameters, including bending modulus, stretching and shear force, along with Monte Carlo-calculated scattering functions and conformation variables such as end-to-end distance, radius of gyration and off-diagonal component of the gyration tensor. The effects of the energy parameters on the polymer are captured by the scattering function, and principal component analysis ensures the feasibility of the machine learning inversion. Finally, we train a Gaussian process regressor using part of the data set as a training set and validate the trained regressor for inversion using the rest of the data. The regressor successfully extracts the feature parameters.

Gaussian process regressors↗

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↗

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Noisy intermediate-scale quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving 'quantum supremacy', a major milestone in quantum computing. NISQ supremacy requires comparison with a state-of-the-art classical simulator. In this paper, we report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of quantum supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the world. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

97 MATHEMATICS AND COMPUTING↗

Scattering of radiofrequency waves by randomly modulated density interfaces in the edge of fusion plasmas

In the scrape-off layer and the edge region of a tokamak, the plasma is strongly turbulent and scatters the radiofrequency (RF) electromagnetic waves that propagate through this region. It is important to know the spectral properties of these scattered RF waves, whether used for diagnostics or for heating and current drive. The spectral changes influence the interpretation of the obtained diagnostic data, and the current and heating profiles. A full-wave, three-dimensional (3-D) electromagnetic code ScaRF has been developed for studying the RF wave propagation through turbulent plasma. ScaRF is a finite-difference frequency-domain (FDFD) method used for solving Maxwell's equations. The magnetized plasma is defined through the cold plasma by the anisotropic permittivity tensor. As a result, ScaRF can be used to study the scattering of any cold plasma RF wave. It can also be used for the study of the scattering of electron cyclotron waves in ITER-type and medium-sized tokamaks such as TCV, ASDEX-U and DIII-D. For the case of medium-sized tokamaks, there is experimental evidence that drift waves and rippling modes are present in the edge region. Hence, we have studied the scattering of RF waves by periodic density interfaces (plasma gratings) in the form of a superposition of spatial modes with varying periodicity and random amplitudes. The power reflection coefficient (a random variable) is calculated for different realizations of the density interface. In this work, the uncertainty of the power reflection coefficient is rigorously quantified by use of the Polynomial Chaos Expansion method in conjunction with the Smolyak sparse-grid integration, which is known as the PCE-SG method. The PCE-SG method is proven to be accurate and more efficient compared with alternative methods such as the Monte Carlo (MC) approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scattering of radio frequency waves by randomly modulated density interfaces in the edge of fusion plasmas

In the scrape-off layer and the edge region of a tokamak, the plasma is strongly turbulent and scatters the radio frequency (RF) electromagnetic waves that propagate through this region. It is important to know, whether used for diagnostics or for heating and current drive, the spectral properties of these scattered RF waves. The spectral changes influences the interpretation of the diagnostic-data obtained and the current and heating profiles. A full-wave, 3D electromagnetic code ScaRF (see Papadopoulos et al. 2019) has been developed for studying the RF wave propagation through turbulent plasma. ScaRF is a finite-difference frequency-domain (FDFD) method for solving Maxwell's equations. The magnetized plasma is defined through the cold plasma, anisotropic permittivity tensor. As a result, ScaRF can be used to study the scattering of any cold plasma RF wave. It can be for the study of scattering of electron cyclotron waves in ITER-type and medium-sized tokamaks such as TCV, ASDEX-U, DIII-D. For the case of medium-sized tokamaks, there's experimental evidence that drift waves and rippling modes are present in the edge region (see Ritz et al. 1984). Hence, we study the scattering of RF waves by periodic density interfaces (plasma gratings) in the form of a superposition of spatial modes with varying periodicity and random amplitudes (see Papadopoulos et al. 2019). The power reflection coefficient (a random variable) is calculated for different realizations of the density interface. In this work, the uncertainty of the power reflection coefficient is rigorously quantified by use of the Polynomial Chaos Expansion (see Xiu & Karniadakis 2002) method in conjunction with the Smolyak sparse grid integration (see Papadopoulos et al. 2018) (PCE-SG). The PCE-SG method is proven accurate and much more efficient (roughly 2-orders of magnitude shorter execution time) compared to alternative methods such as the Monte Carlo (MC) approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum complexity in gravity, quantum field theory, and quantum information science

Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. Here, we seek to bridge the approaches of these fields, which define and study complexity using different frameworks and tools. We describe several definitions of complexity, along with their key properties. In quantum information theory, we focus on complexity growth in random quantum circuits. In quantum many-body systems and quantum field theory (QFT), we discuss a geometric definition of complexity in terms of geodesics on the unitary group. In dynamical systems, we explore a definition of complexity in terms of state or operator spreading, as well as concepts from tensor-networks. We also outline applications to simple quantum systems, quantum many-body models, and QFTs including conformal field theories (CFTs). Finally, we explain the proposed relationship between complexity and gravitational observables within the holographic anti-de Sitter (AdS)/CFT correspondence.

Baiguera, Stefano [Istituto Nazionale di Fisica Nu↗