Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo

• URL: http://arxiv.org/abs/2407.21006v3
• Date: Sat, 04 Jan 2025 22:17:32 GMT
• Title: Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
• Authors: Thomas Barthel, Qiang Miao,
• Abstract summary: We investigate whether tensor Trotterization and/or variational Monte Carlo sampling can lead to quantum-inspired classical MERA algorithms. Algorithmic phase diagrams indicate the best MERA method depending on the scaling of the energy accuracy and the optimal number of Trotter steps with the bond dimension.
• Score: 0.0
• License:
• Abstract: The multi-scale entanglement renormalization ansatz (MERA) is a hierarchical class of tensor network states motivated by the real-space renormalization group. It is used to simulate strongly correlated quantum many-body systems. For prominent MERA structures in one and two spatial dimensions and different optimization strategies, we determine the optimal scaling of contraction costs as well as corresponding contraction sequences and algorithmic phase diagrams. This is motivated by recent efforts to employ MERA in hybrid quantum-classical algorithms, where the MERA tensors are Trotterized, i.e., chosen as circuits of quantum gates, and observables as well as energy gradients are evaluated by sampling causal-cone states. We investigate whether tensor Trotterization and/or variational Monte Carlo (VMC) sampling can lead to quantum-inspired classical MERA algorithms that perform better than the traditional optimization of full MERA based on the exact evaluation of energy gradients. Algorithmic phase diagrams indicate the best MERA method depending on the scaling of the energy accuracy and the optimal number of Trotter steps with the bond dimension. The results suggest substantial gains due to VMC for two-dimensional systems.

Related papers

• Variationally optimizing infinite projected entangled-pair states at large bond dimensions: A split-CTMRG approach [0.2796197251957244]
  We introduce an alternative "split-CTMRG" algorithm, which maintains separate PEPS layers and leverages new environment tensors, reducing computational complexity while preserving accuracy. Benchmarks on quantum lattice models demonstrate substantial speedups for variational energy optimization, rendering this method valuable for large-scale PEPS simulations.
  arXiv  Detail & Related papers  (2025-02-14T16:59:33Z)
• Quantum algorithms for the variational optimization of correlated electronic states with stochastic reconfiguration and the linear method [0.0]
  We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators. While an implementation on classical computing hardware would require exponentially growing compute cost, the cost (number of circuits and shots) of our quantum algorithms is in system size.
  arXiv  Detail & Related papers  (2024-08-03T17:53:35Z)
• Federated Conditional Stochastic Optimization [110.513884892319]
  Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML. This paper proposes algorithms for distributed federated learning.
  arXiv  Detail & Related papers  (2023-10-04T01:47:37Z)
• Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems [0.0]
  Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. We show how the convergence can be substantially improved by building up the MERA layer by layer in the stage and by scanning through the phase diagram during optimization.
  arXiv  Detail & Related papers  (2023-03-15T20:09:45Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Differentiable Programming of Isometric Tensor Networks [0.0]
  Differentiable programming is a new programming paradigm which enables large scale optimization through automatic calculation of gradients also known as auto-differentiation. Here, we extend the differentiable programming to tensor networks with isometric constraints with applications to multiscale entanglement renormalization ansatz (MERA) and tensor network renormalization (TNR) We numerically tested our methods on 1D critical quantum Ising spin chain and 2D classical Ising model. We calculate the ground state energy for the 1D quantum model and internal energy for the classical model, and scaling dimensions of scaling operators and find they all agree
  arXiv  Detail & Related papers  (2021-10-08T05:29:41Z)
• Quantum-classical eigensolver using multiscale entanglement renormalization [0.0]
  We propose a variational quantum eigensolver (VQE) for the simulation of strongly-correlated quantum matter. It can have substantially lower costs than corresponding classical algorithms. It is particularly attractive for ion-trap devices with ion-shuttling capabilities.
  arXiv  Detail & Related papers  (2021-08-30T17:46:35Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)

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.