Fingerprint and universal Markovian closure of structured bosonic environments

• URL: http://arxiv.org/abs/2208.01978v2
• Date: Mon, 3 Oct 2022 07:35:22 GMT
• Title: Fingerprint and universal Markovian closure of structured bosonic environments
• Authors: Alexander N\"u{\ss}eler, Dario Tamascelli, Andrea Smirne, James Lim, Susana F. Huelga, and Martin B. Plenio
• Abstract summary: We exploit the properties of chain mapping transformations of bosonic environments to identify a finite collection of modes able to capture the characteristic features, or fingerprint, of the environment. We show that the Markovian closure provides a quadratic speed-up with respect to standard chain mapping techniques.
• Score: 53.869623568923515
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We exploit the properties of chain mapping transformations of bosonic environments to identify a finite collection of modes able to capture the characteristic features, or fingerprint, of the environment. Moreover we show that the countable infinity of residual bath modes can be replaced by a universal Markovian closure, namely a small collection of damped modes undergoing a Lindblad-type dynamics whose parametrization is independent of the spectral density under consideration. We show that the Markovian closure provides a quadratic speed-up with respect to standard chain mapping techniques and makes the memory requirement independent of the simulation time, while preserving all the information on the fingerprint modes. We illustrate the application of the Markovian closure to the computation of linear spectra but also to non-linear spectral response, a relevant experimentally accessible many body coherence witness for which efficient numerically exact calculations in realistic environments are currently lacking.

Related papers

• Nonstationary Sparse Spectral Permanental Process [24.10531062895964]
  We propose a novel approach utilizing the sparse spectral representation of nonstationary kernels. This technique relaxes the constraints on kernel types and stationarity, allowing for more flexible modeling. Experimental results on both synthetic and real-world datasets demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-10-04T16:40:56Z)
• Spectral Density Modulation and Universal Markovian Closure of Fermionic Environments [0.6990493129893112]
  We show how a thermo-chemical modulation of the spectral density allows replacing the original fermionic environments with simpler, but simpler, ones. We then provide a derivation of the fermionic Markovian closure construction, consisting of a small collection of damped fermionic modes. We describe, in particular, how the use of the Markovian closure allows for a reduction of the time complexity of chain-mapping based algorithms.
  arXiv  Detail & Related papers  (2024-07-13T22:13:44Z)
• Mapping the Multiverse of Latent Representations [17.2089620240192]
  PRESTO is a principled framework for mapping the multiverse of machine-learning models that rely on latent representations. Our framework uses persistent homology to characterize the latent spaces arising from different combinations of diverse machine-learning methods.
  arXiv  Detail & Related papers  (2024-02-02T15:54:53Z)
• Real-space detection and manipulation of topological edge modes with ultracold atoms [56.34005280792013]
  We demonstrate an experimental protocol for realizing chiral edge modes in optical lattices. We show how to efficiently prepare particles in these edge modes in three distinct Floquet topological regimes. We study how edge modes emerge at the interface and how the group velocity of the particles is modified as the sharpness of the potential step is varied.
  arXiv  Detail & Related papers  (2023-04-04T17:36:30Z)
• GFlowNet-EM for learning compositional latent variable models [115.96660869630227]
  A key tradeoff in modeling the posteriors over latents is between expressivity and tractable optimization. We propose the use of GFlowNets, algorithms for sampling from an unnormalized density. By training GFlowNets to sample from the posterior over latents, we take advantage of their strengths as amortized variational algorithms.
  arXiv  Detail & Related papers  (2023-02-13T18:24:21Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• Noise-resilient Edge Modes on a Chain of Superconducting Qubits [103.93329374521808]
  Inherent symmetry of a quantum system may protect its otherwise fragile states. We implement the one-dimensional kicked Ising model which exhibits non-local Majorana edge modes (MEMs) with $mathbbZ$ parity symmetry. MEMs are found to be resilient against certain symmetry-breaking noise owing to a prethermalization mechanism.
  arXiv  Detail & Related papers  (2022-04-24T22:34:15Z)
• Pseudomode description of general open quantum system dynamics: non-perturbative master equation for the spin-boson model [0.0]
  We outline a non-perturbative approach for simulating the behavior of open quantum systems interacting with a bosonic environment. Our framework can be used as a powerful and versatile tool for analyzing non-Markovian open system dynamics.
  arXiv  Detail & Related papers  (2021-08-12T13:49:22Z)
• Generalized theory of pseudomodes for exact descriptions of non-Markovian quantum processes [0.0]
  We develop an exact framework to describe the non-Markovian dynamics of an open quantum system. We show how expanding the system using discrete modes allows for the full inclusion of non-Markovian effects.
  arXiv  Detail & Related papers  (2020-02-22T17:45:34Z)
• Distributed, partially collapsed MCMC for Bayesian Nonparametrics [68.5279360794418]
  We exploit the fact that completely random measures, which commonly used models like the Dirichlet process and the beta-Bernoulli process can be expressed as, are decomposable into independent sub-measures. We use this decomposition to partition the latent measure into a finite measure containing only instantiated components, and an infinite measure containing all other components. The resulting hybrid algorithm can be applied to allow scalable inference without sacrificing convergence guarantees.
  arXiv  Detail & Related papers  (2020-01-15T23:10:13Z)

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.