Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor networks”

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 55 records · Page 3

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↗

Constructing tensor network influence functionals for general quantum dynamics

Here, we describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Isometric Tensor Network States in Two Dimensions

Tensor-network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. Here we consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm for approximating of the ground state of a Hamiltonian as an isometric TNS-which we demonstrate for the 2D transverse field Ising model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On infinite tensor networks, complementary recovery and type II factors

We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with complementary recovery, a property that features prominently in the bulk-to-boundary maps intrinsic to holographic quantum error-correcting codes. In this case, we decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network. As a specific example, we describe this inductive limit for the holographic Harlow-Pastawski-Preskill-Yoshida code model and relate its algebraic and error-correction features. We find that the local algebras in this model are given by the hyperfinite type II$_\infty$ factor. Next, we discuss other networks that build upon this framework and comment on a connection between type II factors and stabilizer circuits. We conclude with a discussion of multiscale entanglement renormalization ansatz networks in which complementary recovery is broken. We argue that this breaking possibly permits a limiting type III von Neumann algebra, making them more suitable ansätze for approximating subregions of quantum field theories.

holographic dualities↗

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

Monomer-dimer tensor-network basis for qubit-regularized lattice gauge theories

Traditional SU⁡(𝑁) lattice gauge theories (LGTs) can be formulated using an orthonormal basis constructed from the irreducible representations (irreps) 𝑉 𝜆 of the SU⁡(𝑁) gauge symmetry. On a lattice, the elements of this basis are tensor networks comprising dimer tensors on the links labeled by a set of irreps {𝜆 ℓ } and monomer tensors on sites labeled by {𝜆 𝑠 }. These tensors naturally define a local site Hilbert space, ℋ$^𝑔_𝑠$, on which gauge transformations act. Gauss’s law introduces an additional index 𝛼 𝑠 =1,2,…,𝒟⁡(ℋ$^𝑔_𝑠$) that labels an orthonormal basis of the gauge-invariant subspace of ℋ$^𝑔_𝑠$. This monomer-dimer tensor-network (MDTN) basis, |{𝜆 𝑠 },{𝜆 ℓ },{𝛼 𝑠 }⟩, of the physical Hilbert space enables the construction of new qubit-regularized SU⁡(𝑁) gauge theories that are free of sign problems while preserving key features of traditional LGTs. Here, we investigate finite-temperature confinement-deconfinement transitions in a simple qubit-regularized SU(2) and SU(3) gauge theory in 𝑑 =2 and 𝑑 =3 spatial dimensions, formulated using the MDTN basis, and show that they reproduce the universal results of traditional LGTs at these transitions. Additionally, in 𝑑 =1, we demonstrate using a plaquette chain that the string tension at zero temperature can be continuously tuned to zero by adjusting a model parameter that plays the role of the gauge coupling in traditional LGTs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

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↗

Holographic codes from hyperinvariant tensor networks

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code’s logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

97 MATHEMATICS AND COMPUTING↗

Validating quantum-classical programming models with tensor network simulations

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force statevector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

97 MATHEMATICS AND COMPUTING↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

Tensor Network Quantum Virtual Machine (TNQVM)

There is a lack of state-of-the-art quantum computing simulation software that scales on heterogeneous systems like Titan. Tensor Network Quantum Virtual Machine (TNQVM) provides a quantum simulator that leverages a distributed network of GPUs to simulate quantum circuits in a manner that leverages recent results from tensor network theory.

McCaskey, AlexanderJ.↗

Tensor Network Quantum Virtual Machine (TNQVM)

There is a lack of state-of-the-art quantum computing simulation software that scales on heterogeneous systems like Titan. Tensor Network Quantum Virtual Machine (TNQVM) provides a quantum simulator that leverages a distributed network of GPUs to simulate quantum circuits in a manner that leverages recent results from tensor network theory.

McCaskey, Alexander J.↗

A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems

Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor network formulation of two-dimensional gravity

We show how to formulate a lattice gauge theory whose naive continuum limit corresponds to two-dimensional (Euclidean) quantum gravity including a positive cosmological constant. More precisely the resultant continuum theory corresponds to gravity in a first-order formalism in which the local frame and spin connection are treated as independent fields. Recasting this lattice theory as a tensor network allows us to study the theory at strong coupling without encountering a sign problem. In two dimensions this tensor network is exactly soluble and we show that the system has a series of critical points that occur for pure imaginary coupling and are associated with first order phase transitions. We then augment the action with a Yang-Mills term which allows us to control the lattice spacing and show how to apply the tensor renormalization group to compute the free energy and look for critical behavior. Finally we perform an analytic continuation in the gravity coupling in this extended model and show that its critical behavior in a certain scaling limit depends only on the topology of the underlying lattice. We also show how the lattice gauge theory can be naturally generalized to generate the Polyakov or Liouville action for two dimensional quantum gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Code for the manuscript "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Mode

We disclose a python/pytorch implementation of the physics-informed machine learning algorithm described in "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Modeling", LA-UR-24-30678. Direct numerical simulation (DNS) of ubiquitous turbulence phenomena is computationally infeasible for realistic flows. As a result, reduced modeling for turbulent flows aim to reduce the number of resolved scales while retaining accurate representations of the small-scale physics. The dynamics of the velocity gradient tensor (VGT) is a key ingredient in reduced or subgrid turbulence models. The evolution equation for the VGT involves nonlocal terms, requiring closure modeling. This implementation of the novel methodology of Lagrangian Attention Tensor Networks (LATN), utilizes a structured representation of the history of the VGT to inform a physics-informed machine learning algorithm. This addition of structured memory terms is shown to outperform previous models when trained and evaluated on DNS data.

Livescu, Daniel [LANL]↗

Tensor network study of the m = 1/2 magnetization plateau in the Shastry-Sutherland model at finite temperature

The two-dimensional infinite projected entangled pair state tensor network is evolved in imaginary time with the full update (FU) algorithm to simulate the Shastry-Sutherland model in a magnetic field at finite temperature directly in the thermodynamic limit. We focus on the phase transition into the m = 1/2 magnetization plateau, which was observed in experiments on SrCu 2 (BO 3 ) 2 . For the largest simulated bond dimension, the early evolution in the high-temperature regime is simulated with the simple update (SU) scheme and then, as the correlation length increases, continued with the FU scheme towards the critical regime. We apply a small symmetry-breaking bias field and then extrapolate towards zero bias using a simple scaling theory in the bias field. The combined SU + FU scheme provides an accurate estimate of the critical temperature, even though the results could not be fully converged in the bond dimension in the vicinity of the transition. Here, the critical temperature estimate is improved with a generalized scaling theory that combines two divergent length scales: One due to the bias, and the other due to the finite bond dimension. The obtained results are consistent with the transition being in the universality class of the two-dimensional classical Ising model. The estimated critical temperature is 3.5(2) K, which is well above the temperature 2.1 K used in the experiments.

2-dimensional systems↗