Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tensor network methods”

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 109 records · Page 6

Two-dimensional isometric tensor networks on an infinite strip

The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an “orthogonality column” of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Lastly, we introduce an infinite time-evolving block decimation algorithm (iTEBD 2 ) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Localization dynamics in a centrally coupled system

In systems in which interactions couple a central degree of freedom and a bath, one would expect signatures of the bath's phase to be reflected in the dynamics of the central degree of freedom. This has been recently explored in connection with many-body localized baths coupled with a central qubit or a single-cavity mode - systems with growing experimental relevance in various platforms. Such models also have an interesting connection with Floquet many-body localization via quantizing the external drive, although this has been relatively unexplored. Here we adapt the multilayer multiconfigurational time-dependent Hartree (ML-MCTDH) method, a well-known tree tensor network algorithm, to numerically simulate the dynamics of a central degree of freedom, represented by a d-level system (qudit), coupled to a disordered interacting one-dimensional spin bath. ML-MCTDH allows us to reach ≈10 2 lattice sites, a far larger system size than what is feasible with exact diagonalization or kernel polynomial methods. From the intermediate time dynamics, we find a well-defined thermodynamic limit for the qudit dynamics upon appropriate rescaling of the system-bath coupling. The spin system shows similar scaling collapse in the Edward-Anderson spin-glass order parameter or entanglement entropy at relatively short times. At longer timescales, we see slow growth of the entanglement, which may arise from dephasing mechanisms in the localized system or long-range interactions mediated by the central degree of freedom. Similar signs of localization are shown to appear as well with unscaled system-bath coupling.

1-dimensional spin chains↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tangent space to the manifold of critical classical Hamiltonians representable by tensor networks

We introduce a scheme to perform Monte Carlo renormalization group with the coupling constants of the system Hamiltonian encoded in a tensor network. Furthermore, with this scheme we compute the tangent space to the manifold of the critical Hamiltonians representable by a tensor network at the nearest-neighbor critical coupling for three models: the two- and three-dimensional Ising models and the two-dimensional three-state Potts model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mean-field entanglement transitions in random tree tensor networks

Entanglement phase transitions in quantum chaotic systems subject to projective measurements and in random tensor networks have emerged as a new class of critical points separating phases with different entanglement scaling. We propose a mean-field theory of such transitions by studying the entanglement properties of random tree tensor networks. As a function of bond dimension, we find a phase transition separating area-law from logarithmic scaling of the entanglement entropy. Using a mapping onto a replica statistical mechanics model defined on a Cayley tree and the cavity method, we analyze the scaling properties of such transitions. Our approach provides a tractable, mean-field-like example of an entanglement transition. Furthermore, we verify our predictions numerically by computing directly the entanglement of random tree tensor network states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Simulating Large PEPs Tensor Networks on Small Quantum Devices

We systematically map low bond dimension PEPs tensor networks to quantum circuits. By measuring and reusing qubits, we are in principle able to simulate an N×M square lattice PEPs network (for arbitrary M) of bond dimension 2 using N+ 2 qubits. We then seek to determine if this mapping can yield useful values for long-range loop observables in the presence of quantum device noise in the topological Wen plaquette model by mapping a 3×3 PEPs tensor network to a 5-qubit quantum circuit and executing it on the Honeywell System Model H1-1 trapped-ion device. We find that, for this system size, the noisy observable values are indeed sufficient for diagnosing topological vs. trivial order as the Wen model is perturbed by a magnetic field term in the Hamiltonian. We provide an overview of the experimental procedure and its results. We then explain in greater detail our method for mapping 2D tensor networks to quantum circuits and its scaling properties. This serves as a proof-of-concept of the utilty of the measure-and-reuse approach for simulating large 2D quantum systems on small quantum devices.

MacCormack, Ian↗

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

Post-training model compression can reduce the inference costs of deep neural networks, but uncompressed training still consumes enormous hardware resources and energy. To enable low-energy training on edge devices, it is highly desirable to directly train a compact neural network from scratch with a low memory cost. Low-rank tensor decomposition is an effective approach to reduce the memory and computing costs of large neural networks. However, directly training low-rank tensorized neural networks is a very challenging task because it is hard to determine a proper tensor rank a priori, and the tensor rank controls both model complexity and accuracy. Here, this paper presents a novel end-to-end framework for low-rank tensorized training. We first develop a Bayesian model that supports various low-rank tensor formats (e.g., CANDECOMP/PARAFAC, Tucker, tensor-train, and tensor-train matrix) and reduces neural network parameters with automatic rank determination during training. Then we develop a customized Bayesian solver to train large-scale tensorized neural networks. Our training methods shows orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the experiments. On a very large deep learning recommendation system with over 4.2 ×10 9 model parameters, our method can reduce the parameter number to 1.6 ×10 5 automatically in the training process (i.e., by 2.6 ×10 4 times) while achieving almost the same accuracy. Code is available at https://github.com/colehawkins/bayesian-tensor-rank-determination.

compact neural networks↗

Real-time evolution of Anderson impurity models via tensor network influence functionals

In this work, we present and analyze two tensor network-based influence functional approaches for simulating the real-time dynamics of quantum impurity models such as the Anderson model. Via comparison with recent numerically exact simulations, we show that such methods accurately capture the long-time nonequilibrium quench dynamics. The two parameters that must be controlled in these tensor network influence functional approaches are a time discretization (Trotter) error and a bond dimension (tensor network truncation) error. We show that the actual numerical uncertainties are controlled by an intricate interplay of these two approximations, which we demonstrate in different regimes. Our work opens the door to using these tensor network influence functional methods as general impurity solvers.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Supersolid and charge-density-wave states from anisotropic interaction in an optical lattice

