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:0708.2232 · Physical Review Letters

Variational Quantum Monte Carlo Simulations with Tensor-Network States

Anders W. Sandvik, Guifré Vidal

Published Nov 29, 2007• 168 citations
arXivHTMLPDF

Abstract

We show that the formalism of tensor-network states, such as the matrix-product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of this approach by explicit MPS calculations for the transverse Ising chain with up to N=256 spins at criticality, using periodic boundary conditions and D x D matrices with D up to 48. The computational cost of our scheme formally scales as ND3, whereas standard MPS approaches and the related density matrix renormalization group method scale as ND5 and ND6, respectively, for periodic systems.

DOI
10.1103/physrevlett.99.220602

Related papers

Pushing the boundaries of Matrix Product States in quantum many-body physics and computing

Guglielmo Lami

The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.

•Dec 18, 2023•0 citations

Projector quantum Monte Carlo with matrix product states

Sebastian Wouters, Brecht Verstichel, Dimitri Van Neck +1 more

We marry tensor network states (TNS) and projector quantum Monte Carlo (PMC) to overcome the high computational scaling of TNS and the sign problem of PMC. Using TNS as trial wave functions provides a route to systematically improve the sign structure and to eliminate the bias in fixed-node and constrained-path PMC. As a specific example, we describe phaseless auxiliary-field quantum Monte Carlo with matrix product states (MPS-AFQMC). MPS-AFQMC improves significantly on the density-matrix renormalization group (DMRG) ground-state energy. For the ${J}_{1}\ensuremath{-}{J}_{2}$ model on two-dimensional square lattices, we observe with MPS-AFQMC an order of magnitude reduction in the error for all couplings, compared to DMRG. The improvement is independent of walker bond dimension, and we therefore use bond dimension 1 for the walkers. The computational cost of MPS-AFQMC is then quadratic in the bond dimension of the trial wave function, which is lower than the cubic scaling of DMRG. The error due to the constrained-path bias is proportional to the variational error of the trial wave function. We show that for the ${J}_{1}\ensuremath{-}{J}_{2}$ model on two-dimensional square lattices, a linear extrapolation of the MPS-AFQMC energy with the discarded weight from the DMRG calculation allows us to remove the constrained-path bias. Extensions to other tensor networks are briefly discussed.

arXiv:1403.3125•Physical Review B•Jul 3, 2014•29 citations

Tensor-network-based variational Monte Carlo approach to the non-equilibrium steady state of open quantum systems

Dawid A. Hryniuk, Marzena Hanna Szymańska

We introduce a novel method of efficiently simulating the non-equilibrium steady state of large many-body open quantum systems with highly non-local interactions, based on a variational Monte Carlo optimization of a matrix product operator ansatz. Our approach outperforms and offers several advantages over comparable algorithms, such as an improved scaling of the computational cost with respect to the bond dimension for periodic systems. We showcase the versatility of our approach by studying the phase diagrams and correlation functions of the dissipative quantum Ising model with collective dephasing and long-ranged power law interactions for spin chains of up to N=100 spins.

arXiv:2405.12044•Quantum•Sep 17, 2024•6 citations

Accurate simulation for finite projected entangled pair states in two dimensions

Wen-Yuan Liu, Yi-Zhen Huang, Shou-Shu Gong +1 more

Based on the scheme of variational Monte Carlo sampling, we develop an accurate and efficient two-dimensional tensor-network algorithm to simulate quantum lattice models. We find that Monte Carlo sampling shows huge advantages in dealing with finite projected entangled pair states, which allows significantly enlarged system size and improves the accuracy of tensor network simulation. We demonstrate our method on the square-lattice antiferromagnetic Heisenberg model up to $32\ifmmode\times\else\texttimes\fi{}32$ sites, as well as a highly frustrated ${J}_{1}\ensuremath{-}{J}_{2}$ model up to $24\ifmmode\times\else\texttimes\fi{}24$ sites. The results, including ground state energy and spin correlations, are in excellent agreement with those of the available quantum Monte Carlo or density matrix renormalization group methods. Therefore, our method substantially advances the calculation of 2D tensor networks for finite systems, and potentially opens a new door towards resolving many challenging strongly correlated quantum many-body problems.

arXiv:1908.09359•Physical review. B./Physical review. B•Jun 24, 2021•35 citations

Simulating quantum circuits with tree tensor networks using density-matrix renormalization group algorithm

Aditya Dubey, Zeki Zeybek, Peter Schmelcher

Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only for validating and benchmarking quantum hardware but also for gaining deeper insights into the behavior of quantum algorithms. A promising framework for classical simulation is provided by tensor networks. Recently, the density-matrix renormalization group (DMRG) algorithm was developed for simulating quantum circuits using matrix product states (MPS). Although MPS are efficient for representing quantum states with one-dimensional correlation structures, the fixed linear geometry restricts the expressive power of the MPS. In this work, we extend the DMRG algorithm for simulating quantum circuits to tree tensor networks (TTNs). The framework employs a variational compression scheme that optimizes the TTN to approximate the evolved quantum state. To benchmark the method, we simulate random circuits and the quantum approximate optimization algorithm (QAOA) with various two-qubit gate connectivities. For the random circuits, we devise treelike gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations. For the QAOA circuits, a naive TTN construction that exploits graph structure significantly improves the simulation fidelities. Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits, particularly when gate connectivities exhibit clustering or a hierarchical structure.

