Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.21006 · Physical review. B./Physical review. B

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

Thomas Barthel, Qiang Miao

Published Jan 2, 2025• 2 citations
arXivHTMLPDF

Abstract

Strongly correlated quantum matter, such as the insufficiently understood high- temperature superconductors, are difficult to simulate numerically. The multiscale entanglement renormalization ansatz (MERA) is a hierarchical class of tensor networks that efficiently captures the typical ground-state entanglement structures. Motivated by recent advances to employ MERA in quantum-classical algorithms, the authors take a fresh look here, analyzing new variations of the approach including tensor Trotterization and importance sampling. Optimal contraction sequences and algorithmic phase diagrams show that these quantum-inspired methods can substantially reduce computational costs.

DOI
10.1103/physrevb.111.045104

Related papers

Variational Monte Carlo with the multiscale entanglement renormalization ansatz

Andrew J. Ferris, Guifré Vidal

Monte Carlo sampling techniques have been proposed as a strategy to reduce the computational cost of contractions in tensor network approaches to solving many-body systems. Here, we put forward a variational Monte Carlo approach for the multiscale entanglement renormalization ansatz (MERA), which is a unitary tensor network. Two major adjustments are required compared to previous proposals with nonunitary tensor networks. First, instead of sampling over configurations of the original lattice, made of $L$ sites, we sample over configurations of an effective lattice, which is made of just $\mathrm{ln}(L)$ sites. Second, the optimization of unitary tensors must account for their unitary character while being robust to statistical noise, which we accomplish with a modified steepest descent method within the set of unitary tensors. We demonstrate the performance of the variational Monte Carlo MERA approach in the relatively simple context of a finite quantum spin chain at criticality, and discuss future, more challenging applications, including two-dimensional systems.

arXiv:1201.3975•Physical Review B•Apr 30, 2012•19 citations

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Qiang Miao, Thomas Barthel

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

arXiv:2303.08910•Quantum•Feb 11, 2025•8 citations

Tensor Network Renormalization Yields the Multiscale Entanglement Renormalization Ansatz

Glen Evenbly, Guifré Vidal

We show how to build a multiscale entanglement renormalization ansatz (MERA) representation of the ground state of a many-body Hamiltonian H by applying the recently proposed tensor network renormalization [G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405 (2015)] to the Euclidean time evolution operator e(-βH) for infinite β. This approach bypasses the costly energy minimization of previous MERA algorithms and, when applied to finite inverse temperature β, produces a MERA representation of a thermal Gibbs state. Our construction endows tensor network renormalization with a renormalization group flow in the space of wave functions and Hamiltonians (and not merely in the more abstract space of tensors) and extends the MERA formalism to classical statistical systems.

arXiv:1502.05385•Physical Review Letters•Nov 10, 2015•121 citations

Multiscale Entanglement Renormalization Ansatz: Causality and Error Correction

Domenico Pomarico

Computational complexity reduction is at the basis of a new formulation of many-body quantum states according to tensor network ansatz, originally framed in one-dimensional lattices. In order to include long-range entanglement characterizing phase transitions, the multiscale entanglement renormalization ansatz (MERA) defines a sequence of coarse-grained lattices, obtained by targeting the map of a scale-invariant system into an identical coarse-grained one. The quantum circuit associated with this hierarchical structure includes the definition of causal relations and unitary extensions, leading to the definition of ground subspaces as stabilizer codes. The emerging error correcting codes are referred to logical indices located at the highest hierarchical level and to physical indices yielded by redundancy, framed in the AdS-CFT correspondence as holographic quantum codes with bulk and boundary indices, respectively. In a use-case scenario based on errors consisting of spin erasure, the correction is implemented as the reconstruction of a bulk local operator.

Dynamics•Sep 18, 2023•6 citations

Quantum-classical eigensolver using multiscale entanglement renormalization

Qiang Miao, Thomas Barthel

We propose a variational quantum eigensolver (VQE) for the simulation of strongly correlated quantum matter based on a multiscale entanglement renormalization ansatz (MERA) and gradient-based optimization. This MERA quantum eigensolver can have substantially lower computation costs than corresponding classical algorithms. Due to its narrow causal cone, the algorithm can be implemented on noisy intermediate-scale quantum (NISQ) devices and still describe large systems. It is particularly attractive for ion-trap devices with ion-shuttling capabilities. The number of required qubits is system-size independent and increases only to a logarithmic scaling when using quantum amplitude estimation to speed up gradient evaluations. Translation invariance can be used to make computation costs square-logarithmic in the system size and describe the thermodynamic limit. We demonstrate the approach numerically for a MERA with Trotterized disentanglers and isometries. With a few Trotter steps, one recovers the accuracy of the full MERA.

arXiv:2108.13401•Physical Review Research•Aug 30, 2023•16 citations

Improving the efficiency of variational tensor network algorithms

Glen Evenbly, Robert N. C. Pfeifer

