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:2603.16509

Monte Carlo sampling from a projected entangled-pair state in simulations of quantum annealing in the three dimensional random Ising model

Jacek Dziarmaga

quant-phcond-mat.dis-nncond-mat.str-elSubmitted Mar 17, 2026• Announced Mar 18, 2026• 0 citations
v1 · Mar 17, 2026v2 · Sep 28, 2026
arXivHTMLPDF

Abstract

Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional (3D) tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic phase to a spin-glass phase. The network is represented as a tensor product state, also known-particularly in two dimensions-as a projected entangled-pair state (PEPS). The annealing procedure is repeated for a range of annealing times in order to test the Kibble-Zurek (KZ) power law governing the residual energy at the end of the annealing ramp. For an infinite lattice with periodic nearest-neighbor random Ising couplings, the final energy is evaluated using a deterministic method. For a finite lattice with open boundaries, we introduce a more efficient Monte Carlo sampling approach. In both cases, the residual energy as a function of annealing time approaches the KZ power law as the annealing time increases.

Comments
9 pages, 8 figures

Related papers

Monte Carlo sampling from a projected entangled-pair state in simulations of quantum annealing in the three-dimensional random Ising model

Anonymous

Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic phase to a spin-glass phase. The network is represented as a tensor product state, also known, particularly in two dimensions, as a projected entangled-pair state. The annealing procedure is repeated for a range of annealing times in order to test the Kibble-Zurek (KZ) power law governing the residual energy at the end of the annealing ramp. For an infinite lattice with periodic nearest-neighbor random Ising couplings, the final energy is evaluated using a deterministic method. For a finite lattice with open boundaries, we introduce a more efficient Monte Carlo sampling approach. In both cases, the residual energy as a function of annealing time approaches the KZ power law as the annealing time increases.

Physical review. B./Physical review. B•Sep 11, 2026•0 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

Dynamics of disordered quantum systems with two- and three-dimensional tensor networks

Joseph Tindall, Antonio Francesco Mello, Matthew Fishman +2 more

Large-scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage2 system on a range of lattices. After extensive comparison with existing numerical methods, these experiments were claimed to be beyond the reach of classical computation. Here, we simulated these spin-glass models with lattice-specific tensor networks, using belief propagation (BP) to keep up with the entanglement generated during the time evolution and then extracting expectation values with more sophisticated variants of BP. We found that state-of-the-art accuracies could be achieved with modest computational resources. Moreover, our results are scalable in both two and three dimensions, which we leveraged to verify universal Kibble-Zurek physics on systems involving hundreds of qubits.

arXiv:2503.05693•Science•May 21, 2026•11 citations

Direct sampling of projected entangled-pair states

Tom Vieijra, Jutho Haegeman, Frank Verstraete +1 more

Variational Monte Carlo studies employing projected entangled-pair states (PEPS) have recently shown that they can provide answers to long-standing questions such as the nature of the phases in the two-dimensional ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model. The sampling in these Monte Carlo algorithms is typically performed with Markov chain Monte Carlo algorithms employing local update rules, which often suffer from long autocorrelation times and interdependent samples. We propose a sampling algorithm that generates independent samples from a PEPS, bypassing all problems related to finite autocorrelation times. This algorithm is a generalization of an existing direct sampling algorithm for unitary tensor networks. We introduce an auxiliary probability distribution from which independent samples can be drawn, and combine it with importance sampling in order to evaluate expectation values accurately. We benchmark our algorithm on the classical Ising model and on variational optimization of two-dimensional quantum spin models.

arXiv:2109.07356•Physical review. B./Physical review. B•Dec 21, 2021•37 citations

Dynamics of simulated quantum annealing in random Ising chains

Glen Bigan Mbeng, Lorenzo Privitera, Luca Arceci +1 more

