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

• URL: http://arxiv.org/abs/2212.11089v1
• Date: Wed, 21 Dec 2022 15:36:50 GMT
• Title: Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Authors: Quentin Mar\'ecat, Bruno Senjean, Matthieu Sauban\`ere
• Abstract summary: We derive relations for the Schrieffer--Wolff (SW) transformation applied to the half-filled Hubbard dimer. The modified SW unitary transformations are then used to design a 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Relative Representations: Topological and Geometric Perspectives [53.88896255693922]
  Relative representations are an established approach to zero-shot model stitching. We introduce a normalization procedure in the relative transformation, resulting in invariance to non-isotropic rescalings and permutations. Second, we propose to deploy topological densification when fine-tuning relative representations, a topological regularization loss encouraging clustering within classes.
  arXiv  Detail & Related papers  (2024-09-17T08:09:22Z)
• On reconstruction of states from evolution induced by quantum dynamical semigroups perturbed by covariant measures [50.24983453990065]
  We show the ability to restore states of quantum systems from evolution induced by quantum dynamical semigroups perturbed by covariant measures. Our procedure describes reconstruction of quantum states transmitted via quantum channels and as a particular example can be applied to reconstruction of photonic states transmitted via optical fibers.
  arXiv  Detail & Related papers  (2023-12-02T09:56:00Z)
• All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks [0.0]
  Variational algorithms require architectures that naturally constrain the optimisation space to run efficiently. We propose the use of spin networks, a form of directed tensor network invariant under a group transformation, to devise SU(2) equivariant quantum circuit ans"atze. By changing to the basis that block diagonalises SU(2) group action, these networks provide a natural building block for constructing parameterised equivariant quantum circuits.
  arXiv  Detail & Related papers  (2023-09-13T18:38:41Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)
• An Alternative Formulation of the Quantum Phase Estimation Using Projection-Based Tensor Decompositions [0.0]
  An alternative version of the quantum phase estimation is proposed, in which the Hadamard gates at the beginning are substituted by a quantum Fourier transform. This new circuit coincides with the original one, when the ancilla is with $ket0$. With the help of a projection-based tensor decomposition and closed-form expressions of its exponential, this new method can be interpreted as a multiplier coupled to the Hamiltonian of the corresponding target unitary operator.
  arXiv  Detail & Related papers  (2023-03-10T13:02:29Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Fock-space Schrieffer--Wolff transformation: classically-assisted rank-reduced quantum phase estimation algorithm [0.0]
  In this paper, we focus on the Schrieffer--Wolff (SW) transformation of the electronic Hamiltonians for molecular systems. We demonstrate that by employing Fock-space variants of the SW transformation one can significantly increase the locality of the qubit-mapped similarity transformed Hamiltonians. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.
  arXiv  Detail & Related papers  (2022-11-18T23:06:57Z)
• Double-bracket quantum algorithms for diagonalization [0.0]
  This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally.
  arXiv  Detail & Related papers  (2022-06-23T15:13:46Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.