arXiv:2504.16718•Physical review. B./Physical review. B•Aug 28, 2025•1 citation

Monte Carlo simulations of two-dimensional fermion systems with string-bond states

Jeong-Pil Song, Rudolf Torsten Clay

We describe an application of variational Monte Carlo to two-dimensional fermionic systems within the recently developed tensor-network string-bond state ansatz. We use a combination of variational Monte Carlo and stochastic optimization to optimize the matrix-product state matrices representing the ground state. We present results for a two-dimensional spinless fermion model including nearest-neighbor Coulomb interactions and determine using finite-size scaling the phase boundary between charge-ordered insulating and metallic phases. This approach can treat frustrated systems and be easily extended to fermion models with spin.

arXiv:1305.4151•Physical Review B•Feb 3, 2014•8 citations
We show that the formalism of tensor-network states, such as the matrix-product states (MPS), can be used as a basis for variational quantum Monte Carlo simulations. Using a stochastic optimization method, we demonstrate the potential of this approach by explicit MPS calculations for the transverse Ising chain with up to N=256 spins at criticality, using periodic boundary conditions and D x D matrices with D up to 48. The computational cost of our scheme formally scales as ND3, whereas standard MPS approaches and the related density matrix renormalization group method scale as ND5 and ND6, respectively, for periodic systems.
The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.
We marry tensor network states (TNS) and projector quantum Monte Carlo (PMC) to overcome the high computational scaling of TNS and the sign problem of PMC. Using TNS as trial wave functions provides a route to systematically improve the sign structure and to eliminate the bias in fixed-node and constrained-path PMC. As a specific example, we describe phaseless auxiliary-field quantum Monte Carlo with matrix product states (MPS-AFQMC). MPS-AFQMC improves significantly on the density-matrix renormalization group (DMRG) ground-state energy. For the ${J}_{1}\ensuremath{-}{J}_{2}$ model on two-dimensional square lattices, we observe with MPS-AFQMC an order of magnitude reduction in the error for all couplings, compared to DMRG. The improvement is independent of walker bond dimension, and we therefore use bond dimension 1 for the walkers. The computational cost of MPS-AFQMC is then quadratic in the bond dimension of the trial wave function, which is lower than the cubic scaling of DMRG. The error due to the constrained-path bias is proportional to the variational error of the trial wave function. We show that for the ${J}_{1}\ensuremath{-}{J}_{2}$ model on two-dimensional square lattices, a linear extrapolation of the MPS-AFQMC energy with the discarded weight from the DMRG calculation allows us to remove the constrained-path bias. Extensions to other tensor networks are briefly discussed.
We introduce a novel method of efficiently simulating the non-equilibrium steady state of large many-body open quantum systems with highly non-local interactions, based on a variational Monte Carlo optimization of a matrix product operator ansatz. Our approach outperforms and offers several advantages over comparable algorithms, such as an improved scaling of the computational cost with respect to the bond dimension for periodic systems. We showcase the versatility of our approach by studying the phase diagrams and correlation functions of the dissipative quantum Ising model with collective dephasing and long-ranged power law interactions for spin chains of up to N=100 spins.
Based on the scheme of variational Monte Carlo sampling, we develop an accurate and efficient two-dimensional tensor-network algorithm to simulate quantum lattice models. We find that Monte Carlo sampling shows huge advantages in dealing with finite projected entangled pair states, which allows significantly enlarged system size and improves the accuracy of tensor network simulation. We demonstrate our method on the square-lattice antiferromagnetic Heisenberg model up to $32\ifmmode\times\else\texttimes\fi{}32$ sites, as well as a highly frustrated ${J}_{1}\ensuremath{-}{J}_{2}$ model up to $24\ifmmode\times\else\texttimes\fi{}24$ sites. The results, including ground state energy and spin correlations, are in excellent agreement with those of the available quantum Monte Carlo or density matrix renormalization group methods. Therefore, our method substantially advances the calculation of 2D tensor networks for finite systems, and potentially opens a new door towards resolving many challenging strongly correlated quantum many-body problems.
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only for validating and benchmarking quantum hardware but also for gaining deeper insights into the behavior of quantum algorithms. A promising framework for classical simulation is provided by tensor networks. Recently, the density-matrix renormalization group (DMRG) algorithm was developed for simulating quantum circuits using matrix product states (MPS). Although MPS are efficient for representing quantum states with one-dimensional correlation structures, the fixed linear geometry restricts the expressive power of the MPS. In this work, we extend the DMRG algorithm for simulating quantum circuits to tree tensor networks (TTNs). The framework employs a variational compression scheme that optimizes the TTN to approximate the evolved quantum state. To benchmark the method, we simulate random circuits and the quantum approximate optimization algorithm (QAOA) with various two-qubit gate connectivities. For the random circuits, we devise treelike gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations. For the QAOA circuits, a naive TTN construction that exploits graph structure significantly improves the simulation fidelities. Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits, particularly when gate connectivities exhibit clustering or a hierarchical structure.
We describe an application of variational Monte Carlo to two-dimensional fermionic systems within the recently developed tensor-network string-bond state ansatz. We use a combination of variational Monte Carlo and stochastic optimization to optimize the matrix-product state matrices representing the ground state. We present results for a two-dimensional spinless fermion model including nearest-neighbor Coulomb interactions and determine using finite-size scaling the phase boundary between charge-ordered insulating and metallic phases. This approach can treat frustrated systems and be easily extended to fermion models with spin.