Infinite Grassmann time-evolving matrix product operator method for zero-temperature equilibrium quantum impurity problems

• URL: http://arxiv.org/abs/2404.04757v2
• Date: Tue, 08 Oct 2024 14:11:13 GMT
• Title: Infinite Grassmann time-evolving matrix product operator method for zero-temperature equilibrium quantum impurity problems
• Authors: Chu Guo, Ruofan Chen,
• Abstract summary: We use the Grassmann time-evolving matrix product operator (GTEMPO) method for zero-temperature imaginary-time calculations. We devise a very efficient infinite GTEMPO algorithm targeted at zero-temperature equilibrium quantum impurity problems.
• Score: 0.0
• License:
• Abstract: 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. Whereas its application for imaginary-time calculations is much less competitive compared to 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 multi-time impurity state is time-translationally invariant with infinite boundary condition, therefore it can be represented as an infinite Grassmann matrix product state (GMPS) with 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.

Related papers

• 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)
• Equilibrium Quantum Impurity Problems via Matrix Product State Encoding of the Retarded Action [0.0]
  In this Article, we explore the computational power of representing the retarded action as matrix product state (RAMPS) We demonstrate that the RAMPS approach reliably reaches the Kondo regime for a range of interaction strengths $U$, with a numerical error scaling as a weak power law with inverse temperature. Our results show that the RAMPS approach offers promise as an alternative tool for studying quantum impurity problems in regimes that challenge established methods.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• 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)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Variationally Scheduled Quantum Simulation [0.0]
  We investigate a variational method for determining the optimal scheduling procedure within the context of adiabatic state preparation. In the absence of quantum error correction, running a quantum device for any meaningful amount of time causes a system to become susceptible to the loss of relevant information. Our variational method is found to exhibit resilience against control errors, which are commonly encountered within the realm of quantum computing.
  arXiv  Detail & Related papers  (2020-03-22T14:47:04Z)

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.