Rapid ground state energy estimation with a Sparse Pauli Dynamics-enabled Variational Double Bracket Flow

• URL: http://arxiv.org/abs/2511.21651v1
• Date: Wed, 26 Nov 2025 18:22:13 GMT
• Title: Rapid ground state energy estimation with a Sparse Pauli Dynamics-enabled Variational Double Bracket Flow
• Abstract summary: Ground state energy estimation for strongly correlated quantum systems remains a central challenge in computational physics.<n>We present a variational double bracket flow algorithm that leverages Sparse Pauli Dynamics to efficiently approximate ground state energies.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Logarithmic-scale variational quantum eigensolver for off-lattice protein structure prediction in continuous torsional angle space [0.0]
  We propose a logarithmic-scale variational quantum eigensolver (VQE) that reduces qubit requirements for N torsional degrees of freedom to O(log2N)<n>This introduces the first all-atom, continuous-space quantum algorithm for protein structure prediction (QPSP)<n>It proves high-resolution prediction is feasible with exponentially fewer qubits.
  arXiv  Detail & Related papers  (2026-09-02T05:05:46Z)
• Inverse Design of Quantum Control Sequences with Fourier Neural Operators [57.63590760083204]
  We introduce a Fourier Neural Operator (FNO)-based framework for learning high dimensional molecular quantum dynamics.<n>We develop the FNO pulse-measurement planner (FNO-SPMP), which constructs pulse sequences to purify an initially mixed Boltzmann distribution.<n>In a shared discrete control space, FNO-SPMP achieves nearly twice the success rate of a reinforcement-learning baseline.
  arXiv  Detail & Related papers  (2026-08-04T14:06:59Z)
• Benchmarking Quantum Simulations of the Lipkin-Meshkov-Glick Model Using Large Tensor Networks [0.0]
  We leverage the Density Matrix Renormalization Group (DMRG) algorithm to compute ground state energies of the Lipkin Meshkov Glick (LMG) model.<n>We compare these results with noisy intermediate-scale (NISQ) algorithms like the Variational Quantum Eigensolver (VQE) and Sample-Based Quantum Diagonalization (SQD)
  arXiv  Detail & Related papers  (2026-07-30T17:34:48Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Efficient time-evolution of matrix product states using average Hamiltonians [0.0]
  We propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians.<n>Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
  arXiv  Detail & Related papers  (2026-02-04T19:00:01Z)
• Probabilistic Computers for Neural Quantum States [0.0]
  We implement a probabilistic computer on field programmable gate arrays (FPGAs) and use it as a fast sampler for energy-based neural quantum states.<n>We introduce a dual-sampling algorithm to train deep Boltzmann machines, replacing intractable marginalization with conditional sampling over auxiliary layers.
  arXiv  Detail & Related papers  (2025-12-31T01:42:04Z)
• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture [0.6449786007855248]
  We present an efficient method for simulating the time evolution of the 2D Hubbard model Hamiltonian. Our analysis reveals an acceleration of over 10 times compared to naive serial compilation. For devices with a physical error rate of $p_rm phys = 10-4$, we estimate that approximately $6.5 times 104$ physical qubits are required to achieve faster ground state energy estimation.
  arXiv  Detail & Related papers  (2024-08-27T10:07:34Z)
• Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs [11.87665112550076]
  In quantum hardware, primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows larger, traditional state-vector based quantum circuit simulation methods prove inadequate due to the overwhelming size of the Hilbert space and extensive entanglement. In this study, we propose general optimization strategies from two aspects: computational efficiency and accuracy.
  arXiv  Detail & Related papers  (2023-10-06T02:24:05Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• The Boundary for Quantum Advantage in Gaussian Boson Sampling [44.62475518267084]
  State-of-the-art quantum photonics experiments would require 600 million years to simulate using the best pre-existing classical algorithms. We present substantially faster classical GBS simulation methods, including speed and accuracy improvements. This reduces the run-time of simulating state-of-the-art GBS experiments to several months -- a nine orders of magnitude improvement over previous estimates.
  arXiv  Detail & Related papers  (2021-08-03T16:49:40Z)
• Benchmarking a novel efficient numerical method for localized 1D Fermi-Hubbard systems on a quantum simulator [0.0]
  We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system. We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance. We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
  arXiv  Detail & Related papers  (2021-05-13T16:03:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.