Time evolution of an infinite projected entangled pair state: a neighborhood tensor update

• URL: http://arxiv.org/abs/2107.06635v1
• Date: Wed, 14 Jul 2021 12:21:43 GMT
• Title: Time evolution of an infinite projected entangled pair state: a neighborhood tensor update
• Authors: Jacek Dziarmaga
• Abstract summary: The simple update (SU) and full update (FU) are the two paradigmatic time evolution algorithms for a tensor network known as the infinite projected entangled pair state (iPEPS)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The simple update (SU) and full update (FU) are the two paradigmatic time evolution algorithms for a tensor network known as the infinite projected entangled pair state (iPEPS). They differ by an error measure that is either, respectively, local or takes into account full infinite tensor environment. In this paper we test an intermediate neighborhood tensor update (NTU) accounting for the nearest neighbor environment. This small environment can be contracted exactly in a parallelizable way. It provides an error measure that is Hermitian and non-negative down to machine precision. In the 2D quantum Ising model NTU is shown to yield stable unitary time evolution following a sudden quench. It also yields accurate thermal states despite correlation lengths that reach up to 20 lattice sites. The latter simulations were performed with a manifestly Hermitian purification of a thermal state. Both were performed with reduced tensors that do not include physical (and ancilla) indices. This modification naturally leads to two other schemes: a local SVD update (SVDU) and a full tensor update (FTU) being a variant of FU.

Related papers

• Tensor Decomposition Networks for Fast Machine Learning Interatomic Potential Computations [63.945006006152035]
  tensor decomposition networks (TDNs) achieve competitive performance with dramatic speedup in computations.<n>We evaluate TDNs on PubChemQCR, a newly curated molecular relaxation dataset containing 105 million DFT-calculated snapshots.
  arXiv  Detail & Related papers  (2025-07-01T18:46:27Z)
• Self-Ensembling Gaussian Splatting for Few-Shot Novel View Synthesis [55.561961365113554]
  3D Gaussian Splatting (3DGS) has demonstrated remarkable effectiveness for novel view synthesis (NVS) However, the 3DGS model tends to overfit when trained with sparse posed views, limiting its generalization ability to novel views. We present a Self-Ensembling Gaussian Splatting (SE-GS) approach to alleviate the overfitting problem. Our approach improves NVS quality with few-shot training views, outperforming existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-10-31T18:43:48Z)
• Positive bias makes tensor-network contraction tractable [0.5437298646956507]
  tensor network contraction is a powerful computational tool in quantum many-body physics, quantum information and quantum chemistry. Here, we study how the complexity of tensor-network contraction depends on a different notion of quantumness, namely, the sign structure of its entries.
  arXiv  Detail & Related papers  (2024-10-07T18:27:23Z)
• INK: Injecting kNN Knowledge in Nearest Neighbor Machine Translation [57.952478914459164]
  kNN-MT has provided an effective paradigm to smooth the prediction based on neighbor representations during inference. We propose an effective training framework INK to directly smooth the representation space via adjusting representations of kNN neighbors with a small number of new parameters. Experiments on four benchmark datasets show that method achieves average gains of 1.99 COMET and 1.0 BLEU, outperforming the state-of-the-art kNN-MT system with 0.02x memory space and 1.9x inference speedup.
  arXiv  Detail & Related papers  (2023-06-10T08:39:16Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Renormalization group for measurement and entanglement phase transitions [0.0]
  We analyze the renormalization-group (RG) flows of two effective Lagrangians. We show that the theory for the random tensor network formally possesses a dimensional reduction property analogous to that of the random-field Ising model.
  arXiv  Detail & Related papers  (2023-03-14T12:40:03Z)
• Consistent Diffusion Models: Mitigating Sampling Drift by Learning to be Consistent [97.64313409741614]
  We propose to enforce a emphconsistency property which states that predictions of the model on its own generated data are consistent across time. We show that our novel training objective yields state-of-the-art results for conditional and unconditional generation in CIFAR-10 and baseline improvements in AFHQ and FFHQ.
  arXiv  Detail & Related papers  (2023-02-17T18:45:04Z)
• Time evolution of an infinite projected entangled pair state: a gradient tensor update in the tangent space [0.0]
  Suzuki-Trotter decomposition applied to infinite projected entangled pair state (iPEPS) This paper goes beyond simplified error measures -- like the one used in the full update (FU) It directly maximizes an overlap between the exact iPEPS with the increased bond dimension and the new iPEPS with the truncated one.
  arXiv  Detail & Related papers  (2022-05-23T06:18:28Z)
• Optimization Variance: Exploring Generalization Properties of DNNs [83.78477167211315]
  The test error of a deep neural network (DNN) often demonstrates double descent. We propose a novel metric, optimization variance (OV), to measure the diversity of model updates.
  arXiv  Detail & Related papers  (2021-06-03T09:34:17Z)
• Multi-version Tensor Completion for Time-delayed Spatio-temporal Data [50.762087239885936]
  Real-world-temporal data is often incomplete or inaccurate due to various data loading delays. We propose a low-rank tensor model to predict the updates over time. We obtain up to 27.2% lower root mean-squared-error compared to the best baseline method.
  arXiv  Detail & Related papers  (2021-05-11T19:55:56Z)
• Optimization at the boundary of the tensor network variety [2.1839191255085995]
  tensor network states form a variational ansatz class widely used in the study of quantum many-body systems. Recent work has shown that states on the boundary of this variety can yield more efficient representations for states of physical interest. We show how to optimize over this class in order to find ground states of local Hamiltonians.
  arXiv  Detail & Related papers  (2020-06-30T16:58:55Z)

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.