Efficient tensor network simulation of quantum many-body physics on sparse graphs
read the original abstract
We study tensor network states defined on an underlying graph which is sparsely connected. Generic sparse graphs are expander graphs with a high probability, and one can represent volume law entangled states efficiently with only polynomial resources. We find that message-passing inference algorithms such as belief propagation can lead to efficient computation of local expectation values for a class of tensor network states defined on sparse graphs. As applications, we study local properties of square root states, graph states, and also employ this method to variationally prepare ground states of gapped Hamiltonians defined on generic graphs. Using the variational method we study the phase diagram of the transverse field quantum Ising model defined on sparse expander graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Algorithmic Locality via Provable Convergence in Quantum Tensor Networks
For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affe...
-
Belief Propagation and Tensor Network Expansions for Many-Body Quantum Systems: Rigorous Results and Fundamental Limits
For PEPS states with loop-decay, BP with cluster corrections approximates local observables exponentially accurately, and loop-decay necessarily implies exponential decay of connected correlations, ruling out BP at cr...
-
Tensor network surrogate models for variational quantum computation
Tensor network simulations act as effective surrogate models for training QAOA on large 2D lattices, overcoming limits of parameter transfer from small instances and remaining classically feasible with moderate bond d...
-
Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment
Tensor networks with belief propagation fail to simulate Google's quantum echoes OTOC experiment because the circuits produce largely incompressible entanglement.
-
Exploring the performance of superposition of product states: from 1D to 3D quantum spin systems
The superposition of product states ansatz achieves high accuracy for ground state search in 1D and 3D tilted Ising models with short- and long-range interactions as well as random networks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.