Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix product states”

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 OSTI2026

Infinite matrix product states for (1 + 1)-dimensional gauge theories

We present a matrix product operator construction that allows us to represent the lattice Hamiltonians of (abelian or non-abelian) gauge theories in a local and manifestly translation-invariant form. In particular, we use symmetric matrix product states and introduce link-enhanced matrix product operators (LEMPOs) that can act on both the physical and virtual spaces of the matrix product states. This construction allows us to study Hamiltonian lattice gauge theories on infinite lattices. As examples, we show how to implement this method to study the massless and massive one-flavor Schwinger model and adjoint QCD 2 .

confinement↗
DOE OSTI2025

Real-time scattering in Ising field theory using matrix product states

We study scattering in Ising field theory (IFT) using matrix product states and the time-dependent variational principle. IFT is a one-parameter family of strongly coupled nonintegrable quantum field theories in 1+1 dimensions, interpolating between massive free fermion theory and Zamolodchikov's integrable massive 𝐸 8 theory. Particles in IFT may scatter either elastically or inelastically. In the postcollision wave function, particle tracks from all final-state channels occur in superposition; processes of interest can be isolated by projecting the wave function onto definite particle sectors, or by evaluating energy density correlation functions. Using numerical simulations we determine the time delay of elastic scattering and the probability of inelastic particle production as a function of collision energy. We also study the mass and width of the lightest resonance near the 𝐸 8 point in detail. Close to both the free fermion and 𝐸 8 theories, our results for both elastic and inelastic scattering are in good agreement with expectations from form-factor perturbation theory. Using numerical computations to go beyond the regime accessible by perturbation theory, we find that the high-energy behavior of the two-to-two particle scattering probability in IFT is consistent with a conjecture of Zamolodchikov. Our results demonstrate the efficacy of tensor-network methods for simulating the real-time dynamics of strongly coupled quantum field theories in 1+1 dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024

Smith, Kevin C. (ORCID:0000000223971518)↗
DOE OSTI2022

Exact matrix product state representation and convergence of a fully correlated electronic wavefunction in the infinite-basis limit

Here In this paper we present the exact representation of a fully correlated electronic wavefunction as the single-particle basis approaches completeness. It consists of a half-infinite chain of matrices of exponentially increasing size. The complete basis limit is illustrated numerically using the density-matrix renormalization-group method by computing the core-valence entanglement in the C 2 ground state in increasing subsets of cc-pVTZ and pVQZ bases until convergence is reached.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Hilbert space multireference coupled cluster tailored by matrix product states

In the past decade, the quantum chemical version of the density matrix renormalization group method has established itself as the method of choice for strongly correlated molecular systems. However, despite its favorable scaling, in practice, it is not suitable for computations of dynamic correlation. Several approaches to include that in post-DMRG methods exist; in our group, we focused on the tailored coupled cluster (TCC) approach. This method works well in many situations; however, in exactly degenerate cases (with two or more determinants of equal weight), it exhibits a bias toward the reference determinant representing the Fermi vacuum. Although sometimes it is possible to use a compensation scheme to avoid this bias for energy differences, it is certainly a drawback. In order to overcome this bias of the TCC method, we have developed a Hilbert-space multireference version of tailored CC, which can treat several determinants on an equal footing. We have implemented and compared the performance of three Hilbert-space multireference coupled cluster (MRCC) variants—the state universal one and the Brillouin–Wigner and Mukherjee’s state specific ones. We have assessed these approaches on the cyclobutadiene and tetramethyleneethane molecules, which are both diradicals with exactly degenerate determinants at a certain geometry. We have also investigated the sensitivity of the results on the orbital rotation of the highest occupied and lowest unoccupied molecular orbital (HOMO–LUMO) pair, as it is well known that Hilbert-space MRCC methods are not invariant to such transformations.

Chemistry↗
DOE OSTI2026

Quantum dynamics of cosmological particle production: interacting quantum field theories with matrix product states

Understanding real-time dynamics of interacting quantum fields in curved space-time remains a major theoretical challenge. We employ tensor network methods to study such dynamics using interacting scalar and gauge theories in 1+1 spacetime dimensions, subject to a quench modeling a homogeneously expanding gravitational background. The models considered are the scalar λϕ 4 theory and the Schwinger model, i.e. a Dirac fermion coupled to a U(1) gauge field which is equivalent via bosonization to a scalar field with a cosine self-interaction. In the free scalar limit, both theories reproduce known analytical results, providing a nontrivial numerical validation of bosonization in curved spacetime for the Schwinger model. Our central finding is that self-interactions lead to a suppression of gravitational particle production compared to the free-field case, as evidenced by two-point functions and the spectra of produced particles. We further examine the behavior of entanglement generation and find that interactions suppress entanglement growth in the λϕ 4 theory, while in the Schwinger model, the interplay between suppressed particle production and enhanced inter-particle correlations leads to more complex entanglement behavior. Our results pave the way for further explorations of nonperturbative quantum real-time dynamics of interacting scalar and gauge theories in arbitrary gravitational backgrounds.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Quantum Ising model on (2+1)-dimensional anti–de Sitter space using tensor networks

