Abstract Tensor-network-based methods are promising candidates to solve quantum impurity problems (QIP). They are free of sampling noises and the sign problem compared to state-of-the-art continuous-time quantum Monte Carlo methods. Recent progress made in tensor-network-based impurity solvers is to use the Feynman–Vernon influence functional to integrate out the bath analytically, retaining only the impurity dynamics and representing it compactly as a matrix product state. The recently proposed Grassmann time-evolving matrix product operator (GTEMPO) method is one of the representative methods in this direction. In this work, we systematically study the performance of GTEMPO in solving equilibrium QIPs at a finite temperature with a semicircular spectrum density of the bath. Our results show that its computational cost would generally increase as the temperature goes down and scale exponentially with the number of orbitals. In particular, the single-orbital Anderson impurity model can be efficiently solved with this method, for two orbitals we estimate that one could possibly reach inverse temperature β ≈ 20 if high-performance computing techniques are utilized, while beyond that only very high-temperature regimes can be reached in the current formalism. Our work paves the way to apply GTEMPO as an imaginary-time impurity solver.
Abstract Tensor-network-based methods are promising candidates to solve quantum impurity problems (QIP). They are free of sampling noises and the sign problem compared to state-of-the-art continuous-time quantum Monte Carlo methods. Recent progress made in tensor-network-based impurity solvers is to use the Feynman–Vernon influence functional to integrate out the bath analytically, retaining only the impurity dynamics and representing it compactly as a matrix product state. The recently proposed Grassmann time-evolving matrix product operator (GTEMPO) method is one of the representative methods in this direction. In this work, we systematically study the performance of GTEMPO in solving equilibrium QIPs at a finite temperature with a semicircular spectrum density of the bath. Our results show that its computational cost would generally increase as the temperature goes down and scale exponentially with the number of orbitals. In particular, the single-orbital Anderson impurity model can be efficiently solved with this method, for two orbitals we estimate that one could possibly reach inverse temperature β ≈ 20 if high-performance computing techniques are utilized, while beyond that only very high-temperature regimes can be reached in the current formalism. Our work paves the way to apply GTEMPO as an imaginary-time impurity solver.
An emergent and promising tensor-network-based impurity solver is to represent the Feynman-Vernon influence functional as a matrix product state, where the bath is integrated out analytically. Here we present an approach to calculate the equilibrium impurity spectral function based on the recently proposed Grassmann time-evolving matrix product operators method. The central idea is to perform a quench from a separable impurity-bath initial state as in the nonequilibrium scenario. The retarded Green's function $G(t+{t}_{0},{t}^{\ensuremath{'}}+{t}_{0})$ is then calculated after an equilibration time t0 such that the impurity and bath are approximately in thermal equilibrium. There are two major advantages of this method. First, since we focus on real-time dynamics, we do not need to perform the numerically ill-posed analytic continuation as in imaginary- time evolution-based methods. Second, the required bond dimension of the matrix product state in real-time calculations is observed to be much smaller than that in imaginary-time calculations, leading to a significant improvement in numerical efficiency. The accuracy of this method is demonstrated using the single-orbital Anderson impurity model and benchmarked against the continuous-time quantum Monte Carlo method.
The Grassmann time-evolving matrix product operator (GTEMPO) method has proven to be an accurate and efficient numerical method for the real-time dynamics of quantum impurity problems. However, its application for imaginary-time calculations is much less competitive than well-established methods such as the continuous-time quantum Monte Carlo (CTQMC). In this work, we unleash the full power of GTEMPO for zero-temperature imaginary-time calculations: The multitime impurity state is time-translationally invariant with infinite boundary conditions; therefore, it can be represented as an infinite Grassmann matrix product state (GMPS) with a nontrivial unit cell in a single time step, instead of an open boundary GMPS spanning the whole imaginary-time axis. We devise a very efficient infinite GTEMPO algorithm targeted at zero-temperature equilibrium quantum impurity problems, which is known to be a hard regime for quantum Monte Carlo methods. To demonstrate the performance of our method, we benchmark it against exact solutions in the noninteracting limit and against CTQMC calculations in the Anderson impurity models with up to two orbitals, where we show that the required bond dimension of the infinite GMPS is much smaller than its finite-temperature counterpart.
The Grassmann time-evolving matrix product operator (GTEMPO) method, which represents the Feynman-Vernon influence functional as a temporal matrix product state, has been shown to be a flexible and potentially scalable solution for fermionic quantum impurity problems. In this work, we extend GTEMPO to solve fermionic impurity problems in the Nambu formalism, in which the impurity is coupled to a superconducting bath. A key insight is that by employing the Bogoliubov transformation for the superconducting bath, one could obtain the analytic expression of the Feynman-Vernon influence functional in a similar form to the case of a normal bath, after which the core algorithms of GTEMPO can be straightforwardly adapted. We demonstrate the accuracy of our method by benchmarking it against exact diagonalization in several exactly solvable cases, and against the continuous-time quantum Monte Carlo method using converged dynamical mean field theory (DMFT) iterations on the imaginary contour in the non-integrable case. In all cases, we perform both imaginary- and real-time calculations to illustrate the flexibility of our method. These results illustrate that our method could be potentially useful as an impurity solver in DMFT as well as its non-equilibrium extension for fermionic impurity problems in the Nambu formalism.
We present an infinite Grassmann time-evolving matrix product operator method for quantum impurity problems, which directly works in the steady state. The method embraces the well-established infinite matrix product state algorithms with the recently developed GTEMPO method, and benefits from both sides: it obtains real-time Green's functions without sampling noises and bath discretization error, it is applicable for any temperature without the sign problem, and its computational cost is independent of the transient dynamics and does not scale with the number of baths. We benchmark the method on the finite-temperature equilibrium Green's function in the noninteracting limit against exact solutions and in the single-orbital Anderson impurity model against GTEMPO calculations. We also study the zero-temperature nonequilibrium steady state of an impurity coupled to two baths with a voltage bias, obtaining consistent particle currents with existing calculations. The method is ideal for studying steady-state quantum transport, and can be readily used as an efficient real-time impurity solver in the dynamical mean-field theory and its nonequilibrium extension.
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 nonequilibrium 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.
The Grassmann time-evolving matrix product operator method has shown great potential as a general-purpose quantum impurity solver, as its numerical errors can be well controlled and it is flexible to be applied on both the imaginary- and real-time axes. However, a major limitation of it is that its computational cost grows exponentially with the number of impurity flavors. In this work, we propose a multiflavor extension of it to overcome this limitation. The key insight is that to calculate multitime correlation functions on one or a few impurity flavors, one could integrate out the degrees of freedom of the rest flavors beforehand, which could greatly simplify the calculation. The idea is particularly effective for quantum impurity problems with diagonal hybridization function, i.e., each impurity flavor is coupled to an independent bath, a setting which is commonly used in the field. We demonstrate the accuracy and scalability of our method for the imaginary-time evolution of impurity problems with up to three impurity orbitals, i.e., six flavors, and benchmark our results against continuous-time quantum Monte Carlo calculations. Our method paves the way of scaling up tensor network algorithms to solve large-scale quantum impurity problems.