Convergence guarantees for discrete mode approximations to non-Markovian quantum baths

arXiv:2107.07196 · quant-ph · Submitted 2021-07-15 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: I'm Kai, and with me are Mira and Lev, guest researcher.

Mira: Today's paper: "Convergence guarantees for discrete mode approximations to non-Markovian quantum baths".

Kai: The gist: This letter shows that under some physically motivated assumptions on the system-environment interaction,

Mira: First, who's behind it and why it matters.

Paper summary: Kai: We’ve talked about the high-level idea of this paper, which is establishing convergence guarantees for discrete mode approximations to non-Markovian quantum baths. To recap, the main thesis is that under specific physically motivated assumptions on the system-environment interaction, simulating these open quantum systems using a large number of discrete modes will eventually yield the true result in finite time >

Mira: That's right. The paper addresses a problem where modeling non-Markovian dynamics is hard because you can't always write down a dynamical equation directly from the physical model of the system and environment interaction >

Lev: They tackle this by using two methods to approximate the environment: the Lorentzian pseudomode approximation and the star-to-chain transformation, both within a truncated environment energy window >

Kai: And what they provide is rigorous convergence guarantees for both of those approaches when those specific assumptions hold true, which adds much needed mathematical rigor to how we simulate these complex systems >

Mira: They show that for a wide class of non-Markovian models, both approximations are guaranteed to converge and the approximation error decreases polynomially with the number of pseudomodes used >

Lev: The convergence rates they provide are interesting because they give us an estimate on how fast we can expect that error to go down, which is what you need for practical implementation on real quantum hardware >

Conclusion: Kai: So, looking at the full picture of this paper, the authors have laid out some very specific mathematical conditions—Assumption one and Assumption two—that allow them to make these convergence guarantees work for both their approximation methods > <ref:2107.07196#pg1>

Mira: Those assumptions are what ground the whole argument; they essentially define the physical space where these approximations become trustworthy, ensuring that we don't run into problems like ultraviolet divergences when considering high frequencies in the environment >

Lev: For someone thinking about implementing this on a quantum computer, it means you need to carefully engineer your system-environment coupling function v so it respects Assumption one and that your evolution map stays well-behaved enough for Assumption two to hold > <ref:2107.07196#pg1>

Kai: The title of the paper, "Convergence guarantees for discrete mode approximations to non-Markovian quantum baths," really reflects what they did—they took these difficult approximations and proved exactly when they become reliable tools for understanding dynamics >

Mira: It means that even if you can't solve the full, infinite-mode problem directly, this work tells us precisely how many modes you need to use to get a result close enough for your application >

Lev: In simpler terms, it tells us that if you have the right kind of physical interaction, using a sufficiently large number of discrete modes is a reliable path to getting the true dynamics for finite time >

Max-Planck-Institut f¨ur Quantenoptik · Munich Center for Quantum Science and Technology

quant-ph

Submitted: 2021-07-15

Updated: 2021-11-12

Journal ref: Phys. Rev. Lett. 127, 250404 (2021)

DOI: 10.1103/PhysRevLett.127.250404

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 92/100

The gist: The gist: This letter shows that under some physically motivated assumptions on the system-environment interaction, the finite-time dynamics of the nonMarkovian open quantum system computed with a

Key concepts

Non-Markovian Dynamics
This describes how an open quantum system interacts with its environment in a way that retains memory of past interactions. Unlike simple models where the environment instantly forgets past events, non-Markovian dynamics require tracking the system's history to accurately model its evolution.
Lorentzian Pseudomode Theory
This is one method used to approximate a continuous bosonic environment by replacing its spectral density with a finite sum of Lorentzian functions. This technique helps simplify the complex environmental interactions into manageable, discrete components for simulation.
Star-to-Chain Transformation
This approach uses an iterative process called the Lanczos iteration to identify a one-dimensional chain of discrete bosonic modes that effectively mimics the original, more complex environment. It provides a way to map the continuous environmental interaction onto a simpler, countable set of modes.

Terminology

Summary

The gist: This letter shows that under some physically motivated assumptions on the system-environment interaction, the finite-time dynamics of the nonMarkovian open quantum system computed with a sufficiently large number of modes is guaranteed to converge to the true result.

Modeling Non-Markovian Dynamics

Non-Markovian effects are important in modeling the behavior of open quantum systems arising in solidstate physics, quantum optics as well as in study of biological and chemical systems. The non-Markovian environment is often approximated by discrete bosonic modes, thus mapping it to a Lindbladian or Hamiltonian simulation problem. Simulating non-Markovian open quantum systems is difficult since it is usually not possible to formulate a dynamical equation for the system state from a given physical model of the system-environment interaction. An alternative approach is to identify and track a set of discrete modes that approximate the environment. For gaussian bosonic environments, two prominent approaches are used: first, using the Lorentzian pseudomode theory, which approximates the spectral density function by a finite sum of Lorentzians, and second, using the star-to-chain transformation, which uses the Lanczos iteration to identify a 1D chain of discrete bosonic modes with nearest neighbour couplings that approximate the environment.

Convergence Guarantees for Approximations

