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 Lei 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… 

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.

Artificial out-of-plane Ising antiferromagnet on the kagome lattice with very small farther-neighbor 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),

Decomposition of Matrix Product States into Shallow Quantum Circuits

TLDR
This work compares a range of novel and previously-developed algorithmic protocols for decomposing matrix product states of arbitrary bond dimension into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries and proposes a proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs.

Tropical contraction of tensor networks as a Bell inequality optimization toolset

We show that finding the classical bound of broad families of Bell inequalities can be naturally framed as the contraction of an associated tensor network, but in tropical algebra, where the sum is

Partial lifting of degeneracy in the $J_1-J_2-J_3$ Ising antiferromagnet on the kagome lattice

Motivated by dipolar-coupled artificial spin systems, we present a theoretical study of the classical J 1 − J 2 − J 3 Ising antiferromagnet on the kagome lattice. We establish the ground-state phase

Hyper-optimized compressed contraction of tensor networks with arbitrary geometry

TLDR
A hyper-optimization over the compression and contraction strategy itself to minimize error and cost is introduced and it is demonstrated that this protocol outperforms both hand-crafted contraction strategies as well as recently proposed general contraction algorithms on a variety of synthetic problems on regular lattices and random regular graphs.

Computing solution space properties of combinatorial optimization problems via generic tensor networks

TLDR
A unified framework to compute the solution space properties of a broad class of combinatorial optimization problems, including computing the entropy constant for hardcore lattice gases, studying the overlap gap properties, and analyzing the performance of quantum and classical algorithms for maximum independent sets is introduced.

Optimizing Tensor Network Contraction Using Reinforcement Learning

TLDR
This work proposes a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem and shows how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges and obtain significant improve-ments over state-of-the-art techniques.

The ITensor Software Library for Tensor Network Calculations

TLDR
The philosophy behind ITensor, a system for programming tensor network calculations with an interface modeled on tensor diagrams, and examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, and tensor storage types are discussed.

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 of

References

SHOWING 1-10 OF 82 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 algorithms

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. We

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.

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 conditions

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.

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.

Relaxing Frustration in Classical Spin Systems

TLDR
A framework to map generic frustrated spin systems onto frustration-free models on a correlated phase space is proposed, resulting both in an improved analytical understanding of the ground state ensembles via local rules, and a natural construction of a tensor network on which standard algorithms can be used efficiently.

Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations.

TLDR
The method is able to simulate large quantum circuits that are out of reach of the state-of-the-art simulation methods and largely outperforms existing algorithms, including the mean-field methods and the recently proposed neural-network-based methods.

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.

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.
...