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

Numerical simulation of D-Wave's quantum advantage experiment with time-dependent variational Monte Carlo

Roeland Wiersema

quant-phcond-mat.dis-nnSubmitted Sep 1, 2026• Announced Sep 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Programmable quantum annealers can realize real-time dynamics of frustrated transverse-field Ising models on large, nontrivial graphs. Recent work by King et al. argued that the classical simulation of such experiments would require exponential computational resources for classical methods such as tensor networks and neural quantum states. Here, we numerically simulate the D-Wave spin-glass annealing protocol with time-dependent variational Monte Carlo (t-VMC) using a correlator state tailored to spin-glass dynamics. For the two-dimensional cylinder, three-dimensional dimer, diamond, and biclique instances considered, at annealing times of 7 and 20 ns, we show that systematically increasing the variational ansatz size enables t-VMC to approximate the final two-spin correlation errors of the quantum processing unit (QPU). We also perform an accurate large-scale simulation of a challenging biclique instance for which no other variational method is known to work, and we find close agreement with the quantum annealer. Through ablation studies, we identify poor Markov-chain mixing, high-variance local-energy estimators, and stochastic Runge-Kutta error estimates as the principal numerical failure modes. We address these numerical issues by using parallel tempering, blurred sampling and an importance-weighted differential equation solver, thereby clarifying the numerical requirements for stable, large-scale t-VMC simulations. Our results extend the frontier of classical simulation while providing a realistic assessment of the computational costs of simulating quantum dynamics at this scale.

Related papers

Challenging the Quantum Advantage Frontier with Large-Scale Classical Simulations of Annealing Dynamics

Linda Mauron, Giuseppe Carleo

Recent demonstrations of D-Wave's annealing-based quantum simulators have established new benchmarks for quantum computational advantage [arXiv:2403.00910]. However, the precise location of the classical-quantum computational frontier remains an open question, as classical simulation strategies continue to evolve. Here, we demonstrate that time-dependent variational Monte Carlo (t-VMC) with a physically motivated Jastrow-Feenberg wave function can efficiently simulate the quantum annealing of spin glasses up to system sizes previously thought to be intractable. Our approach achieves accuracy comparable to that of quantum processing units while requiring only polynomially scaling computational resources, in stark contrast to entangled-limited tensor network methods that scale exponentially. For systems up to 128 spins on a three-dimensional diamond lattice, we maintain correlation errors below 7%, which match or exceed the precision of existing quantum hardware. Rigorous assessments of residual energies and time-dependent variational principle errors establish clear performance benchmarks for classical simulations. These findings substantially shift the quantum advantage frontier and underscore that classical variational techniques, which are not fundamentally constrained by entanglement growth, remain competitive at larger system sizes than previously anticipated.

arXiv:2503.08247•Mar 11, 2025•1 citation

Simulating adiabatic quantum computation with a variational approach

Giuseppe Carleo, Bela Bauer, Matthias Troyer

The theoretical analysis of the Adiabatic Quantum Computation protocol presents several challenges resulting from the difficulty of simulating, with classical resources, the unitary dynamics of a large quantum device. We present here a variational approach to substantially alleviate this problem in many situations of interest. Our approach is based on the time-dependent Variational Monte Carlo method, in conjunction with a correlated and time-dependent Jastrow ansatz. We demonstrate that accurate results can be obtained in a variety of problems, ranging from the description of defect generation through a dynamical phase transition in 1D to the complex dynamics of frustrated spin-glass problems both on fully-connected and Chimera graphs.

arXiv:2403.05147•Mar 8, 2024•0 citations

Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics

Joseph Vovrosh, Sergi Julià-Farré, Wladislaw Krinitsin +11 more

The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.

quant-pharXiv:2511.19340•Physical Review Research•Nov 25, 2025•1 citation

Unraveling Open Quantum Dynamics with Time-Dependent Variational Monte Carlo

Christian Apostoli, Jacopo D'Alberto, Marco G. Genoni +2 more

We introduce a method to simulate open quantum many-body dynamics by combining time-dependent variational Monte Carlo (tVMC) with quantum trajectory techniques. Our approach unravels the Lindblad master equation into an ensemble of stochastic Schrödinger equations for a variational ansatz, avoiding the exponential cost of density matrix evolution. The method is compatible with generic ansatzë, including expressive neural-network wavefunctions. We derive the nonlinear stochastic equations of motion for the variational parameters and employ suitable Stratonovich numerical solvers. To validate our approach, we simulate quenches in the locally dissipative long-range Ising model in a transverse field, accurately capturing non-equilibrium magnetization and spin squeezing dynamics relevant to trapped-ion and Rydberg atom experiments. The framework is computationally efficient, scalable on high-performance computing platforms, and can be readily integrated into existing tVMC implementations. This work enables large-scale simulations of complex, dissipative quantum systems in higher dimensions, with broad implications for quantum technology and fundamental science.