We show anisotropy of the dipole interaction between magnetic atoms or polar molecules can stabilize new quantum phases in an optical lattice. Using a well-controlled numerical method based on the tensor network algorithm, we calculate the phase diagram of the resultant effective Hamiltonian in a two-dimensional square lattice - an anisotropic Hubbard model of hard-core bosons with attractive interaction in one direction and repulsive interaction in the other direction. Besides the conventional superfluid and the Mott insulator states, we find the striped and the checkerboard charge-density-wave states and the supersolid phase that interconnect the superfluid and the striped solid states. The transition to the supersolid phase has a mechanism different from the case of the soft-core Bose-Hubbard model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inclusive reactions from finite Minkowski spacetime correlation functions

The need to determine scattering amplitudes of few-hadron systems for arbitrary kinematics expands a broad set of subfields of modern-day nuclear and hadronic physics. In this work, we expand upon previous explorations on the use of real-time methods, like quantum computing or tensor networks, to determine few-body scattering amplitudes. Such calculations must be performed in a finite Minkowski spacetime, where scattering amplitudes are not well defined. Our previous work presented a conjecture of a systematically improvable estimator for scattering amplitudes constructed from finite-volume correlation functions. Here we provide further evidence that the prescription works for larger kinematic regions than previously explored as well as a broader class of scattering amplitudes. Finally, we devise a new method for estimating the order of magnitude of the error associated with finite time separations needed for such calculations. In units of the lightest mass of the theory, we find that to constrain amplitudes using real-time methods within O ( 10 % ) , the spacetime volumes must satisfy m L ∼ O ( 10 – 10 2 ) ) and m T ∼ O ( 10 2 – 10 4 ) . Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spectral gaps of two- and three-dimensional many-body quantum systems in the thermodynamic limit

We present an expression for the spectral gap, opening up new possibilities for performing and accelerating spectral calculations of quantum many-body systems. We develop and demonstrate one such possibility in the context of tensor network simulations. Our approach requires only minor modifications of the widely used simple update method and is computationally lightweight relative to other approaches. We validate it by computing spectral gaps of the 2D and 3D transverse-field Ising models and find strong agreement with previously reported perturbation theory results. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗

Quantum phase transition dynamics in the two-dimensional transverse-field Ising model

The quantum Kibble-Zurek mechanism (QKZM) predicts universal dynamical behavior near the quantum phase transitions (QPTs). It is now well understood for the one-dimensional quantum matter. Higher-dimensional systems, however, remain a challenge, complicated by the fundamentally different character of the associated QPTs and their underlying conformal field theories. In this work, we take the first steps toward theoretical exploration of the QKZM in two dimensions for interacting quantum matter. We study the dynamical crossing of the QPT in the paradigmatic Ising model by a joint effort of modern state-of-the-art numerical methods, including artificial neural networks and tensor networks. As a central result, we quantify universal QKZM behavior close to the QPT. We also note that, upon traversing further into the ferromagnetic regime, deviations from the QKZM prediction appear. We explain the observed behavior by proposing an extended QKZM taking into account spectral information as well as phase ordering. Our work provides a testing platform for higher-dimensional quantum simulators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Workshop on Field Theoretic Simulations in Particle Physics and Condensed Matter

A two and half day workshop at Boston University, devoted to a discussion of common problems in the theoretical and computational study of particle physics and condensed matter. The phase structure of strongly coupled quantum field theories are of great interest in condensed matter and high energy physics. For example, the study of strongly correlated systems, such as frustrated quantum anti-ferromagnets, have suggested the existence of phases in which the low energy excitations do not have the quantum numbers of electrons but are fractionalized. The field description of such systems are typically topological quantum field theories. The latter have also proved important in constructing supersymmetric lattice gauge theories. Quantum critical systems in condensed matter are described by conformal field theories which have the subject of much recent work in the context of theories of Beyond Standard Model physics. Finally, theoretical holographic techniques originating in string theory may offer a new tool to investigate strongly interacting electrons. In parallel with these theoretical developments there has been rapid progress in computational methods in both fields; from tensor networks and density matrix renormalization group techniques to the rational hybrid Monte Carlo algorithm and techniques to ameliorate the famous sign problem. It is thus a propitious time to bring both communities together to stimulate an exchange of ideas and facilitate possible future collaborations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Discrete generative diffusion models without stochastic differential equations: A tensor network approach

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard DMs, this is done by learning a “score function” that reverses the effect of adding diffusive noise to the distribution of interest. Here we consider the generalisation of DMs to lattice systems with discrete degrees of freedom, and where noise is added via Markov chain jump dynamics. We show how to use tensor networks (TNs) to efficiently define and sample such “discrete diffusion models” (DDMs) without explicitly having to solve a stochastic differential equation. We show the following: (i) by parametrising the data and evolution operators as TNs, the denoising dynamics can be represented exactly; (ii) the auto-regressive nature of TNs allows to generate samples efficiently and without bias; (iii) for sampling Boltzmann-like distributions, TNs allow to construct an efficient learning scheme that integrates well with Monte Carlo. We illustrate this approach to study the equilibrium of two models with non-trivial thermodynamics, the d = 1 constrained Fredkin chain and the d = 2 Ising model. Published by the American Physical Society 2025

Causer, Luke (ORCID:0000000194243473)↗