Pith. sign in

Simulation of Quantum Many-Body Systems on Amazon Cloud

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Quantum many-body systems (QMBs) are some of the most challenging physical systems to simulate numerically. Methods involving approximations for tensor network (TN) contractions have proven to be viable alternatives to algorithms such as quantum Monte Carlo or simulated annealing. However, these methods are cumbersome, difficult to implement, and often have significant limitations in their accuracy and efficiency when considering systems in more than one dimension. In this paper, we explore the exact computation of TN contractions on two-dimensional geometries and present a heuristic improvement of TN contraction that reduces the computing time, the amount of memory, and the communication time. We run our algorithm for the Ising model using memory optimized x1.32x large instances on Amazon Web Services (AWS) Elastic Compute Cloud (EC2). Our results show that cloud computing is a viable alternative to supercomputers for this class of scientific applications.

citation-role summary

background 1

citation-polarity summary

fields

cs.DM 1

years

2019 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Carving-width and contraction trees for tensor networks

cs.DM · 2019-08-29 · conditional · novelty 5.0

The authors formalize tensor-network contraction orders as contraction trees, link the space and time bottlenecks to carving-width and treewidth, and show experimentally that a Ratcatcher-based planner produces near-optimal orders on planar grid networks.

citing papers explorer

Showing 1 of 1 citing paper.

  • Carving-width and contraction trees for tensor networks cs.DM · 2019-08-29 · conditional · none · ref 24 · internal anchor

    The authors formalize tensor-network contraction orders as contraction trees, link the space and time bottlenecks to carving-width and treewidth, and show experimentally that a Ratcatcher-based planner produces near-optimal orders on planar grid networks.