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 91 records · Page 5

Thermal nature of confining strings

We investigate the quantum statistical properties of the confining string connecting a static fermion-antifermion pair in the massive Schwinger model. By analyzing the reduced density matrix of the subsystem located in between the fermion and antifermion, we demonstrate that as the interfermion separation approaches the string-breaking distance, the overlap between the microscopic density matrix and an effective thermal density matrix exhibits a pronounced, narrow peak, approaching unity at the onset of string breaking. This behavior reveals that the confining flux tube evolves toward a genuinely thermal state as the separation between the charges grows, even in the absence of an external heat bath. In other words, one cannot tell whether a reduced state of the subsystem arises from a surrounding heat bath or from entanglement with the rest of the system. The entanglement spectrum near the critical string-breaking distance exhibits a rapid transition from the dominance of a single state describing the confining electric string towards a strongly entangled state containing virtual fermion-antifermion pairs. Our findings establish a quantitative link between confinement, entanglement, and emergent thermality, and suggest that string breaking corresponds to a microscopic thermalization transition within the flux tube.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Precision study of the massive Schwinger model near quantum criticality

We perform a numerical analysis of the massive Schwinger model in the presence of a background electric field. Using the Density Matrix Renormalization Group approach, we efficiently compute the spectrum of the Schwinger model on a staggered lattice with up to 3000 qubits. As a result, we achieve a precise computation of the critical mass of the massive Schwinger model to five digits using four different “criticality criteria,” observing perfect agreement among them Additionally, we discuss the effect of a four-fermion operator deformation of the Schwinger model and compute the critical mass for various values of the deformation parameter.

Critical phenomena↗

Fundamental aspects of Spacetime and Quantum Fields

The proposal contained two goals: firstly, placing fundamental bound on thermalization in Quantum Field Theories (QFTs) and, secondly, developing our understanding of emergent spacetime from matrices through concrete models. Since the previous reporting period, in collaboration with Sean Hartnoll we have continued our study of entanglement edge modes in matrix quantum mechanics (MQM). This has resulted in two papers. The first applies our construction for the Matrix Quantum Hall system first to fuzzy sphere states known to correspond to stringy M2-branes in MQM. Entanglement in these states using machine learning methods have also been studied by Sean Hartnoll and Xizhi Han in previous work done under this grant. Our construction builds on this work, and further demonstrates how area laws on fuzzy geometries emerge from strongly coupled systems. The second paper generalizes this construction to all noncommutative geometries with curvature much larger than the noncommutativity parameter. We demonstrate that despite UV/IR mixing effects, the structure of entanglement edge mode irreducible representations is determined by the boundary area of subsystems. On manifolds without global symmetries, we have demonstrated that nonlocal effects inherent to noncommutative geometries resum into a change of frame of the metric structure, similar to the change from string frame to Einstein frame for entanglement entropies calculated in string theory. These advancements lay the groundwork for future progress in the understanding of emergent geometry from large-N theories. Using these techniques, we are currently working on applying our methods to noncom mutative geometries whose construction is not so well understood, such as the fuzzy 5-sphere. Despite their opacity these objects are quite important, as string physics in the bulk of holographic systems bears many features of noncommutative geometry. We have also laid the groundwork of applying our methods to tensor networks, one of the most powerful models for understanding how geometry emerges from entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗

Bayesian tensorized neural networks with automatic rank selection

Tensor decomposition is an effective approach to compress over-parameterized neural networks and to enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the training process is a challenging task due to the difficulty of choosing a proper tensor rank. In order to address this challenge, this paper proposes a low-rank Bayesian tensorized neural network. Our Bayesian method performs automatic model compression via an adaptive tensor rank determination. We also present approaches for posterior density calculation and maximum a posteriori (MAP) estimation for the end-to-end training of our tensorized neural network. Here, we provide experimental validation on a two-layer fully connected neural network, a 6-layer CNN and a 110-layer residual neural network where our work produces 7.4x to 137x more compact neural networks directly from the training while achieving high prediction accuracy.

Low-rank tensor↗

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

Tensor renormalization group for fermions

Abstract We review the basic ideas of the tensor renormalization group method and show how they can be applied for lattice field theory models involving relativistic fermions and Grassmann variables in arbitrary dimensions. We discuss recent progress for entanglement filtering, loop optimization, bond-weighting techniques and matrix product decompositions for Grassmann tensor networks. The new methods are tested with two-dimensional Wilson–Majorana fermions and multi-flavor Gross–Neveu models. We show that the methods can also be applied to the fermionic Hubbard model in 1+1 and 2+1 dimensions.

Physics↗

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schrödinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

King, Andrew D. [D-Wave Quantum Inc., Burnaby, BC ↗

The quantum entropy cone of hypergraphs

In this work, we generalize the graph-theoretic techniques used for the holographic entropy cone to study hypergraphs and their analogously-defined entropy cone. This allows us to develop a framework to efficiently compute entropies and prove inequalities satisfied by hypergraphs. In doing so, we discover a class of quantum entropy vectors which reach beyond those of holographic states and obey constraints intimately related to the ones obeyed by stabilizer states and linear ranks. We show that, at least up to 4 parties, the hypergraph cone is identical to the stabilizer entropy cone, thus demonstrating that the hypergraph framework is broadly applicable to the study of entanglement entropy. We conjecture that this equality continues to hold for higher party numbers and report on partial progress on this direction. To physically motivate this conjectured equivalence, we also propose a plausible method inspired by tensor networks to construct a quantum state from a given hypergraph such that their entropy vectors match.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