Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing

• URL: http://arxiv.org/abs/2510.02141v1
• Date: Thu, 02 Oct 2025 15:49:36 GMT
• Title: Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
• Authors: Kunal Vyas, Fengping Jin, Hans De Raedt, Kristel Michielsen,
• Abstract summary: We show how to perform a gate-based quantum computer simulation of quantum annealing for the Hubbard Hamiltonian.<n>We find that for the half-filled cases considered, there is a substantial quantum speed-up over algorithms based on the Bethe-ansatz equations.
• Score: 0.20999222360659608
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Hubbard model has occupied the minds of condensed matter physicists for most part of the last century. This model provides insight into a range of phenomena in correlated electron systems. We wish to examine the paradigm of quantum algorithms for solving such many-body problems. The focus of our current work is on the one-dimensional model which is integrable, meaning that there exist analytical results for determining its ground state. In particular, we demonstrate how to perform a gate-based quantum computer simulation of quantum annealing for the Hubbard Hamiltonian. We perform simulations for systems with up to 40 qubits to study the scaling of required annealing time for obtaining the ground state. We find that for the half-filled cases considered, there is a substantial quantum speed-up over algorithms based on the Bethe-ansatz equations.

Related papers

• The quantum super-Krylov method [0.6066442015301664]
  We present a novel KQD method that uses only real-time evolutions and recovery probabilities.<n>We present a novel derivative estimation algorithm that is robust to noisy data.<n>Under assumptions on the spectrum of the Hamiltonian, we prove that our algorithm converges exponentially quickly to the ground-state energy.
  arXiv  Detail & Related papers  (2024-12-23T05:21:43Z)
• Shadow Hamiltonian Simulation [1.420194426996621]
  We present a different and novel approach to quantum simulation that uses a compressed quantum state that we call the shadow state''<n>The amplitudes of this shadow state are proportional to the time-dependent expectations of a specific set of operators of interest.<n>This evolution can be simulated on a quantum computer efficiently under broad conditions.
  arXiv  Detail & Related papers  (2024-07-31T17:49:26Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor [0.0]
  We present a quantum algorithm to perform digital quantum simulations of the BCS model on a quantum register with a star shaped connectivity map. We show how to effectively translate the problem onto the quantum hardware and implement the algorithm using only the native interactions between the qubits.
  arXiv  Detail & Related papers  (2022-09-19T17:48:45Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• 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)
• A digital quantum simulation of the Agassi model [0.0]
  A digital quantum simulation of the Agassi model from nuclear physics is proposed and analyzed. The proposed approach is fully scalable to a larger number of sites.
  arXiv  Detail & Related papers  (2021-05-06T17:22:07Z)
• Simulating a ring-like Hubbard system with a quantum computer [0.0]
  We develop a workflow to use current quantum computing hardware for solving quantum many-body problems. We study a four-site Hubbard ring that exhibits a transition from a product state to an intrinsically interacting ground state as hopping amplitudes are changed. We locate this transition and solve for the ground state energy with high quantitative accuracy using a variational quantum algorithm executed on an IBM quantum computer.
  arXiv  Detail & Related papers  (2021-04-13T18:08:09Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Scalable Hamiltonian learning for large-scale out-of-equilibrium quantum dynamics [0.0]
  We present a scalable algorithm based on neural networks for Hamiltonian tomography in out-of-equilibrium quantum systems. Specifically, we show that our algorithm is able to reconstruct the Hamiltonian of an arbitrary size quasi-1D bosonic system.
  arXiv  Detail & Related papers  (2021-03-01T19:00:15Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• 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.