Density Matrix Renormalization Group with Tensor Processing Units

Abstract

Google's Tensor Processing Units (TPUs) are integrated circuits specifically built to accelerate and scale up machine learning workloads. They can perform fast distributed matrix multiplications and therefore be repurposed for other computationally intensive tasks. In this work we demonstrate the use of TPUs for accelerating and scaling up the density matrix renormalization group (DMRG), a powerful numerical approach to compute the ground state of a local quantum many-body Hamiltonian. The cost of DMRG scales with system size $N$ as $O(N{D}^3)$, where the so-called bond dimension $D$ regulates how expressive the underlying matrix product state (MPS) variational ansatz is. We consider lattice models in two spatial dimensions, with square lattices of size $10\times 10$ (free fermions) and $20\times 20$ (transverse field Ising model), for which the required MPS bond dimension is known to scale at least as $\exp (\sqrt{N})$. Using half of a TPU v3 pod (namely $1,024$ TPU v3 cores) we reached an unprecedentedly large bond dimension $D=2^{16}=65,536$, for which optimizing a single MPS tensor took about 2 minutes.

References in corpus (16)

• The density-matrix renormalization group in the age of matrix product states
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• A class of quantum many-body states that can be efficiently simulated
• Entanglement entropy of fermions in any dimension and the Widom conjecture
• From density-matrix renormalization group to matrix product states
• The Density Matrix Renormalization Group in Chemistry and Molecular Physics: Recent Developments and New Challenges
• The density matrix renormalization group for ab initio quantum chemistry
• Characterizing topological order by studying the ground states of an infinite cylinder
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Algorithms for finite Projected Entangled Pair States
• Spectral functions in one-dimensional quantum systems at T>0
• Generic Construction of Efficient Matrix Product Operators
• Tree Tensor Networks for Generative Modeling
• Chebyshev expansion for Impurity Models using Matrix Product States
• Spin Liquid Phase in Anisotropic Triangular Lattice Heisenberg Model: Exact diagonalization and density-matrix renormalization group calculations

Cited by in corpus (19)

• Beyond-classical computation in quantum simulation
• Variational Quantum Algorithms for Computational Fluid Dynamics
• Exploring Large-Scale Entanglement in Quantum Simulation
• Benchmarking highly entangled states on a 60-atom analog quantum simulator
• Gauging tensor networks with belief propagation
• Tensor networks enable the calculation of turbulence probability distributions
• The computational power of random quantum circuits in arbitrary geometries
• Tensor network reduced order models for wall-bounded flows
• Tensor Networks for Lattice Gauge Theories beyond one dimension: a Roadmap
• Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
• Is attention all you need to solve the correlated electron problem?
• Fast Time-Evolution of Matrix-Product States using the QR decomposition
• Study of the long-range transverse field Ising model with fermionic Gaussian states
• Partonic distribution functions and amplitudes using tensor network methods
• Many-body computing on Field Programmable Gate Arrays
• In-Depth Investigation of Phase Transition Phenomena in Network Models Derived from Lattice Models
• The Software Landscape for the Density Matrix Renormalization Group
• Probing non-Gaussian correlations through entanglement generation in a many-body quantum system
• Tensor-based phase difference estimation on time series analysis