Exploring the performance of superposition of product states: from 1D to 3D quantum spin systems

Abstract

Tensor networks (TNs) are one of the best available tools to study many-body quantum systems. TNs are particularly suitable for one-dimensional local Hamiltonians, while their performance for generic geometries is mainly limited by two aspects: the limitation in expressive power and the approximate extraction of information. Here we investigate the performance of superposition-of-product-states (SPS) ansatz, a variational framework structurally related to canonical polyadic tensor decomposition. The ansatz does not compress information as effectively as tensor networks, but it has the advantages (i) of allowing accurate extraction of information, (ii) of being structurally independent of the geometry of the system, (iii) of being readily parallelizable, and (iv) of allowing analytical shortcuts. We first study the typical properties of the SPS ansatz for spin-$1/2$ systems, including its entanglement entropy, and its trainability. We then use this ansatz for ground state search in tilted Ising models -- including one-dimensional and three-dimensional with short- and long-range interaction, and a random network -- demonstrating that SPS can attain high accuracy.

arXiv comment12 pages, 6 figures

References in corpus (21)

• The density-matrix renormalization group in the age of matrix product states
• Cold bosonic atoms in optical lattices
• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Corner Transfer Matrix Renormalization Group Method
• Simulation of two dimensional quantum systems on an infinite lattice revisited: corner transfer matrix for tensor contraction
• Barren Plateaus in Variational Quantum Computing
• Variational quantum Monte Carlo simulations with tensor-network states
• Perfect Sampling with Unitary Tensor Networks
• Monte Carlo simulation with Tensor Network States
• Variational Benchmarks for Quantum Many-Body Problems
• Tensor Network Python (TeNPy) version 1
• Tensor Networks contraction and the Belief Propagation algorithm
• Matrix Product States, Random Matrix Theory and the Principle of Maximum Entropy
• Block belief propagation algorithm for two-dimensional tensor networks
• Efficient MPS algorithm for periodic boundary conditions and applications
• Absence of barren plateaus and scaling of gradients in the energy optimization of isometric tensor network states
• Quantum Typicality and Initial Conditions