arXiv:2506.23928•Jun 30, 2025•0 citations

Partition Function Estimation Using Analog Quantum Processors

Thinh Le, Elijah Pelofske

We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like reverse quantum anneals, and standard linear-ramp quantum annealing. The control parameters used to attenuate the quality of the simulations are the effective analog energy scale of the J coupling, the total annealing time, and for the case of reverse annealing the anneal-pause. The core estimation technique is to sample across the energy spectrum of the classical Hamiltonian of interest, and therefore obtain a density of states estimate for each energy level, which in turn can be used to compute an estimate of the partition function with some sampling error. This estimation technique is powerful because once the distribution is sampled it allows thermodynamic quantity computation at arbitrary temperatures. On a $25$ spin $\pm J$ hardware graph native Ising model we find parameter regimes of the D-Wave processors that provide comparable result quality to two standard classical Monte Carlo methods, Multiple Histogram Reweighting and Wang-Landau. Remarkably, we find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model; on a Pegasus graph-structured QPU we report a logarithmic relative error of $7.6 \times 10^{-6}$, from $171,000$ samples generated using $0.2$ seconds of QPU time with an anneal time of $8$ nanoseconds per sample which is interestingly within the closed system dynamics timescale of the superconducting qubits.

quant-pharXiv:2512.19685•Dec 23, 2025•0 citations

Neural Projected Quantum Dynamics: a systematic study

Luca Gravina, Vincenzo Savona, Filippo Vicentini

We investigate the challenge of classical simulation of unitary quantum dynamics with variational Monte Carlo approaches, addressing the instabilities and high computational demands of existing methods. By systematically analyzing the convergence of stochastic infidelity optimizations, examining the variance properties of key stochastic estimators, and evaluating the error scaling of multiple dynamical discretization schemes, we provide a thorough formalization and significant improvements to the projected time-dependent Variational Monte Carlo (p-tVMC) method. We benchmark our approach on a two-dimensional Ising quench, achieving state-of-the-art performance. This work establishes p-tVMC as a powerful framework for simulating the dynamics of large-scale two-dimensional quantum systems, surpassing alternative VMC strategies on the investigated benchmark problems.

