Scaling of Quantum Resources for Simulating a Long-Range System

• URL: http://arxiv.org/abs/2604.18495v1
• Date: Mon, 20 Apr 2026 16:44:52 GMT
• Title: Scaling of Quantum Resources for Simulating a Long-Range System
• Abstract summary: We simulate a long-range extended Ising model in one dimension using a hybrid quantum algorithm, namely Variational Quantum Eigensolver (VQE)<n>In this quantum simulation, we investigate how quantum resources scale with system size and interaction strength.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We simulate a long-range extended Ising model in one dimension using a hybrid quantum algorithm, namely Variational Quantum Eigensolver (VQE). In this quantum simulation, we investigate how quantum resources scale with system size and interaction strength. Three structure-aware ansatze incorporating nearest-neighbor (NN), next-nearest-neighbor (NNN), and next-next-nearest-neighbor (NNNN) entangling blocks are constructed by mimicking the string operators in the Hamiltonian. We show that energy fidelity alone is not a good indicator for finding the ground state of our model. To overcome this problem, we introduce an additional criterion based on pairwise logarithmic negativity as a more reliable way to find the actual ground state by the VQE. We find that the interaction range parameter alpha primarily governs the minimum number of ansatz layers required, rather than proximity to the quantum critical point. In particular, we show that in the non-local regime (alpha <= 1), the NNN and NNNN ansatze reduce the layer scaling rate by factors of 2.5x and 3.8x relative to NN in all phases, including the critical point. The total number of two-qubit gates required for reliable simulation grows quadratically with system size for all three ansatze. This is consistent with the theoretical prediction, as the number of non-local terms in the Hamiltonian also grows quadratically with the system size. In the local regime, however, the number of required two-qubit gates grows linearly with system size. In contrast, in the quasi-local regime, the required number of two-qubit gates for the quantum simulation is more subtle and depends on the phase of the Hamiltonian.

Related papers

• Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers [0.005390659954881999]
  We introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians.<n>We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions.<n>The framework introduced here enables novel and more efficient quantum-classical application towards utility-scale quantum computing.
  arXiv  Detail & Related papers  (2026-06-18T18:00:16Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Simulating Fully Gauge-Fixed SU(2) Hamiltonian Dynamics on Digital Quantum Computers [1.0716269823733435]
  This work focuses on the quantum simulation of the smallest non-trivial system: two plaquettes with open boundary conditions.<n>It is found that as few as three qubits per plaquette is sufficient to reach per-mille level precision on predictions for observables.
  arXiv  Detail & Related papers  (2025-12-28T04:56:25Z)
• Optimizing digital quantum simulation of open quantum lattice models [3.761360709981958]
  We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment.<n>We develop near-optimal algorithms that attain a simulation error $delta$ in the system-state with $mathcalO(Nt(Nt/delta)o(1))$ gates, $mathcalO(t(Nt/delta)o(1))$ ancillas.
  arXiv  Detail & Related papers  (2025-09-02T12:44:57Z)
• Entanglement-informed Construction of Variational Quantum Circuits [0.0]
  Variational Quantum Eigensolver (VQE) is a promising tool for simulating ground states of quantum many-body systems on noisy quantum computers.<n>In this article, we explore entanglement-informed ansatz schemes that naturally emerge from specific models.
  arXiv  Detail & Related papers  (2025-01-29T10:04:43Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Generating Entanglement by Quantum Resetting [0.0]
  We consider a closed quantum system subjected to Poissonian resetting with rate $r$ to its initial state. We show that quantum resetting provides a simple and effective mechanism to enhance entanglement between two parts of an interacting quantum system.
  arXiv  Detail & Related papers  (2023-07-14T17:12:08Z)
• Message-Passing Neural Quantum States for the Homogeneous Electron Gas [41.94295877935867]
  We introduce a message-passing-neural-network-based wave function Ansatz to simulate extended, strongly interacting fermions in continuous space. We demonstrate its accuracy by simulating the ground state of the homogeneous electron gas in three spatial dimensions.
  arXiv  Detail & Related papers  (2023-05-12T04:12:04Z)
• 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)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.