Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees.

The computational cost of contracting a tensor network depends on the sequence of contractions, but to decide the sequence of contractions with a minimal computational cost on an arbitrary network has been proved to be an NP-complete problem. In this work, we conjecture that the problem may be a polynomial one if we consider the computational complexity instead. We propose a polynomial algorithm for the optimal contraction complexity of tensor tree network, which is a specific and widely applied network structure. We prove that for any tensor tree network, the proposed algorithm can achieve a sequence of contractions that guarantees the minimal time complexity and a linear space complexity simultaneously. To illustrate the validity of our idea, numerical simulations are presented that evidence the significant benefits when the network scale becomes large. This work will have great potential for the efficient processing of various physical simulations and pave the way for the further exploration of the computational complexity of tensor contraction on arbitrary tensor networks.

[1]  Daniel Kressner,et al.  A literature survey of low‐rank tensor approximation techniques , 2013, 1302.7121.

[2]  F. Verstraete,et al.  Tensor product methods and entanglement optimization for ab initio quantum chemistry , 2014, 1412.5829.

[3]  G. Evenbly,et al.  Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law , 2009, 0903.5017.

[4]  Dong Yu,et al.  The Deep Tensor Neural Network With Applications to Large Vocabulary Speech Recognition , 2013, IEEE Transactions on Audio, Speech, and Language Processing.

[5]  S. Hirata.  Tensor Contraction Engine: Abstraction and Automated Parallel Implementation of Configuration-Interaction, Coupled-Cluster, and Many-Body Perturbation Theories , 2003 .

[6]  J. Ignacio Cirac,et al.  Normal projected entangled pair states generating the same state , 2018, New Journal of Physics.

[7]  Reinhold Schneider,et al.  Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors , 2013, SIAM J. Matrix Anal. Appl..

[8]  Andrzej Cichocki,et al.  Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis , 2014, IEEE Signal Processing Magazine.

[9]  Frank Verstraete,et al.  Matrix product state representations , 2006, Quantum Inf. Comput..

[10]  R. Schneider,et al.  Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems , 2015, Journal of chemical theory and computation.

[11]  Garnet Kin-Lic Chan,et al.  Efficient tree tensor network states (TTNS) for quantum chemistry: generalizations of the density matrix renormalization group algorithm. , 2013, The Journal of chemical physics.

[12]  W. Dur,et al.  Concatenated tensor network states , 2009, 0904.1925.

[13]  Frank Verstraete,et al.  Faster identification of optimal contraction sequences for tensor networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  F. Verstraete,et al.  Renormalization and tensor product states in spin chains and lattices , 2009, 0910.1130.

[15]  Philippe Corboz,et al.  Fermionic multiscale entanglement renormalization ansatz , 2009, 0907.3184.

[16]  G. Vidal,et al.  Classical simulation of quantum many-body systems with a tree tensor network , 2005, quant-ph/0511070.

[17]  W. Hackbusch,et al.  A New Scheme for the Tensor Representation , 2009 .

[18]  Matrix product state approach for a two-lead multilevel Anderson impurity model , 2008, 0804.0550.

[19]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[20]  Guifre Vidal,et al.  Simulation of interacting fermions with entanglement renormalization , 2009, Physical Review A.

[21]  Roman Orus,et al.  A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States , 2013, 1306.2164.

[22]  Glen Evenbly,et al.  Improving the efficiency of variational tensor network algorithms , 2014 .

[23]  Markus Aichhorn,et al.  Fork Tensor Product States - Efficient Three Orbital Real Time DMFT Solver , 2016, 1612.05587.

[24]  J. Ignacio Cirac,et al.  Unifying projected entangled pair state contractions , 2013, 1311.6696.

[25]  Chi-Chung Lam,et al.  On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution , 1997, Parallel Process. Lett..

[26]  Wei Li,et al.  Efficient simulation of infinite tree tensor network states on the Bethe lattice , 2012, 1209.2387.

[27]  B. Khoromskij.  Tensors-structured Numerical Methods in Scientific Computing: Survey on Recent Advances , 2012 .

[28]  F. Verstraete,et al.  Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems , 2008, 0907.2796.

[29]  J. Ignacio Cirac,et al.  Homogeneous binary trees as ground states of quantum critical Hamiltonians , 2010 .

[30]  Sriram Krishnamoorthy,et al.  Empirical performance model-driven data layout optimization and library call selection for tensor contraction expressions , 2012, J. Parallel Distributed Comput..

[31]  Igor L. Markov,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2008, SIAM J. Comput..