arXiv:2410.10720•Quantum•Jul 22, 2025•15 citations
Programmable quantum annealers can realize real-time dynamics of frustrated transverse-field Ising models on large, nontrivial graphs. Recent work by King et al. argued that the classical simulation of such experiments would require exponential computational resources for classical methods such as tensor networks and neural quantum states. Here, we numerically simulate the D-Wave spin-glass annealing protocol with time-dependent variational Monte Carlo (t-VMC) using a correlator state tailored to spin-glass dynamics. For the two-dimensional cylinder, three-dimensional dimer, diamond, and biclique instances considered, at annealing times of 7 and 20 ns, we show that systematically increasing the variational ansatz size enables t-VMC to approximate the final two-spin correlation errors of the quantum processing unit (QPU). We also perform an accurate large-scale simulation of a challenging biclique instance for which no other variational method is known to work, and we find close agreement with the quantum annealer. Through ablation studies, we identify poor Markov-chain mixing, high-variance local-energy estimators, and stochastic Runge-Kutta error estimates as the principal numerical failure modes. We address these numerical issues by using parallel tempering, blurred sampling and an importance-weighted differential equation solver, thereby clarifying the numerical requirements for stable, large-scale t-VMC simulations. Our results extend the frontier of classical simulation while providing a realistic assessment of the computational costs of simulating quantum dynamics at this scale.
Recent demonstrations of D-Wave's annealing-based quantum simulators have established new benchmarks for quantum computational advantage [arXiv:2403.00910]. However, the precise location of the classical-quantum computational frontier remains an open question, as classical simulation strategies continue to evolve. Here, we demonstrate that time-dependent variational Monte Carlo (t-VMC) with a physically motivated Jastrow-Feenberg wave function can efficiently simulate the quantum annealing of spin glasses up to system sizes previously thought to be intractable. Our approach achieves accuracy comparable to that of quantum processing units while requiring only polynomially scaling computational resources, in stark contrast to entangled-limited tensor network methods that scale exponentially. For systems up to 128 spins on a three-dimensional diamond lattice, we maintain correlation errors below 7%, which match or exceed the precision of existing quantum hardware. Rigorous assessments of residual energies and time-dependent variational principle errors establish clear performance benchmarks for classical simulations. These findings substantially shift the quantum advantage frontier and underscore that classical variational techniques, which are not fundamentally constrained by entanglement growth, remain competitive at larger system sizes than previously anticipated.
The theoretical analysis of the Adiabatic Quantum Computation protocol presents several challenges resulting from the difficulty of simulating, with classical resources, the unitary dynamics of a large quantum device. We present here a variational approach to substantially alleviate this problem in many situations of interest. Our approach is based on the time-dependent Variational Monte Carlo method, in conjunction with a correlated and time-dependent Jastrow ansatz. We demonstrate that accurate results can be obtained in a variety of problems, ranging from the description of defect generation through a dynamical phase transition in 1D to the complex dynamics of frustrated spin-glass problems both on fully-connected and Chimera graphs.
The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing units. In this work, we employ a comprehensive toolbox of state-of-the-art numerical approaches to classically simulate the dynamics of the two-dimensional transverse field Ising model. Our methods include three different tensor network techniques -- matrix product states, tree-tensor networks, and two-dimensional tensor-networks under the belief propagation approximation -- as well as time-dependent variational Monte Carlo with Neural Quantum States. We focus on two paradigmatic dynamical protocols: (i) quantum annealing through a critical point and (ii) post-quench dynamics. Our extensive results show the quantitative predictions of various state-of-the-art numerical methods providing a benchmark for future numerical investigations and experimental studies with the aim to push the limitations on classical and QPUs. In particular, our work connects classical simulability to different regimes associated with quantum dynamics in Rydberg arrays - namely, quasi-adiabatic dynamics, the Kibble-Zurek mechanism, and quantum quenches.
We introduce a method to simulate open quantum many-body dynamics by combining time-dependent variational Monte Carlo (tVMC) with quantum trajectory techniques. Our approach unravels the Lindblad master equation into an ensemble of stochastic Schrödinger equations for a variational ansatz, avoiding the exponential cost of density matrix evolution. The method is compatible with generic ansatzë, including expressive neural-network wavefunctions. We derive the nonlinear stochastic equations of motion for the variational parameters and employ suitable Stratonovich numerical solvers. To validate our approach, we simulate quenches in the locally dissipative long-range Ising model in a transverse field, accurately capturing non-equilibrium magnetization and spin squeezing dynamics relevant to trapped-ion and Rydberg atom experiments. The framework is computationally efficient, scalable on high-performance computing platforms, and can be readily integrated into existing tVMC implementations. This work enables large-scale simulations of complex, dissipative quantum systems in higher dimensions, with broad implications for quantum technology and fundamental science.
We evaluate using programmable superconducting flux qubit D-Wave quantum annealers to approximate the partition function of Ising models. We propose the use of two distinct quantum annealer sampling methods: chains of Monte Carlo-like reverse quantum anneals, and standard linear-ramp quantum annealing. The control parameters used to attenuate the quality of the simulations are the effective analog energy scale of the J coupling, the total annealing time, and for the case of reverse annealing the anneal-pause. The core estimation technique is to sample across the energy spectrum of the classical Hamiltonian of interest, and therefore obtain a density of states estimate for each energy level, which in turn can be used to compute an estimate of the partition function with some sampling error. This estimation technique is powerful because once the distribution is sampled it allows thermodynamic quantity computation at arbitrary temperatures. On a 252525 spin ±J\pm J±J hardware graph native Ising model we find parameter regimes of the D-Wave processors that provide comparable result quality to two standard classical Monte Carlo methods, Multiple Histogram Reweighting and Wang-Landau. Remarkably, we find that fast quench-like anneals can quickly generate ensemble distributions that are very good estimates of the true partition function of the classical Ising model; on a Pegasus graph-structured QPU we report a logarithmic relative error of 7.6×10−67.6 \times 10^{-6}7.6×10−6, from 171,000171,000171,000 samples generated using 0.20.20.2 seconds of QPU time with an anneal time of 888 nanoseconds per sample which is interestingly within the closed system dynamics timescale of the superconducting qubits.
We investigate the challenge of classical simulation of unitary quantum dynamics with variational Monte Carlo approaches, addressing the instabilities and high computational demands of existing methods. By systematically analyzing the convergence of stochastic infidelity optimizations, examining the variance properties of key stochastic estimators, and evaluating the error scaling of multiple dynamical discretization schemes, we provide a thorough formalization and significant improvements to the projected time-dependent Variational Monte Carlo (p-tVMC) method. We benchmark our approach on a two-dimensional Ising quench, achieving state-of-the-art performance. This work establishes p-tVMC as a powerful framework for simulating the dynamics of large-scale two-dimensional quantum systems, surpassing alternative VMC strategies on the investigated benchmark problems.