SEARCH · Engineering Papers
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.
Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
Not Available
Quantifying Uncertainty in E3SM via Functional Tensor Network Approximations.
Abstract not provided.
QIP 2023 Poster Abstract: A fast renormalization-group tensor-network decoder for quantum low-density parity check codes.
Abstract not provided.
Effective Z3 model for finite-density QCD with tensor networks
Explore the source record for details and available documents.
Expressive Surrogate Models via Functional Tensor Networks
Explore the source record for details and available documents.
Modeling spatio-temporal processes in climate models via functional tensor networks
Explore the source record for details and available documents.
A Fast Renormalization Group Tensor network decoder for Planar quantum LDPC codes
Explore the source record for details and available documents.
Efficient Optimal Decoding With Matchgate Tensor Networks
Explore the source record for details and available documents.
Rank-adaptive tensor network simulations of quantum dynamics
Explore the source record for details and available documents.
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.
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.
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.
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.
A PEPS Plugin for TNQVM
This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.
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.