Papers
Topics
Authors
Recent
Search
2000 character limit reached

Grassmann time-evolving matrix product operators: An efficient numerical approach for fermionic path integral simulations

Published 15 Oct 2024 in cond-mat.str-el, cond-mat.mes-hall, cond-mat.stat-mech, and quant-ph | (2410.11541v1)

Abstract: Developing numerical exact solvers for open quantum systems is a challenging task due to the non-perturbative and non-Markovian nature when coupling to structured environments. The Feynman-Vernon influence functional approach is a powerful analytical tool to study the dynamics of open quantum systems. Numerical treatments of the influence functional including the quasi-adiabatic propagator technique and the tensor-network-based time-evolving matrix product operator method, have proven to be efficient in studying open quantum systems with bosonic environments. However, the numerical implementation of the fermionic path integral suffers from the Grassmann algebra involved. In this work, we present a detailed introduction of the Grassmann time-evolving matrix product operator method for fermionic open quantum systems. In particular, we introduce the concepts of Grassmann tensor, signed matrix product operator, and Grassmann matrix product state to handle the Grassmann path integral. Using the single-orbital Anderson impurity model as an example, we review the numerical benchmarks for structured fermionic environments for real-time nonequilibrium dynamics, real-time and imaginary-time equilibration dynamics, and its application as an impurity solver. These benchmarks show that 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.