Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer

• URL: http://arxiv.org/abs/2410.07789v1
• Date: Thu, 10 Oct 2024 10:19:02 GMT
• Title: Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Authors: Tatiana A. Bespalova, Karlo Delić, Guido Pupillo, Francesco Tacchino, Ivano Tavernelli,
• Abstract summary: We provide quantum circuits to perform ground and excited states calculations. We benchmark our approach on a chain with L=6 sites and periodic boundary conditions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits to perform ground and excited states calculations, via the Variational Quantum Eigensolver (VQE) and the Quantum Equation of Motion (qEOM) approach respectively, as well as product formulas decompositions for time evolution. We benchmark our approach on a chain with L=6 sites and periodic boundary conditions, computing the charge and spin gaps, the spectral function and spin-spin dynamic correlations. Our results for the ground state phase diagram are in qualitative agreement with known results in the thermodynamic limit. Finally, we provide concrete scalings for the number of gates needed to implement our protocols on a qubit register with all-to-all connectivities and on a heavy hexagonal coupling map.

Related papers

• 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)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers [0.471876092032107]
  Variational quantum eigensolvers (VQE) are among the most promising approaches for solving electronic structure problems on quantum computers. A critical challenge for VQE in practice is that one needs to strike a balance between the expressivity of the VQE ansatz versus the number of quantum gates required to implement the ansatz. We run end-to-end VQE algorithms with up to 12 qubits and 72 variational parameters - the largest full VQE simulation with a correlated wave function on quantum hardware.
  arXiv  Detail & Related papers  (2022-12-05T18:40:54Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• 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)
• Quantum simulation of fermionic systems using hybrid digital-analog quantum computing approach [0.0]
  We show how digital-analog approach can be applied to simulate the dynamics of fermionic systems. We find that an optimal connectivity topology of qubits for the digital-analog simulation of fermionic systems of arbitrary dimensionality is a chain for spinless fermions and a ladder for spin-1/2 particles.
  arXiv  Detail & Related papers  (2021-12-30T18:24:47Z)
• 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)
• Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings [0.0]
  We apply the idea of Floquet engineering in the context of continuous-time quantum walks on graphs. We define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target quantum walks. Our work provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks or investigating quantum dynamics in highly connected structures.
  arXiv  Detail & Related papers  (2020-12-01T12:46:56Z)
• Scattering in the Ising Model Using Quantum Lanczos Algorithm [0.32228025627337864]
  We simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites on a quantum computer. Results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time.
  arXiv  Detail & Related papers  (2020-08-20T04:05:52Z)
• 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)
• Variational Quantum Eigensolver for Frustrated Quantum Systems [0.0]
  A variational quantum eigensolver, or VQE, is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian. Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions. We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits.
  arXiv  Detail & Related papers  (2020-05-01T18:00:01Z)

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.