Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer

Abstract

We derive recursive relations for the Schrieffer--Wolff (SW) transformation applied to the half-filled Hubbard dimer. While the standard SW transformation is set to block-diagonalize the transformed Hamiltonian solely at the first order of perturbation, we infer from recursive relations two types of modifications, variational or iterative, that approach, or even enforce for the homogeneous case, the desired block-diagonalization at infinite order of perturbation. The modified SW unitary transformations are then used to design an test quantum algorithms adapted to the noisy and fault-tolerant era. This work paves the way toward the design of alternative quantum algorithms for the general Hubbard Hamiltonian.

References in corpus (10)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Is the Trotterized UCCSD Ansatz chemically well-defined?
• Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
• Early fault-tolerant simulations of the Hubbard model
• Simulating Many-Body Systems with a Projective Quantum Eigensolver
• Householder transformed density matrix functional embedding theory
• Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer
• Simulating a ring-like Hubbard system with a quantum computer
• Quantum algorithms for Schrieffer-Wolff transformation
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark

Cited by in corpus (3)

• Unitary transformations within density matrix embedding approaches: A novel perspective on the self-consistent scheme for electronic structure calculation
• The toric code under antiferromagnetic isotropic Heisenberg interactions
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions