Tangent-space methods for truncating uniform MPS

• URL: http://arxiv.org/abs/2001.11882v3
• Date: Thu, 11 Feb 2021 15:56:28 GMT
• Title: Tangent-space methods for truncating uniform MPS
• Authors: Bram Vanhecke, Maarten Van Damme, Jutho Haegeman, Laurens Vanderstraeten, Frank Verstraete
• Abstract summary: A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension. We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.

Related papers

• A fixed-point algorithm for matrix projections with applications in quantum information [7.988085110283119]
  We show that our algorithm converges exponentially fast to the optimal solution in the number of iterations. We discuss several applications of our algorithm in quantum resource theories and quantum Shannon theory.
  arXiv  Detail & Related papers  (2023-12-22T11:16:11Z)
• An Efficient Algorithm for Clustered Multi-Task Compressive Sensing [60.70532293880842]
  Clustered multi-task compressive sensing is a hierarchical model that solves multiple compressive sensing tasks. The existing inference algorithm for this model is computationally expensive and does not scale well in high dimensions. We propose a new algorithm that substantially accelerates model inference by avoiding the need to explicitly compute these covariance matrices.
  arXiv  Detail & Related papers  (2023-09-30T15:57:14Z)
• Fair Recommendation by Geometric Interpretation and Analysis of Matrix Factorization [4.658166900129066]
  Matrix factorization-based recommender system is in effect an angle preserving dimensionality reduction technique. We reformulate the original angle preserving dimensionality reduction problem into a distance preserving dimensionality reduction problem. We show that the geometric shape of input data of recommender system in its original higher dimension are distributed on co-centric circles with interesting properties.
  arXiv  Detail & Related papers  (2023-01-10T05:30:46Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Density matrix reconstruction using non-negative matrix product states [0.0]
  Quantum state tomography is a key technique for quantum information processing, but is challenging due to the exponential growth of its complexity with the system size. We propose an algorithm which iteratively finds the best non-negative matrix product state approximation based on a set of measurement outcomes whose size does not necessarily grow exponentially. As applications, our algorithm is numerically demonstrated to reconstruct the ground state of the XXZ spin chain under depolarizing noise.
  arXiv  Detail & Related papers  (2022-04-26T15:32:35Z)
• High-Dimensional Sparse Bayesian Learning without Covariance Matrices [66.60078365202867]
  We introduce a new inference scheme that avoids explicit construction of the covariance matrix. Our approach couples a little-known diagonal estimation result from numerical linear algebra with the conjugate gradient algorithm. On several simulations, our method scales better than existing approaches in computation time and memory.
  arXiv  Detail & Related papers  (2022-02-25T16:35:26Z)
• Sublinear Time Approximation of Text Similarity Matrices [50.73398637380375]
  We introduce a generalization of the popular Nystr"om method to the indefinite setting. Our algorithm can be applied to any similarity matrix and runs in sublinear time in the size of the matrix. We show that our method, along with a simple variant of CUR decomposition, performs very well in approximating a variety of similarity matrices.
  arXiv  Detail & Related papers  (2021-12-17T17:04:34Z)
• Contour Integral-based Quantum Algorithm for Estimating Matrix Eigenvalue Density [5.962184741057505]
  We propose a quantum algorithm for computing the eigenvalue density in a given interval. The eigenvalue count in a given interval is derived as the probability of observing a bit pattern in a fraction of the qubits of the output state.
  arXiv  Detail & Related papers  (2021-12-10T08:58:44Z)
• Direct solution of multiple excitations in a matrix product state with block Lanczos [62.997667081978825]
  We introduce the multi-targeted density matrix renormalization group method that acts on a bundled matrix product state, holding many excitations. A large number of excitations can be obtained at a small bond dimension with highly reliable local observables throughout the chain.
  arXiv  Detail & Related papers  (2021-09-16T18:36:36Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.