Entanglement estimation in tensor network states via sampling
- URL: http://arxiv.org/abs/2202.04089v3
- Date: Tue, 26 Jul 2022 07:04:58 GMT
- Title: Entanglement estimation in tensor network states via sampling
- Authors: Noa Feldman, Augustine Kshetrimayum, Jens Eisert, Moshe Goldstein
- Abstract summary: We introduce a method for extracting meaningful entanglement measures of tensor network states in general dimensions.
We test our method on the one-dimensional critical XX chain and the two-dimensional toric code in a checkerboard geometry.
- Score: 0.688204255655161
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce a method for extracting meaningful entanglement measures of
tensor network states in general dimensions. Current methods require the
explicit reconstruction of the density matrix, which is highly demanding, or
the contraction of replicas, which requires an effort exponential in the number
of replicas and which is costly in terms of memory. In contrast, our method
requires the stochastic sampling of matrix elements of the classically
represented reduced states with respect to random states drawn from simple
product probability measures constituting frames. Even though not corresponding
to physical operations, such matrix elements are straightforward to calculate
for tensor network states, and their moments provide the R\'enyi entropies and
negativities as well as their symmetry-resolved components. We test our method
on the one-dimensional critical XX chain and the two-dimensional toric code in
a checkerboard geometry. Although the cost is exponential in the subsystem
size, it is sufficiently moderate so that - in contrast with other approaches -
accurate results can be obtained on a personal computer for relatively large
subsystem sizes.
Related papers
- Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
We introduce an algorithm for data quantization based on the principles of Kashin representation.
Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
arXiv Detail & Related papers (2024-04-15T12:38:46Z) - Tensor Network Representation and Entanglement Spreading in Many-Body
Localized Systems: A Novel Approach [0.0]
A novel method has been devised to compute the Local Integrals of Motion for a one-dimensional many-body localized system.
A class of optimal unitary transformations is deduced in a tensor-network formalism to diagonalize the Hamiltonian of the specified system.
The efficiency of the method was assessed and found to be both fast and almost accurate.
arXiv Detail & Related papers (2023-12-13T14:28:45Z) - The Decimation Scheme for Symmetric Matrix Factorization [0.0]
Matrix factorization is an inference problem that has acquired importance due to its vast range of applications.
We study this extensive rank problem, extending the alternative 'decimation' procedure that we recently introduced.
We introduce a simple algorithm based on a ground state search that implements decimation and performs matrix factorization.
arXiv Detail & Related papers (2023-07-31T10:53:45Z) - A coherence parameter characterizing generative compressed sensing with
Fourier measurements [8.106641866299379]
We prove the first known restricted isometry guarantee for generative compressed sensing with subsampled isometries.
Recovery efficacy is characterized by the coherence, a new parameter, which measures the interplay between the range of the network and the measurement matrix.
arXiv Detail & Related papers (2022-07-19T15:49:41Z) - 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) - Manifold learning-based polynomial chaos expansions for high-dimensional
surrogate models [0.0]
We introduce a manifold learning-based method for uncertainty quantification (UQ) in describing systems.
The proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
arXiv Detail & Related papers (2021-07-21T00:24:15Z) - Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term.
We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
arXiv Detail & Related papers (2021-06-14T17:19:44Z) - Learning Optical Flow from a Few Matches [67.83633948984954]
We show that the dense correlation volume representation is redundant and accurate flow estimation can be achieved with only a fraction of elements in it.
Experiments show that our method can reduce computational cost and memory use significantly, while maintaining high accuracy.
arXiv Detail & Related papers (2021-04-05T21:44:00Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z) - Eigendecomposition-Free Training of Deep Networks for Linear
Least-Square Problems [107.3868459697569]
We introduce an eigendecomposition-free approach to training a deep network.
We show that our approach is much more robust than explicit differentiation of the eigendecomposition.
Our method has better convergence properties and yields state-of-the-art results.
arXiv Detail & Related papers (2020-04-15T04:29:34Z) - Semiparametric Nonlinear Bipartite Graph Representation Learning with
Provable Guarantees [106.91654068632882]
We consider the bipartite graph and formalize its representation learning problem as a statistical estimation problem of parameters in a semiparametric exponential family distribution.
We show that the proposed objective is strongly convex in a neighborhood around the ground truth, so that a gradient descent-based method achieves linear convergence rate.
Our estimator is robust to any model misspecification within the exponential family, which is validated in extensive experiments.
arXiv Detail & Related papers (2020-03-02T16:40:36Z)
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.