Ground state energy estimation for strongly correlated quantum systems remains a central challenge in computational physics and chemistry. While tensor network methods like DMRG provide efficient solutions for one-dimensional systems, higher-dimensional problems remain difficult. Here we present a variational double bracket flow (vDBF) algorithm that leverages Sparse Pauli Dynamics, a technique originally developed for classical simulation of quantum circuits, to efficiently approximate ground state energies. By combining greedy operator selection with coefficient truncation and energy-variance extrapolation, the method achieves less than 1% error relative to DMRG benchmarks for both Heisenberg and Hubbard models in one and two dimensions. For a 10x10 Heisenberg lattice (100 qubits), vDBF obtains accurate results in approximately 10 minutes on a single CPU thread, compared to over 50 hours on 64 threads for DMRG. For an 8x8 Hubbard model (128 qubits), the speedup is even more pronounced. These results demonstrate that classical simulation techniques developed in the context of quantum advantage benchmarking can provide practical tools for many-body physics.
Ground state energy estimation for strongly correlated quantum systems remains a central challenge in computational physics and chemistry. While tensor network methods like DMRG provide efficient solutions for one-dimensional systems, higher-dimensional problems remain difficult. Here we present a variational double bracket flow (vDBF) algorithm that leverages Sparse Pauli Dynamics, a technique originally developed for classical simulation of quantum circuits, to efficiently approximate ground state energies. By combining greedy operator selection with coefficient truncation and energy-variance extrapolation, the method achieves less than 1% error relative to DMRG benchmarks for both Heisenberg and Hubbard models in one and two dimensions. For a 10x10 Heisenberg lattice (100 qubits), vDBF obtains accurate results in approximately 10 minutes on a single CPU thread, compared to over 50 hours on 64 threads for DMRG. For an 8x8 Hubbard model (128 qubits), the speedup is even more pronounced. These results demonstrate that classical simulation techniques developed in the context of quantum advantage benchmarking can provide practical tools for many-body physics.
Quantum algorithms for ground-state energy estimation require initial states with non-negligible fidelity to the ground state. Guided by classical simulations, we design shallow circuits for the two-dimensional half-filled Hubbard model by first preparing an approximate Heisenberg ground state and then applying charge-fluctuation gates derived directly from the Schrieffer-Wolff (SW) generator. For the Heisenberg model, we demonstrate effective parameter transfer from a 4×4 lattice to lattices up to 10×10 without further optimization. We obtain promising lower bounds on the ground-state fidelity using tensor-network simulations, variational Monte Carlo reference states, and estimates of the ground-state energy and singlet gap. Exact 4×4 calculations show that the SW gates substantially improve the Hubbard ground-state fidelity of the embedded Heisenberg state. The successful Heisenberg parameter transfer supports the use of these small-lattice results to design shallow Hubbard circuits on larger lattices beyond the reach of classical simulations. For a 10×10 lattice, the estimated preparation cost is on the order of 105T gates, including Clifford+T synthesis, which is well within the megaquop regime. These results offer a route to low-cost initial-state preparation for ground-starongly correlated systems.
Understanding strongly correlated quantum many-body systems requires dealing with a largeconfiguration space comprised of a set of all possible measurable configurations. The total number of configurations grows exponentially with the size of the system, which makes exact numerical calculations impossible for even moderately sized systems. Since the advent of high-temperature superconductivity and the subsequent interest in strongly correlated phases of matter, progress in the field has been marked by ingenuity of the field to overcome these computational limitations. The first techniques to emerge were inspired by quantum chemistry and based on exact diagonalization[1], which is limited to small clusters, and different variants of quantum Monte Carlo[2], that suffers from the sign problem in fermionic and frustrated systems. Circa 1992, the density matrix renormalization group (DMRG) [3, 4, 5, 6, 7] became one of the major breakthroughs of the past few decades. Despite the success of DMRG for one-dimensional(1D) and quasi-one-dimensional geometries, extensions to actual two-dimensional systems remain challenging and applications are constrained to long cylinders and strips. One promising alternative is to combine one the oldest methods, variational wave functions (VWFs), with neural networks, which have been used to recently with great success in machine learning. The focus of this dissertation is on developing novel variational Monte Carlo algorithms to make neural network variational wave functions applicable to many problems in quantum many-body physics. These algorithms draw from existing variational wave-function, tensor network, and machine learning methods. We calculate dynamical spectral functions using the vector correction and Chebyshev expansion method. We do finite temperature calculations with minimally entangled thermal states. Finally, we do ground state calculations for the frustrated J1−J2 Heisenberg model. We benchmark these results using restricted Boltzmann machines as the neural network for the the variational wave-functions.--Author's abstract
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.
Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware, for systems with up to 32 qubits. We find that even when using the most accurate wavefunction ansätze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.
The variational quantum eigensolver (VQE) is a promising algorithm for demonstrating quantum advantage in the noisy intermediate-scale quantum (NISQ) era. However, optimizing VQE from random initial starting parameters is challenging due to a variety of issues including barren plateaus, optimization in the presence of noise, and slow convergence. While simulating quantum circuits classically is generically difficult, classical computing methods have been developed extensively, and powerful tools now exist to approximately simulate quantum circuits. This opens up various strategies that limit the amount of optimization that needs to be performed on quantum hardware. Here we present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by classically simulating VQE by approximating the parameterized quantum circuit (PQC) as a matrix product state (MPS) with a limited bond dimension. Calling this approach the variational tensor network eigensolver (VTNE), we apply it to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. We find that in 1D, VTNE can find parameters for PQC whose energy error is within 0.5% relative to the ground state. In 2D, the parameters that VTNE finds have significantly lower energy than their starting configurations, and we show that starting VQE from these parameters requires non-trivially fewer operations to come down to a given energy. The higher the bond dimension we use in VTNE, the less work needs to be done in VQE. By generating classically optimized parameters as the initialization for the quantum circuit one can alleviate many of the challenges that plague VQE on quantum computers.
Solving the ground state of quantum many-body systems remains a fundamental challenge in physics and chemistry. Recent advancements in quantum hardware have opened new avenues for addressing this challenge. Inspired by the quantum-enhanced Markov chain Monte Carlo (QeMCMC) algorithm, which was originally designed for sampling the Boltzmann distribution of classical spin models using quantum computers, we introduce a quantum-assisted variational Monte Carlo (QA-VMC) algorithm for solving the ground state of quantum many-body systems by adapting QeMCMC to sample the distribution of a (neural-network) wave function in VMC. The central question is whether such a quantum-assisted proposal can potentially offer a computational advantage over classical methods. Through numerical investigations for the Fermi-Hubbard model and molecular systems, we demonstrate that the quantum-assisted proposal exhibits larger absolute spectral gaps and reduced autocorrelation times compared to conventional classical proposals, leading to more efficient sampling and faster convergence to the ground state in VMC as well as a more accurate and precise estimation of physical observables. This advantage is especially pronounced for specific parameter ranges, where the ground-state configurations are more concentrated in some configurations separated by large Hamming distances. Our results underscore the potential of quantum-assisted algorithms to enhance classical variational methods for solving the ground state of quantum many-body systems.