How quantum evolution with memory is generated in a time-local way

• URL: http://arxiv.org/abs/2002.07232v2
• Date: Wed, 26 May 2021 10:21:36 GMT
• Title: How quantum evolution with memory is generated in a time-local way
• Authors: Konstantin Nestmann, Valentin Bruch, Maarten Rolf Wegewijs
• Abstract summary: Two approaches to dynamics of open quantum systems are Nakajima-Zwanzig and time-convolutionless quantum master equation. We show that the two are connected by a simple yet general fixed-point relation. This allows one to extract nontrivial relations between the two.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Two widely used but distinct approaches to the dynamics of open quantum systems are the Nakajima-Zwanzig and time-convolutionless quantum master equation, respectively. Although both describe identical quantum evolutions with strong memory effects, the first uses a time-nonlocal memory kernel $\mathcal{K}$, whereas the second achieves the same using a time-local generator $\mathcal{G}$. Here we show that the two are connected by a simple yet general fixed-point relation: $\mathcal{G} = \hat{\mathcal{K}}[\mathcal{G}]$. This allows one to extract nontrivial relations between the two completely different ways of computing the time-evolution and combine their strengths. We first discuss the stationary generator, which enables a Markov approximation that is both nonperturbative and completely positive for a large class of evolutions. We show that this generator is not equal to the low-frequency limit of the memory kernel, but additionally "samples" it at nonzero characteristic frequencies. This clarifies the subtle roles of frequency dependence and semigroup factorization in existing Markov approximation strategies. Second, we prove that the fixed-point equation sums up the time-domain gradient / Moyal expansion for the time-nonlocal quantum master equation, providing nonperturbative insight into the generation of memory effects. Finally, we show that the fixed-point relation enables a direct iterative numerical computation of both the stationary and the transient generator from a given memory kernel. For the transient generator this produces non-semigroup approximations which are constrained to be both initially and asymptotically accurate at each iteration step.

Related papers

• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games [31.554420227087043]
  We propose a two-timescale smoothed $Q$-learning algorithm with function approximation that is payoff-based, convergent, rational, and symmetric between the two players. In two-timescale $Q$-learning, the fast-timescales are updated in spirit to the gradient descent and the slow-timescales are updated by taking a convex combination between its previous and the latest fast-timescale. The key novelty lies in constructing a valid Lyapunov function to capture the evolution of the slow-timescales.
  arXiv  Detail & Related papers  (2023-12-08T08:39:36Z)
• Solving High Frequency and Multi-Scale PDEs with Gaussian Processes [18.190228010565367]
  PINNs often struggle to solve high-frequency and multi-scale PDEs. We resort to the Gaussian process (GP) framework to solve this problem. We use Kronecker product properties and multilinear algebra to promote computational efficiency and scalability.
  arXiv  Detail & Related papers  (2023-11-08T05:26:58Z)
• Free expansion of a Gaussian wavepacket using operator manipulations [77.34726150561087]
  The free expansion of a Gaussian wavepacket is a problem commonly discussed in undergraduate quantum classes. We provide an alternative way to calculate the free expansion by recognizing that the Gaussian wavepacket can be thought of as the ground state of a harmonic oscillator. As quantum instruction evolves to include more quantum information science applications, reworking this well known problem using a squeezing formalism will help students develop intuition for how squeezed states are used in quantum sensing.
  arXiv  Detail & Related papers  (2023-04-28T19:20:52Z)
• Efficient Light Propagation Algorithm using Quantum Computers [0.3124884279860061]
  One of the cornerstones in modern optics is the beam propagation algorithm. We show that the propagation can be performed as a quantum computation with $mathcalO(logN)$ single-controlled phase gates. We highlight the importance of the selection of suitable observables to retain the quantum advantage.
  arXiv  Detail & Related papers  (2023-03-13T11:47:09Z)
• Quantum dynamics of coupled excitons and phonons in chain-like systems: tensor train approaches and higher-order propagators [0.0]
  We investigate the solution of the time-dependent Schr"odinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing the memory consumption as well as the computation costs.
  arXiv  Detail & Related papers  (2023-02-07T16:28:53Z)
• Simulating Markovian open quantum systems using higher-order series expansion [1.713291434132985]
  We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
  arXiv  Detail & Related papers  (2022-12-05T06:02:50Z)
• The connection between time-local and time-nonlocal perturbation expansions [0.0]
  We show that a series for the kernel $mathcalK$ to be translated directly into a corresponding series for the more complicated generator $mathcalG$. We illustrate this for leading and next-to-leading order calculations of $mathcalK$ and $mathcalG$ for the single impurity Anderson model.
  arXiv  Detail & Related papers  (2021-07-19T15:05:29Z)
• Sparse Algorithms for Markovian Gaussian Processes [18.999495374836584]
  Sparse Markovian processes combine the use of inducing variables with efficient Kalman filter-likes recursion. We derive a general site-based approach to approximate the non-Gaussian likelihood with local Gaussian terms, called sites. Our approach results in a suite of novel sparse extensions to algorithms from both the machine learning and signal processing, including variational inference, expectation propagation, and the classical nonlinear Kalman smoothers. The derived methods are suited to literature-temporal data, where the model has separate inducing points in both time and space.
  arXiv  Detail & Related papers  (2021-03-19T09:50:53Z)
• Complete entropic inequalities for quantum Markov chains [17.21921346541951]
  We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional algebra satisfies a modified log-Sobolev inequality. We also establish the first general approximateization property of relative entropy.
  arXiv  Detail & Related papers  (2021-02-08T11:47:37Z)
• Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines [13.704881067616995]
  We introduce the general framework of asymmetric random periodic features, where the two signals of interest are observed through random periodic features. We prove uniform probabilistic error bounds holding for all signal pairs from an infinite low-complexity set.
  arXiv  Detail & Related papers  (2020-04-14T14:44:54Z)

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.