Tropical Tensor Network for Ground States of Spin Glasses.

@article{Liu2021TropicalTN,
  title={Tropical Tensor Network for Ground States of Spin Glasses.},
  author={Jin-Guo Liu and L. Wang and Pan Zhang},
  journal={Physical review letters},
  year={2021},
  volume={126 9},
  pages={
          090506
        }
}
We present a unified exact tensor network approach to compute the ground state energy, identify the optimal configuration, and count the number of solutions for spin glasses. The method is based on tensor networks with the tropical algebra defined on the semiring of (R∪{-∞},⊕,⊙). Contracting the tropical tensor network gives the ground state energy; differentiating through the tensor network contraction gives the ground state configuration; mixing the tropical algebra and the ordinary algebra… Expand

Figures from this paper

Solving frustrated Ising models using tensor networks
TLDR
It is shown that optimizing the choice of clusters, including the weight on shared bonds, is crucial for the contractibility of the tensor networks, and some basic rules are derived and a linear program to implement them are derived. Expand
Artificial out-of-plane Ising antiferromagnet on the kagome lattice with very small further neighbour couplings
Jeanne Colbois, ∗ Kevin Hofhuis, 3, † Zhaochu Luo, 3 Xueqiao Wang, 3 Aleš Hrabec, 3, 4 Laura J. Heyderman, 3 and Frédéric Mila Institute of Physics, Ecole Polytechnique Fédérale de Lausanne (EPFL),Expand
Quantify the Non-Markovian Process with Intervening Projections in a Superconducting Processor
Liang Xiang, Zhiwen Zong, Ze Zhan, Ying Fei, Chongxin Run, Yaozu Wu, Wenyan Jin, Cong Xiao, Zhilong Jia, Peng Duan, Jianlan Wu, Yi Yin, ∗ and Guoping Guo 3, † Zhejiang Province Key Laboratory ofExpand
Learning Phase Transition in Ising Model with Tensor-Network Born Machines
Learning underlying patterns in unlabeled data with generative models is a challenging task. Inspired by the probabilistic nature of quantum physics, recently, a new generative model known as BornExpand

References

SHOWING 1-10 OF 90 REFERENCES
Residual entropies for three-dimensional frustrated spin systems with tensor networks
We develop a technique for calculating three-dimensional classical partition functions using projected entangled-pair states (PEPS). Our method is based on variational PEPS optimization algorithmsExpand
Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm
In this paper we study two-dimensional Ising spin glasses on a grid with nearest neighbor and periodic boundary interactions, based on a Gaussian bond distribution, and an exterior magnetic field. WeExpand
qTorch: The quantum tensor contraction handler
TLDR
The results in this work suggest that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below, and that the stochastic contraction method outperforms the line graph based method only when the time to calculate a reasonable tree decomposition is prohibitively expensive. Expand
Exact ground states of two-dimensional ±J Ising spin glasses
In this paper we study the problem of finding an exact ground state of a two-dimensional ±J Ising spin glass on a square lattice with nearest neighbor interactions and periodic boundary conditionsExpand
An exact tensor network for the 3SAT problem
TLDR
It is shown that for a 3SAT instance with n bits, it is enough to perform a polynomial number of contractions of the tensor network structure associated to the computation of local observables to obtain one of the explicit solutions to the problem, if any. Expand
Hyper-optimized tensor network contraction
TLDR
This work implements new randomized protocols that find very high quality contraction paths for arbitrary and large tensor networks, and introduces a hyper-optimization approach, where both the method applied and its algorithmic parameters are tuned during the path finding. Expand
Benchmarking treewidth as a practical component of tensor network simulations
TLDR
This work exhibits multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. Expand
Quantum annealing with manufactured spins
TLDR
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems. Expand
Topologically invariant tensor renormalization group method for the Edwards-Anderson spin glasses model
Tensor renormalization group (TRG) method is a real space renormalization group approach. It has been successfully applied to both classical and quantum systems. In this paper, we study a disorderedExpand
Differentiable Programming Tensor Networks
TLDR
This work presents essential techniques to differentiate through the tensor networks contractions, including stable AD for tensor decomposition and efficient backpropagation through fixed point iterations, and removes laborious human efforts in deriving and implementing analytical gradients for Tensor network programs. Expand
...
1
2
3
4
5
...