Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
- URL: http://arxiv.org/abs/2408.00836v1
- Date: Thu, 1 Aug 2024 18:00:04 GMT
- Title: Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model
- Authors: Antonios M. Alvertis, Abid Khan, Thomas Iadecola, Peter P. Orth, Norm Tubman,
- Abstract summary: We show that the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue.
Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware.
- Score: 1.1017516493649393
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy in terms of producing true ground state energies and other properties, and the dependence of this accuracy on the system size and interaction strength, the choice of variational ansatz, and the degree of spatial inhomogeneity in the model, remains unknown. Here we present a rigorous classical benchmarking study, demonstrating the potential impact of these factors on the accuracy of the variational solution of the Hubbard model on quantum hardware. We find that even when using the most accurate wavefunction ans\"{a}tze for the Hubbard model, the error in its ground state energy and wavefunction plateaus for larger lattices, while stronger electronic correlations magnify this issue. Concurrently, spatially inhomogeneous parameters and the presence of off-site Coulomb interactions only have a small effect on the accuracy of the computed ground state energies. Our study highlights the capabilities and limitations of current approaches for solving the Hubbard model on quantum hardware, and we discuss potential future avenues of research.
Related papers
- Demonstration of a variational quantum eigensolver with a solid-state spin system under ambient conditions [15.044543674753308]
Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system.
The variational-quantum-eigensolver algorithm is a particularly promising application for investigating molecular electronic structures.
Spin-based solid-state qubits have the advantage of long decoherence time and high-fidelity quantum gates.
arXiv Detail & Related papers (2024-07-23T09:17:06Z) - Hamiltonian truncation tensor networks for quantum field theories [42.2225785045544]
We introduce a tensor network method for the classical simulation of continuous quantum field theories.
The method is built on Hamiltonian truncation and tensor network techniques.
One of the key developments is the exact construction of matrix product state representations of global projectors.
arXiv Detail & Related papers (2023-12-19T19:00:02Z) - Comparative study on compact quantum circuits of hybrid
quantum-classical algorithms for quantum impurity models [0.0]
Hybrid quantum--classical algorithms such as variational quantum eigensolver emerge as a potential solution for quantum impurity models.
A common challenge in these algorithms is the rapid growth of the number of variational parameters with the number of spin-orbitals in the impurity.
This study demonstrates the potential for addressing complex impurity models in large-scale quantum simulations with fewer variational parameters without sacrificing accuracy.
arXiv Detail & Related papers (2023-12-07T07:39:01Z) - Quantum Simulations in Effective Model Spaces (I): Hamiltonian
Learning-VQE using Digital Quantum Computers and Application to the
Lipkin-Meshkov-Glick Model [0.0]
We introduce an iterative hybrid-classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE)
HL-VQE is found to provide an exponential improvement in Lipkin-Meshkov-Glick model calculations.
This work constitutes a step in the development of entanglement-driven quantum algorithms for the description of nuclear systems.
arXiv Detail & Related papers (2023-01-14T21:10:02Z) - Dynamical mean-field theory for the Hubbard-Holstein model on a quantum
device [0.0]
We report a demonstration of solving the dynamical mean-field theory (DMFT) impurity problem for the Hubbard-Holstein model on the IBM 27-qubit Quantum Falcon Processor Kawasaki.
This opens up the possibility to investigate strongly correlated electron systems coupled to bosonic degrees of freedom and impurity problems with frequency-dependent interactions.
arXiv Detail & Related papers (2023-01-05T00:36:21Z) - Fermionic approach to variational quantum simulation of Kitaev spin
models [50.92854230325576]
Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions.
We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation.
We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
arXiv Detail & Related papers (2022-04-11T18:00:01Z) - 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) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Improved accuracy on noisy devices by non-unitary Variational Quantum
Eigensolver for chemistry applications [0.0]
We propose a modification of the Variational Quantum Eigensolver algorithm for electronic structure optimization using quantum computers.
A non-unitary operator is combined with the original system Hamiltonian leading to a new variational problem with a simplified wavefunction Ansatz.
arXiv Detail & Related papers (2021-01-22T20:17:37Z) - Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves.
We find both methods provide good estimates of the energy and ground state.
gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
arXiv Detail & Related papers (2020-11-02T19:52:04Z)
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.