Simulated quantum annealing (SQA) is a classical computational strategy that emulates a quantum annealing (QA) dynamics through a path-integral Monte Carlo whose parameters are changed during the simulation. Here we apply SQA to the one-dimensional transverse field Ising chain, where previous works have shown that, in the presence of disorder, a coherent QA provides a quadratic speedup with respect to classical simulated annealing, with a density of Kibble-Zurek defects decaying as ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{QA}}\ensuremath{\sim}{({log}_{10}\ensuremath{\tau})}^{\ensuremath{-}2}$ as opposed to ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{SA}}\ensuremath{\sim}{({log}_{10}\ensuremath{\tau})}^{\ensuremath{-}1}, \ensuremath{\tau}$ being the total annealing time, while for the ordered case both give the same power law ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{QA}}\ensuremath{\approx}{\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{SA}}\ensuremath{\sim}{\ensuremath{\tau}}^{\ensuremath{-}1/2}$. We show that the dynamics of SQA, while correctly capturing the Kibble-Zurek scaling ${\ensuremath{\tau}}^{\ensuremath{-}1/2}$ for the ordered case, is unable to reproduce the QA dynamics in the disordered case at intermediate $\ensuremath{\tau}$. We analyze and discuss several issues related to the choice of the Monte Carlo moves (local or global in space), the time-continuum limit needed to eliminate the Trotter-discretization error, and the long autocorrelation times shown by a local-in-space Monte Carlo dynamics for large disordered samples.

arXiv:1809.02124•Physical review. B./Physical review. B•Feb 1, 2019•11 citations

Combination of tensor network states and Green's function Monte Carlo

Mingpu Qin

We propose an approach to study the ground state of quantum many-body systems in which tensor network states, specifically projected entangled pair states (PEPSs), and Green's function Monte Carlo (GFMC) are combined. PEPSs, by design, encode the area law which governs the scaling of entanglement entropy in quantum systems with short-range interactions but are hindered by the high computational complexity scaling with bond dimension $D$. GFMC is a highly efficient method, but it usually suffers from the infamous negative sign problem which can be avoided by the fixed-node approximation in which a guiding wave function is utilized to modify the sampling process. The trade-off for the absence of the negative sign problem is the introduction of systematic error by the guiding wave function. In this work, we combine these two methods, PEPS and GFMC, to take advantage of both of them. PEPSs are very accurate variational wave functions, while at the same time, only contractions of the single-layer tensor network are necessary in GFMC, which reduces the cost substantially. Moreover, energy obtained in GFMC is guaranteed to be variational and lower than the variational energy of the guiding PEPS wave function. Benchmark results of the ${J}_{1}\ensuremath{-}{J}_{2}$ Heisenberg model on the square lattice are provided.