We study the quantum Ising model on (2+1)-dimensional anti-de Sitter space using matrix product states (MPS) and matrix product operators (MPOs). We explore the bulk phase diagram of the theory on regular tessellations of hyperbolic space with coordination number seven and find disordered and ordered phases separated by a phase transition. We find that the boundary-boundary spin correlation function exhibits power law scaling deep in the disordered phase of the Ising model consistent with holography. At the critical point, we find the boundary entanglement entropy scales logarithmically with subsystem size but away from this, we see a linear scaling. In comparison, the full system exhibits a volume law scaling, which is expected in chaotic and/or highly connected systems. We also measure out of time ordered correlators (OTOCs) to explore the scrambling behavior of the theory.

Quantum spin models↗
DOE OSTI2025

Towards a Quantum Algorithm for the Incompressible Nonlinear Navier-Stokes Equations

In this work, we present novel concepts for quantum algorithms to solve transient, 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 incompressible Navier-Stokes equations 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 solving 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. We propose a new framework based on matrix product states (MPSs) and matrix product operators (MPOs), in addition to the Krylov subspace methods. For example, the solution variables of the Navier-Stokes equations are represented by MPSs, and the linear and nonlinear terms are processed by MPOs. The time evolution of the operators is attained by a fast-forwarding algorithm using Krylov subspace methods. Furthermore, we discuss various techniques for efficient encoding of MPSs, measurement reduction for MPOs, and use of tensor operations to treat multi-variate, multi-physics characteristics of Navier-Stokes.

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

The ITensor Software Library for Tensor Network Calculations

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗
DOE OSTI2022

Codebase release 0.3 for ITensor

ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future.

Fishman, Matthew↗
DOE OSTI2026

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↗
DOE OSTI2026

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Efficient simulation of open quantum systems coupled to a reservoir through multiple channels

It is challenging to simulate open quantum systems that are connected to a reservoir through multiple channels. For example, vibrations may induce fluctuations in both energy gaps and electronic couplings, which represent two independent channels of system–bath couplings. Systems of this kind are ubiquitous in the processes of excited state radiationless decay. Combined with density matrix renormalization group (DMRG) and matrix product states (MPS) methods, we develop an interaction-picture chain mapping strategy for vibrational reservoirs to simulate the dynamics of these open systems, resulting in time-dependent spatially local system–bath couplings in the chain-mapped Hamiltonian. This transformation causes the entanglement generated by the system–bath interactions to be restricted within a narrow frequency window of vibrational modes, enabling efficient DMRG/MPS dynamical simulations. We demonstrate the utility of this approach by simulating singlet fission dynamics using a generalized spin-boson Hamiltonian with both diagonal and off-diagonal system–bath couplings. This approach generalizes an earlier interaction-picture chain mapping scheme, allowing for efficient and exact simulation of systems with multi-channel system–bath couplings using matrix product states, which may further our understanding of nonlocal exciton–phonon couplings in exciton transport and the non-Condon effect in energy and electron transfer.

Chemistry↗
DOE OSTI2022

237 Np Mössbauer Isomer Shifts: A Lesson About the Balance of Static and Dynamic Electron Correlation in Heavy Element Complexes

A large set of neptunium compounds with different oxidation states (III to VII) was assembled to study the Mössbauer isomer shift by wave function calculations and better understand covalency in f-elements complexes. The contact density approach was used to calculate the isomer shift using complete active space self-consistent field (CASSCF) multiconfiguration wave functions, as well as matrix product states [from Density Matrix Renormalization Group (DMRG) algorithms] for large active spaces. Dynamic correlation effects for the isomer shifts were treated via CASPT2 energy derivatives with respect to the nuclear radius. The CASSCF calculations appear to produce different orbital overlocalization errors for low and high Np oxidation states. For compounds with low Np oxidation numbers, the errors can be attributed to the overlocalization of the 5f orbitals. For the compounds with high Np oxidation numbers, the main errors arise from an overlocalization of ligand orbitals and concomitant to weak donation bonding. Attempts to mitigate the overlocalization errors with large active spaces using DMRG were only partially successful, showing that explicit treatment of dynamic correlation is necessary for accurate predictions of Mössbauer isomer shifts. The CASPT2 calculations perform very satisfactorily. For a subset of Np compounds, both static and dynamic correlation effects were substantial. Furthermore, a rational active space selection based on orbital entanglement diagrams proved beneficial for determining the optimal reference wave function.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

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↗
DOE OSTI2023

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