Computations in quantum tensor networks
From MaRDI portal
Abstract: The computation of the ground state (i.e. the eigenvector related to the smallest eigenvalue) is an important task in the simulation of quantum many-body systems. As the dimension of the underlying vector space grows exponentially in the number of particles, one has to consider appropriate subsets promising both convenient approximation properties and efficient computations. The variational ansatz for this numerical approach leads to the minimization of the Rayleigh quotient. The Alternating Least Squares technique is then applied to break down the eigenvector computation to problems of appropriate size, which can be solved by classical methods. Efficient computations require fast computation of the matrix-vector product and of the inner product of two decomposed vectors. To this end, both appropriate representations of vectors and efficient contraction schemes are needed. Here approaches from many-body quantum physics for one-dimensional and two-dimensional systems (Matrix Product States and Projected Entangled Pair States) are treated mathematically in terms of tensors. We give the definition of these concepts, bring some results concerning uniqueness and numerical stability and show how computations can be executed efficiently within these concepts. Based on this overview we present some modifications and generalizations of these concepts and show that they still allow efficient computations such as applicable contraction schemes. In this context we consider the minimization of the Rayleigh quotient in terms of the {sc parafac} (CP) formalism, where we also allow different tensor partitions. This approach makes use of efficient contraction schemes for the calculation of inner products in a way that can easily be extended to the mps format but also to higher dimensional problems.
Recommendations
- Quantum computation and the evaluation of tensor networks
- Simulating Quantum Computation by Contracting Tensor Networks
- Quantum computing as a particular case of computing with tensors
- Quantum computational networks
- Modelling non-Markovian quantum systems using tensor networks
- Tensor network contractions. Methods and applications to quantum many-body systems
- TeNeS: tensor network solver for quantum lattice systems
- Tensor network states and geometry
- Spin networks and quantum computation
Cites work
- scientific article; zbMATH DE number 1185220 (Why is no real title available?)
- Abundance of translation invariant pure states on quantum spin chains
- An area law for one-dimensional quantum systems
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Any Circulant-Like Preconditioner for Multilevel Matrices Is Not Superlinear
- Approximation of \(2^d\times2^d\) matrices using tensor decomposition
- Area laws in quantum systems: mutual information and correlations
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Colloquium: area laws for the entanglement entropy
- Computational Complexity of Projected Entangled Pair States
- Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
- Density-matrix renormalization. A new numerical method in physics. Lectures of a seminar and workshop held at the Max-Planck-Institut für Physik komplexer Systeme, Dresden, Germany, August 24 - September 18, 1998
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Exploiting matrix symmetries and physical symmetries in matrix product states and tensor trains
- Finitely correlated states on quantum spin chains
- Linear algebra for tensor problems
- Matrix product operator representations
- Matrix product state representations
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Properties of the Eigenvectors of Persymmetric Matrices with Applications to Communication Theory
- Quantum Computing
- Recursive decomposition of multidimensional tensors
- Renormalization and tensor product states in spin chains and lattices
- Tensor Decompositions and Applications
- Tensor-train decomposition
- The density-matrix renormalization group
- The density-matrix renormalization group in the age of matrix product states
- Two soluble models of an antiferromagnetic chain
- Unifying variational methods for simulating quantum many-body systems
Cited in
(19)- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- On traces of tensor representations of diagrams
- A neural tensor decomposition model for high-order sparse data recovery
- Fundamental limitations in the purifications of tensor networks
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- On manifolds of tensors of fixed TT-rank
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- Stable Optimization of a Tensor Product Variational State
- Efficient Quantum Tensor Product Expanders and k-Designs
- Unifying variational methods for simulating quantum many-body systems
- Entanglement bipartitioning and tree tensor networks
- Simulated annealing for tensor network states
- Optimization problems in contracted tensor networks
- Unifying projected entangled pair state contractions
- Algorithm 941: \texttt{htucker} -- a Matlab toolbox for tensors in hierarchical Tucker format
- A literature survey of low-rank tensor approximation techniques
- Quantum computation and the evaluation of tensor networks
- The geometry of algorithms using hierarchical tensors
- Numerical tensor calculus
This page was built for publication: Computations in quantum tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931766)