arXiv:2006.15608•Physical review. B./Physical review. B•Sep 24, 2020•6 citations
Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional (3D) tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic phase to a spin-glass phase. The network is represented as a tensor product state, also known-particularly in two dimensions-as a projected entangled-pair state (PEPS). The annealing procedure is repeated for a range of annealing times in order to test the Kibble-Zurek (KZ) power law governing the residual energy at the end of the annealing ramp. For an infinite lattice with periodic nearest-neighbor random Ising couplings, the final energy is evaluated using a deterministic method. For a finite lattice with open boundaries, we introduce a more efficient Monte Carlo sampling approach. In both cases, the residual energy as a function of annealing time approaches the KZ power law as the annealing time increases.
Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic phase to a spin-glass phase. The network is represented as a tensor product state, also known, particularly in two dimensions, as a projected entangled-pair state. The annealing procedure is repeated for a range of annealing times in order to test the Kibble-Zurek (KZ) power law governing the residual energy at the end of the annealing ramp. For an infinite lattice with periodic nearest-neighbor random Ising couplings, the final energy is evaluated using a deterministic method. For a finite lattice with open boundaries, we introduce a more efficient Monte Carlo sampling approach. In both cases, the residual energy as a function of annealing time approaches the KZ power law as the annealing time increases.
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.
Large-scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage2 system on a range of lattices. After extensive comparison with existing numerical methods, these experiments were claimed to be beyond the reach of classical computation. Here, we simulated these spin-glass models with lattice-specific tensor networks, using belief propagation (BP) to keep up with the entanglement generated during the time evolution and then extracting expectation values with more sophisticated variants of BP. We found that state-of-the-art accuracies could be achieved with modest computational resources. Moreover, our results are scalable in both two and three dimensions, which we leveraged to verify universal Kibble-Zurek physics on systems involving hundreds of qubits.
Variational Monte Carlo studies employing projected entangled-pair states (PEPS) have recently shown that they can provide answers to long-standing questions such as the nature of the phases in the two-dimensional ${J}_{1}\text{\ensuremath{-}}{J}_{2}$ model. The sampling in these Monte Carlo algorithms is typically performed with Markov chain Monte Carlo algorithms employing local update rules, which often suffer from long autocorrelation times and interdependent samples. We propose a sampling algorithm that generates independent samples from a PEPS, bypassing all problems related to finite autocorrelation times. This algorithm is a generalization of an existing direct sampling algorithm for unitary tensor networks. We introduce an auxiliary probability distribution from which independent samples can be drawn, and combine it with importance sampling in order to evaluate expectation values accurately. We benchmark our algorithm on the classical Ising model and on variational optimization of two-dimensional quantum spin models.
Simulated quantum annealing (SQA) is a classical computational strategy that emulates a quantum annealing (QA) dynamics through a path-integral Monte Carlo whose parameters are changed during the simulation. Here we apply SQA to the one-dimensional transverse field Ising chain, where previous works have shown that, in the presence of disorder, a coherent QA provides a quadratic speedup with respect to classical simulated annealing, with a density of Kibble-Zurek defects decaying as ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{QA}}\ensuremath{\sim}{({log}_{10}\ensuremath{\tau})}^{\ensuremath{-}2}$ as opposed to ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{SA}}\ensuremath{\sim}{({log}_{10}\ensuremath{\tau})}^{\ensuremath{-}1}, \ensuremath{\tau}$ being the total annealing time, while for the ordered case both give the same power law ${\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{QA}}\ensuremath{\approx}{\ensuremath{\rho}}_{\mathrm{KZ}}^{\mathrm{SA}}\ensuremath{\sim}{\ensuremath{\tau}}^{\ensuremath{-}1/2}$. We show that the dynamics of SQA, while correctly capturing the Kibble-Zurek scaling ${\ensuremath{\tau}}^{\ensuremath{-}1/2}$ for the ordered case, is unable to reproduce the QA dynamics in the disordered case at intermediate $\ensuremath{\tau}$. We analyze and discuss several issues related to the choice of the Monte Carlo moves (local or global in space), the time-continuum limit needed to eliminate the Trotter-discretization error, and the long autocorrelation times shown by a local-in-space Monte Carlo dynamics for large disordered samples.
We propose an approach to study the ground state of quantum many-body systems in which tensor network states, specifically projected entangled pair states (PEPSs), and Green's function Monte Carlo (GFMC) are combined. PEPSs, by design, encode the area law which governs the scaling of entanglement entropy in quantum systems with short-range interactions but are hindered by the high computational complexity scaling with bond dimension DDD. GFMC is a highly efficient method, but it usually suffers from the infamous negative sign problem which can be avoided by the fixed-node approximation in which a guiding wave function is utilized to modify the sampling process. The trade-off for the absence of the negative sign problem is the introduction of systematic error by the guiding wave function. In this work, we combine these two methods, PEPS and GFMC, to take advantage of both of them. PEPSs are very accurate variational wave functions, while at the same time, only contractions of the single-layer tensor network are necessary in GFMC, which reduces the cost substantially. Moreover, energy obtained in GFMC is guaranteed to be variational and lower than the variational energy of the guiding PEPS wave function. Benchmark results of the ${J}_{1}\ensuremath{-}{J}_{2}$ Heisenberg model on the square lattice are provided.