Benchmarking Quantum Simulations of the Lipkin-Meshkov-Glick Model Using Large Tensor Networks

• URL: http://arxiv.org/abs/2607.28570v1
• Date: Thu, 30 Jul 2026 17:34:48 GMT
• Title: Benchmarking Quantum Simulations of the Lipkin-Meshkov-Glick Model Using Large Tensor Networks
• Abstract summary: 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)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As quantum computing matures, it is critical to benchmark its real-world problem solving performance against competitive classical methods, such as tensor networks. In this work, we leverage the Density Matrix Renormalization Group (DMRG) algorithm to compute ground state energies of the Lipkin Meshkov Glick (LMG) model as a comparative benchmark against popular noisy intermediate-scale (NISQ) algorithms like the Variational Quantum Eigensolver (VQE) and Sample-Based Quantum Diagonalization (SQD) method. By running DMRG on the NERSC Perlmutter supercomputer, we provide one of the largest LMG ground state energy datasets in literature, containing accurate ground state energies for systems up to 1400 particles. We compare these results with VQE and SQD implementations on an IBM Eagle quantum computer for comparison. VQE achieved results within 1 percent error for 6 particles, while exceeding that threshold for all other values while SQD extended that range to 17 particles, suggesting that in a noisy intermediate scale quantum era, subspace-based approaches may strike the best balance between accuracy, circuit depth, and noise resilience.

Related papers

• Scalable nuclear shell model calculations on noisy quantum computers [0.0]
  Hybrid quantum algorithms like the Variational Quantum Eigensolver (VQE) aim to overcome limits in quantum computing.<n>The noise inherent in the current Noisy Intermediate-Scale Quantum (NISQ) hardware renders several algorithms, such as the VQE, impractical for large-scale calculations.<n>We apply the Sample-based Quantum Diagonalization (SQD) framework to nuclear shell models for the first time.
  arXiv  Detail & Related papers  (2026-08-17T10:23:18Z)
• Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning [38.502127166117674]
  We propose gated QKAN-FWP, a fast-weight framework that integrates FWP with Quantum-inspired Kolmogorov-Arnold Network (QKAN)<n>We use single-qubit data re-uploading circuits as learnable nonlinear activation, known as DatA Re-Uploading ActivatioN (DARUAN)<n>We evaluate the framework across time-series benchmarks, MiniGrid reinforcement learning, and highlight real-world solar cycle forecasting as our main practical result.
  arXiv  Detail & Related papers  (2026-05-07T13:04:09Z)
• TensorCircuit-NG: A Universal, Composable, and Scalable Platform for Quantum Computing and Quantum Simulation [33.05172028111655]
  We presentCircuit-NG, a next-generation quantum software platform designed to bridge the gap between quantum physics, artificial intelligence, and high-performance computing.<n>Circuit-NG establishes a unified, tensor-native programming paradigm where quantum circuits, tensor networks, and neural networks fuse into a single, end-to-end differentiable computational graph.
  arXiv  Detail & Related papers  (2026-02-15T14:37:37Z)
• Hybrid Sequential Quantum Computing [33.72751145910978]
  We introduce hybrid sequential quantum computing (HSQC)<n>HSQC systematically integrates classical and quantum methods within a structured, stage-wise workflow.<n>Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over runtime.
  arXiv  Detail & Related papers  (2025-10-07T12:15:43Z)
• QB Ground State Energy Estimation Benchmark [30.045562070102537]
  Ground State Energy Estimation is a central problem in quantum chemistry and condensed matter physics.<n>This work introduces a structured benchmarking framework for evaluating the performance of both classical and quantum solvers.
  arXiv  Detail & Related papers  (2025-08-14T17:45:28Z)
• Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
  We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework. Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-10-18T10:30:14Z)
• Tensor-based quantum phase difference estimation for large-scale demonstration [1.46955585643264]
  We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme.<n>Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially.<n>We demonstrate energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices.
  arXiv  Detail & Related papers  (2024-08-09T09:01:37Z)
• Quantum subspace expansion in the presence of hardware noise [0.0]
  Finding ground state energies on current quantum processing units (QPUs) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parametrized quantum circuits. We show how to integrate VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs.
  arXiv  Detail & Related papers  (2024-04-14T02:48:42Z)
• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster [0.0]
  This study aims to accelerate quantum simulation using two newly proposed methods. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time.
  arXiv  Detail & Related papers  (2024-02-19T06:34:01Z)
• Matrix product state ansatz for the variational quantum solution of the Heisenberg model on Kagome geometries [0.0]
  We develop a quantum circuit ansatz inspired by the Density Matrix Renormalization Group (DMRG) algorithm. We find that, with realistic error rates, our DMRG-VQE hybrid algorithm delivers good results for strongly correlated systems.
  arXiv  Detail & Related papers  (2024-01-04T16:53:47Z)
• Pre-optimizing variational quantum eigensolvers with tensor networks [1.4512477254432858]
  We present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by simulating VQE. We apply this approach to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. 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.
  arXiv  Detail & Related papers  (2023-10-19T17:57:58Z)
• 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)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Simulation of Quantum Computing on Classical Supercomputers [23.350853237013578]
  We propose a scheme based on cutting edges of undirected graphs. This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs. It can simulate 120-qubit 3-regular QAOA algorithm on 4096-core supercomputer.
  arXiv  Detail & Related papers  (2020-10-28T13:26:41Z)

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.