Ground-state energies of Ising models calculated using the samples from a quantum computer that simulates short-time evolution

• URL: http://arxiv.org/abs/2604.25715v1
• Date: Tue, 28 Apr 2026 14:43:15 GMT
• Title: Ground-state energies of Ising models calculated using the samples from a quantum computer that simulates short-time evolution
• Abstract summary: We find the ground-state energy of the Ising model using the Cascaded Variational Quantum Eigensolver (CVQE) algorithm.<n>We study a heavy-hex lattice to match the qubit architecture, allowing us to perform calculations in the quantum utility regime.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We find the ground-state energy of the Ising model using the Cascaded Variational Quantum Eigensolver (CVQE) algorithm with the Guided-Sampling Ansatz (GSA) using up to 63 qubits on a quantum computer. We study a heavy-hex lattice to match the qubit architecture, allowing us to perform calculations in the quantum utility regime. We study both a homogeneous and random-coupling model. We locate the boundary of acceptable quantum errors as a function of the number of qubits and coupling strength. An entropic analysis is performed giving insights into the quantum computing performance. A subspace analysis is performed that suggests that the Ising model is especially suited for near-term quantum computing.

Related papers

• Quantum Mechanical Studies of Photodissociation Dynamics on Quantum Computers [21.171497547707137]
  We present a quantum algorithm to study photodissociation dynamics on quantum computers.<n>The algorithm is robust to noise and statistical sampling errors, indicating the promising application of noisy devices to quantum dynamics studies.
  arXiv  Detail & Related papers  (2026-06-08T02:11:12Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms [0.0]
  The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms.<n> computing the full QFIM incurs a quadratic computational cost of O(d2) with respect to the number of parameters d.<n>We propose an alternative estimation framework based on Stein's identity that also achieves constant computational complexity.
  arXiv  Detail & Related papers  (2025-02-24T15:10:36Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum benefit of the quantum equation of motion for the strongly coupled many-body problem [0.0]
  The quantum equation of motion (qEOM) is a hybrid quantum-classical algorithm for computing excitation properties of a fermionic many-body system. We demonstrate explicitly that the qEOM exhibits a quantum benefit due to the independence of the number of required quantum measurements.
  arXiv  Detail & Related papers  (2023-09-18T22:10:26Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Variational Quantum Policy Gradients with an Application to Quantum Control [0.0]
  Quantum Machine Learning models are composed by Variational Quantum Circuits (VQCs) in a very natural way. In this work, we consider Policy Gradients using a hardware-efficient ansatz. We prove that the complexity of obtaining an epsilon-approximation of the gradient using quantum hardware scales only logarithmically with the number of parameters.
  arXiv  Detail & Related papers  (2022-03-20T16:14:49Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Solving hadron structures using the basis light-front quantization approach on quantum computers [0.8726465590483234]
  We show that quantum computing can be used to solve for the structure of hadrons governed by strongly-interacting quantum field theory. We present the numerical calculations on simulated quantum devices using the basis light-front quantization approach.
  arXiv  Detail & Related papers  (2021-12-03T14:28:18Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.