Grassmann Time-Evolving Matrix Product Operators for Quantum Impurity Models

• URL: http://arxiv.org/abs/2308.05279v3
• Date: Fri, 12 Jan 2024 02:23:10 GMT
• Title: Grassmann Time-Evolving Matrix Product Operators for Quantum Impurity Models
• Authors: Ruofan Chen, Xiansong Xu, Chu Guo
• Abstract summary: We develop Grassmann time-evolving matrix product operators, a full fermionic analog of TEMPO, that can directly manipulate Grassmann path integrals. We also propose a zipup algorithm to compute expectation values on the fly without explicitly building a single large augmented density tensor.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The time-evolving matrix product operators (TEMPO) method, which makes full use of the Feynman-Vernon influence functional, is the state-of-the-art tensor network method for bosonic impurity problems. However, for fermionic impurity problems the Grassmann path integral prohibits application of this method. We develop Grassmann time-evolving matrix product operators, a full fermionic analog of TEMPO, that can directly manipulates Grassmann path integrals with similar numerical cost as the bosonic counterpart. We further propose a zipup algorithm to compute expectation values on the fly without explicitly building a single large augmented density tensor, which boosts our efficiency on top of the vanilla TEMPO. Our method has a favorable complexity scaling over existing tensor network methods, and we demonstrate its performance on the non-equilibrium dynamics of the single impurity Anderson models. Our method solves the long standing problem of turning Grassmann path integrals into efficient numerical algorithms, which could significantly change the application landscape of tensor network based impurity solvers, and could also be applied for broader problems in open quantum physics and condensed matter physics.

Related papers

• Grassmann time-evolving matrix product operators: An efficient numerical approach for fermionic path integral simulations [0.0]
  We introduce the concepts of Grassmann tensor, signed matrix product operator, and Grassmann matrix product state to handle the Grassmann path integral. Our method is a robust and promising numerical approach to study strong coupling physics and non-Markovian dynamics. It can also serve as an alternative impurity solver to study strongly-correlated quantum matter with dynamical mean-field theory.
  arXiv  Detail & Related papers  (2024-10-15T12:17:29Z)
• PINNIES: An Efficient Physics-Informed Neural Network Framework to Integral Operator Problems [0.0]
  This paper introduces an efficient tensor-vector product technique for the approximation of integral operators within physics-informed deep learning frameworks. We demonstrate the applicability of this method to both Fredholm and Volterra integral operators. We also propose a fast matrix-vector product algorithm for efficiently computing the fractional Caputo derivative.
  arXiv  Detail & Related papers  (2024-09-03T13:43:58Z)
• Solving quantum impurity problems on the L-shaped Kadanoff-Baym contour [0.0]
  We extend the recently developed Grassmann time-evolving matrix product operator (GTEMPO) method to solve quantum impurity problems directly on the Kadanoff-Baym contour. The accuracy of this method is numerically demonstrated against exact solutions in the noninteracting case, and against existing calculations on the real- and imaginary-time axes.
  arXiv  Detail & Related papers  (2024-04-08T11:21:06Z)
• Infinite Grassmann Time-Evolving Matrix Product Operator Method in the Steady State [0.0]
  We present an infinite Grassmann time-evolving matrix product operator method for quantum impurity problems, which directly works in the steady state. We benchmark the method on the finite-temperature equilibrium Green's function in the noninteracting limit against exact solutions. We also study the zero-temperature non-equilibrium steady state of an impurity coupled to two baths with a voltage bias, obtaining consistent particle currents with existing calculations.
  arXiv  Detail & Related papers  (2024-03-25T12:33:32Z)
• Real-time Impurity Solver Using Grassmann Time-Evolving Matrix Product Operators [0.0]
  We present an approach to calculate the equilibrium impurity spectral function based on the recently proposed Grassmann time-evolving matrix product operators method. The accuracy of this method is demonstrated in the single-orbital Anderson impurity model and benchmarked against the continuous-time quantum Monte Carlo method.
  arXiv  Detail & Related papers  (2024-01-10T02:20:29Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Sampling with Mollified Interaction Energy Descent [57.00583139477843]
  We present a new optimization-based method for sampling called mollified interaction energy descent (MIED) MIED minimizes a new class of energies on probability measures called mollified interaction energies (MIEs) We show experimentally that for unconstrained sampling problems our algorithm performs on par with existing particle-based algorithms like SVGD.
  arXiv  Detail & Related papers  (2022-10-24T16:54:18Z)
• 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)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)

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.