The paper provides general and rigorous convergence guarantees for discrete-mode approximations of nonMarkovian gaussian bosonic environments. For a wide and physically-motivated class of non-Markovian models, both the Lorentzian pseudomode approximation and the star-to-chain transformation is guaranteed to converge and the approximation error falls off polynomially with the number of pseudomodes. The results lend rigor to classical and quantum algorithms for approximating non-Markovian dynamics.

Conditions for Rigorous Analysis

To perform this convergence study, several theoretical challenges are resolved by identifying physically motivated sufficient mathematical conditions on the system-environment dynamics that allow for rigorously neglecting the high energy modes in the environment. The analysis combines an analysis of the Lorentzian pseudo-mode approximation and the star-to-chain transformation within a truncated environment energy window. These conditions are formalized through two main assumptions:

(Assumption 1)

The coupling function v ∈ C∞b(R) is such that there is a function V (ωc, t) which vanishes as ωc → ∞ ∀t ≥ 0 and l(Kv − Kvωc, t) ≤ V (ωc, t), where vωc(ω) = v(ω) if ω ≤ ωc and otherwise 0.

(Assumption 2)

∀t ≥ 0, s ∈ [0, t]N−1, the map GN (s;t): [0, t] → L(HS) is absolutely continuous and ∃γ(t) > 0 such that esssup of the N-point Green’s function is bounded by γ(t) kLk N.

Convergence Rates and Error Estimates

Theorem 1 establishes a bound on the error between the true reduced state ρ(t) and its approximation ρωc(t), showing that kρ(t) − ρωc(t)ktr ≤ ε(ωc, t), where ε(ωc, t) is the cutoff error. This error is given by ε(ωc, t) = f1(t)√ωc + Z t 0 f2(τ) p V (ωc, τ)dτ, with specific functions for the cutoff error. Theorem 2 shows that for the pseudomode approximation, there exists a description with M bosonic modes such that kρ(t) − ρˆ(t)ktr → 0 as M → ∞. Furthermore, if v'(ω) = O(poly(ω)) and the cutoff error ε(ωc, t) = O(exp(O(t))poly(ω−1c)), then the trace-norm error scales as O(exp(O(t))poly(M−1)>. Theorem 3 confirms that the star-to-chain transformation also converges, and the trace-norm error scales as O(exp(O(t))poly(M−1)>.

Extension to Initially Excited Environments

Theorem 1' extends the main result to an initially excited environment state by introducing Assumption 3, which bounds the initial environment state's deviation from a finite frequency window. Under these conditions, the cutoff error is given by ε(ωc, t) = √2∆(ωc) + f1(t)√ωc + Z t 0 f2(τ) p V (ωc, τ)dτ.

Key Results in Detailed Proofs

The proof for the star-to-chain transformation involves an algorithm that generates parameters such as ai = R ωc −ωc v(ω)p i(ω)dω qR ωc −ωc v(ω)2 p 2 i(ω)dΩ. The analysis of the error in approximating the magnitude square of the coupling function with a sum of Lorentzians is shown to be O(M−1/8). This demonstrates that choosing ωc and κ appropriately ensures that both the cutoff error and the Lorentzian approximation error decrease polynomially with M. The study also includes an analysis of the initial environment state, showing how it contributes to the total approximation error.

The paper concludes by providing a rigorous analysis of Markovian dilations to non-Markovian open quantum systems. Several questions of interest to open quantum system theory are left open in this work.

Improvements for AI systems

  1. Improved simulation of non-Markovian dynamics via discrete mode approximations: The system can now compute the finite-time dynamics of the nonMarkovian open quantum system computed with a sufficiently large number of modes with guaranteed convergence, ensuring that the approximation error falls off polynomially with the number of modes.

  2. Enhanced algorithmic complexity reduction for classical and quantum algorithms: These rigorous bounds lend rigor to classical and quantum algorithms for approximating non-Markovian dynamics, allowing practitioners to design computationally tractable simulations based on the identified discrete modes.

  3. Accurate modeling of physically relevant environments using distributional kernels: The framework extends convergence guarantees to non-Markovian systems described by a distributional memory kernel, such as those commonly encountered in quantum optics, enabling more realistic simulation of complex physical phenomena where traditional methods fail.

  4. Precise control over high-frequency environmental noise: By utilizing the cutoff error estimate ε(ωc, t) = f1(t)√ωc + Z t0 f2(τ) p V (ωc, τ)dτ, the system can quantify how much its dynamics change when only a finite frequency window is considered, providing a quantitative measure of this effect.

  5. Robust simulation for initially excited environments: The results are extended to initially excited environment states via Theorem 1', allowing simulations involving mixed initial states (ensemble descriptions) to be rigorously compared against Markovian approximations.

Abstract

Non-Markovian effects are important in modeling the behavior of open quantum systems arising in solid-state physics, quantum optics as well as in study of biological and chemical systems. The non-Markovian environment is often approximated by discrete bosonic modes, thus mapping it to a Lindbladian or Hamiltonian simulation problem. While systematic constructions of such modes have been previously proposed, the resulting approximation lacks rigorous and general convergence guarantees. In this letter, we show that under some physically motivated assumptions on the system-environment interaction, the finite-time dynamics of the non-Markovian open quantum system computed with a sufficiently large number of modes is guaranteed to converge to the true result. Furthermore, we show that this approximation error typically falls off polynomially with the number of modes. Our results lend rigor to classical and quantum algorithms for approximating non-Markovian dynamics.

Sources

Related papers