We present several results relating to the contraction of generic tensor networks and discuss their application to the simulation of quantum many-body systems using variational approaches based upon tensor network states. Given a closed tensor network $\mathcal{T}$, we prove that if the environment of a single tensor from the network can be evaluated with computational cost $\ensuremath{\kappa}$, then the environment of any other tensor from $\mathcal{T}$ can be evaluated with identical cost $\ensuremath{\kappa}$. Moreover, we describe how the set of all single tensor environments from $\mathcal{T}$ can be simultaneously evaluated with fixed cost $3\ensuremath{\kappa}$. The usefulness of these results, which are applicable to a variety of tensor network methods, is demonstrated for the optimization of a multiscale entanglement renormalization Ansatz for the ground state of a one-dimensional quantum system, where they are shown to substantially reduce the computation time.

arXiv:1310.8023•Physical Review B•Jun 12, 2014•29 citations
Strongly correlated quantum matter, such as the insufficiently understood high- temperature superconductors, are difficult to simulate numerically. The multiscale entanglement renormalization ansatz (MERA) is a hierarchical class of tensor networks that efficiently captures the typical ground-state entanglement structures. Motivated by recent advances to employ MERA in quantum-classical algorithms, the authors take a fresh look here, analyzing new variations of the approach including tensor Trotterization and importance sampling. Optimal contraction sequences and algorithmic phase diagrams show that these quantum-inspired methods can substantially reduce computational costs.
Monte Carlo sampling techniques have been proposed as a strategy to reduce the computational cost of contractions in tensor network approaches to solving many-body systems. Here, we put forward a variational Monte Carlo approach for the multiscale entanglement renormalization ansatz (MERA), which is a unitary tensor network. Two major adjustments are required compared to previous proposals with nonunitary tensor networks. First, instead of sampling over configurations of the original lattice, made of LLL sites, we sample over configurations of an effective lattice, which is made of just ln(L)\mathrm{ln}(L)ln(L) sites. Second, the optimization of unitary tensors must account for their unitary character while being robust to statistical noise, which we accomplish with a modified steepest descent method within the set of unitary tensors. We demonstrate the performance of the variational Monte Carlo MERA approach in the relatively simple context of a finite quantum spin chain at criticality, and discuss future, more challenging applications, including two-dimensional systems.
Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.
We show how to build a multiscale entanglement renormalization ansatz (MERA) representation of the ground state of a many-body Hamiltonian H by applying the recently proposed tensor network renormalization [G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405 (2015)] to the Euclidean time evolution operator e(-βH) for infinite β. This approach bypasses the costly energy minimization of previous MERA algorithms and, when applied to finite inverse temperature β, produces a MERA representation of a thermal Gibbs state. Our construction endows tensor network renormalization with a renormalization group flow in the space of wave functions and Hamiltonians (and not merely in the more abstract space of tensors) and extends the MERA formalism to classical statistical systems.
Computational complexity reduction is at the basis of a new formulation of many-body quantum states according to tensor network ansatz, originally framed in one-dimensional lattices. In order to include long-range entanglement characterizing phase transitions, the multiscale entanglement renormalization ansatz (MERA) defines a sequence of coarse-grained lattices, obtained by targeting the map of a scale-invariant system into an identical coarse-grained one. The quantum circuit associated with this hierarchical structure includes the definition of causal relations and unitary extensions, leading to the definition of ground subspaces as stabilizer codes. The emerging error correcting codes are referred to logical indices located at the highest hierarchical level and to physical indices yielded by redundancy, framed in the AdS-CFT correspondence as holographic quantum codes with bulk and boundary indices, respectively. In a use-case scenario based on errors consisting of spin erasure, the correction is implemented as the reconstruction of a bulk local operator.
We propose a variational quantum eigensolver (VQE) for the simulation of strongly correlated quantum matter based on a multiscale entanglement renormalization ansatz (MERA) and gradient-based optimization. This MERA quantum eigensolver can have substantially lower computation costs than corresponding classical algorithms. Due to its narrow causal cone, the algorithm can be implemented on noisy intermediate-scale quantum (NISQ) devices and still describe large systems. It is particularly attractive for ion-trap devices with ion-shuttling capabilities. The number of required qubits is system-size independent and increases only to a logarithmic scaling when using quantum amplitude estimation to speed up gradient evaluations. Translation invariance can be used to make computation costs square-logarithmic in the system size and describe the thermodynamic limit. We demonstrate the approach numerically for a MERA with Trotterized disentanglers and isometries. With a few Trotter steps, one recovers the accuracy of the full MERA.
We present several results relating to the contraction of generic tensor networks and discuss their application to the simulation of quantum many-body systems using variational approaches based upon tensor network states. Given a closed tensor network T\mathcal{T}T, we prove that if the environment of a single tensor from the network can be evaluated with computational cost $\ensuremath{\kappa}$, then the environment of any other tensor from T\mathcal{T}T can be evaluated with identical cost $\ensuremath{\kappa}$. Moreover, we describe how the set of all single tensor environments from T\mathcal{T}T can be simultaneously evaluated with fixed cost $3\ensuremath{\kappa}$. The usefulness of these results, which are applicable to a variety of tensor network methods, is demonstrated for the optimization of a multiscale entanglement renormalization Ansatz for the ground state of a one-dimensional quantum system, where they are shown to substantially reduce the computation time.